Timeline for Determine if circle is covered by some set of other circles
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2014 at 22:51 | history | edited | Anton Petrunin | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Oct 4, 2011 at 23:36 | comment | added | Joseph O'Rourke | I fixed the broken Wikipedia link. Also Aurenhammer's paper, "Improved algorithms for discs and balls using power diagrams," [Journal of Algorithms 9 (1985), pp. 151-161], calculates the Voronoi diagram of disks in $O(n \log n)$, which is what David Eppstein is invoking in his answer. | |
| Oct 4, 2011 at 23:34 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Fixed broken Wikipedia link.
|
| Oct 4, 2011 at 20:12 | history | edited | Anton Petrunin | CC BY-SA 3.0 |
added 14 characters in body
|
| Oct 3, 2011 at 22:31 | history | edited | Anton Petrunin | CC BY-SA 3.0 |
edited body; added 28 characters in body
|
| Oct 3, 2011 at 22:23 | history | edited | Anton Petrunin | CC BY-SA 3.0 |
added 255 characters in body; added 2 characters in body
|
| Oct 3, 2011 at 22:16 | history | undeleted | Anton Petrunin | ||
| Sep 30, 2011 at 20:29 | history | deleted | Anton Petrunin | ||
| Sep 30, 2011 at 0:12 | history | edited | Anton Petrunin | CC BY-SA 3.0 |
added 65 characters in body; edited body
|
| Sep 29, 2011 at 4:31 | comment | added | Anton Petrunin | @Carl, Now it should be clear. | |
| Sep 29, 2011 at 4:31 | history | edited | Anton Petrunin | CC BY-SA 3.0 |
added 107 characters in body
|
| Sep 29, 2011 at 2:37 | comment | added | Carl Feynman | Suppose we do 'check the intersections' as you say. What do we check for, and how do we produce the answer by combining the results of the 'checks' at the intersections? | |
| Sep 29, 2011 at 1:33 | history | answered | Anton Petrunin | CC BY-SA 3.0 |