[Coordinate geometry] How to solve this ?

Правка en2, от ex_hausted, 2021-08-23 06:05:49

Can someone please explain how to solve this question ?

Given a continuous plane, there are N circles each having coordinate like (cix, ciy) and radius ri. Given a rectangle( the rectangle has length parallel to x-axis and breadth parallel to y-axis) having top-left corner as P1(p1x, p1y) and bottom-right corner as P2(p2x, p2y). Tell if it is possible( true or false ) to travel from P1 to P2 without touching or crossing the circles while being inside the rectangle.

NOTES:

  • The coordinates are NOT necessarily integer coordinates.
  • The trajectory of travel from P1 to P2 may not necessarily be a straight line, it can be anything (think of it like a river).
Теги #geometry, coordinate geometry

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский ex_hausted 2021-08-23 06:05:49 4 Tiny change: 'ble(**true** or **false**) t' -> 'ble(**true or false**) t'
en1 Английский ex_hausted 2021-08-23 06:04:11 837 Initial revision (published)