#practiceLinkDiv { display: none !important; }Postoje dvije kružnice A i B sa svojim središtima C1(x1 y1) i C2(x2 y2) i radijus R1 i R2 . Zadatak je provjeriti da se krugovi A i B dodiruju ili ne dodiruju.
Primjeri:
Preporučena praksa Provjerite dodiruju li se dva zadana kruga. Pokušajte!unos: C1 = (3 4)
C2 = (14 18)
R1 = 5 R2 = 8
Izlaz: Krugovi se ne dodiruju.
unos: C1 = (2 3)
C2 = (15 28)
R1 = 12 R2 = 10
Izlaz: Krugovi se međusobno sijeku.unos: C1 = (-10 8)
C2 = (14 -24)
R1 = 30 R2 = 10
Pristup:
Udaljenost između središta C1 i C2 izračunava se kao
C1C2 = sqrt((x1 - x2) 2 + (y1 - y2) 2 ).
Postoje tri uvjeta koji se javljaju.
- Ako C1C2<= R1 - R2: Krug B je unutar A.
- Ako C1C2<= R2 - R1: Krug A je unutar B.
- Ako C1C2< R1 + R2: Krug se međusobno siječe.
- Ako C1C2 == R1 + R2: Krug A i B su u dodiru jedan s drugim.
- Inače Krug A i B se ne preklapaju
U nastavku je implementacija gornjeg pristupa:
C++// C++ program to check if two // circles touch each other or not. #include
// Java program to check if two // circles touch each other or not. import java.io.*; class GFG { static void circle(int x1 int y1 int x2 int y2 int r1 int r2) { double d = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); if (d <= r1 - r2) { System.out.println('Circle B is inside A'); } else if (d <= r2 - r1) { System.out.println('Circle A is inside B'); } else if (d < r1 + r2) { System.out.println('Circle intersect' + ' to each other'); } else if (d == r1 + r2) { System.out.println('Circle touch to' + ' each other'); } else { System.out.println('Circle not touch' + ' to each other'); } } // Driver code public static void main(String[] args) { int x1 = -10 y1 = 8; int x2 = 14 y2 = -24; int r1 = 30 r2 = 10; circle(x1 y1 x2 y2 r1 r2); } } // This article is contributed by vt_m.
# Python program to check if two # circles touch each other or not. import math # Function to check if two circles touch each other def circle(x1 y1 x2 y2 r1 r2): d = math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) if(d <= r1 - r2): print('Circle B is inside A') elif(d <= r2 - r1): print('Circle A is inside B') elif(d < r1 + r2): print('Circle intersect to each other') elif(d == r1 + r2): print('Circle touch to each other') else: print('Circle not touch to each other') # Driver code x1 y1 = -10 8 x2 y2 = 14 -24 r1 r2 = 30 10 # Function call circle(x1 y1 x2 y2 r1 r2) # This code is contributed by Aman Kumar
// C# program to check if two // circles touch each other or not. using System; class GFG { static void circle(int x1 int y1 int x2 int y2 int r1 int r2) { double d = Math.Sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); if (d <= r1 - r2) { Console.Write('Circle B is inside A'); } else if (d <= r2 - r1) { Console.Write('Circle A is inside B'); } else if (d < r1 + r2) { Console.Write('Circle intersect' + ' to each other'); } else if (d == r1 + r2) { Console.Write('Circle touch to' + ' each other'); } else { Console.Write('Circle not touch' + ' to each other'); } } // Driver code public static void Main(String[] args) { int x1 = -10 y1 = 8; int x2 = 14 y2 = -24; int r1 = 30 r2 = 10; circle(x1 y1 x2 y2 r1 r2); } } // This article is contributed by Pushpesh Raj.
// JavaScript program to check if two circles touch each other or not. function circle(x1 y1 x2 y2 r1 r2) { var d = Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); if (d <= r1 - r2) { console.log('Circle B is inside A'); } else if (d <= r2 - r1) { console.log('Circle A is inside B'); } else if (d < r1 + r2) { console.log('Circle intersect to each other'); } else if (d === r1 + r2) { console.log('Circle touch to each other'); } else { console.log('Circle not touch to each other'); } } // Driver code var x1 = -10 y1 = 8; var x2 = 14 y2 = -24; var r1 = 30 r2 = 10; circle(x1 y1 x2 y2 r1 r2); // this code is contributed by devendra
Izlaz
Circle touch to each other
Vremenska složenost: O(log(n)) jer koristi ugrađenu sqrt funkciju
Pomoćni prostor: O(1)
Ovaj je članak pridonio Aarti_Rathi i Dharmendra kumar .