Can someone please explain how to solve this question ?↵
↵
Given a continuous plane, there are **N** circles each having coordinate like **(c<sub>i</sub>x, c<sub>i</sub>y)** and radius **r<sub>i</sub>**. Given a rectangle( the rectangle has length parallel to x-axis and breadth parallel to y-axis) having top-left corner as **P1(p<sub>1</sub>x, p<sub>1</sub>y)** and bottom-right corner as **P2(p<sub>2</sub>x, p<sub>2</sub>y)**. 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).**↵
↵
Given a continuous plane, there are **N** circles each having coordinate like **(c<sub>i</sub>x, c<sub>i</sub>y)** and radius **r<sub>i</sub>**. Given a rectangle( the rectangle has length parallel to x-axis and breadth parallel to y-axis) having top-left corner as **P1(p<sub>1</sub>x, p<sub>1</sub>y)** and bottom-right corner as **P2(p<sub>2</sub>x, p<sub>2</sub>y)**. 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).**↵
