Timeline for Determine if circle is covered by some set of other circles
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 1, 2011 at 2:57 | comment | added | Aaron Golden | I want to point out that the recursive subdivision algorithm can be made a little faster, and the infinite recursion problem can be avoided in the following way: As a first step iterate over $C$ and discard any members, $C_j$, where the sum of the radius of $C_j$ and the radius of $C_{n+1}$ is less than or equal to the distance from the center of $C_j$ to the center of $C_{n+1}$. You could also save yourself a few recursions by making the initial rectangle a square bounding only $C_{n+1}$ instead of a rectangle bounding all of the circles. | |
| Sep 29, 2011 at 2:35 | history | answered | Carl Feynman | CC BY-SA 3.0 |