Timeline for upper bound for the number of open discs containing k points in the plane
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2012 at 12:22 | vote | accept | Cain | ||
| Apr 11, 2012 at 8:15 | vote | accept | Cain | ||
| Jun 1, 2012 at 12:22 | |||||
| Apr 8, 2012 at 18:11 | history | edited | Cain | CC BY-SA 3.0 |
added 21 characters in body
|
| Apr 8, 2012 at 17:33 | comment | added | Gerhard Paseman | There is the situation where you have more than 3 points that are closest. Even so, I think your idea can be turned into a solid upper bound once you make clear that the 3 defining points are also inside the disk, and not just near the disk boundary. Gerhard "Ask Me About System Design" Paseman, 2012.04.08 | |
| Apr 8, 2012 at 17:15 | history | answered | Cain | CC BY-SA 3.0 |