Timeline for Covering convex polygons with inscribed disks
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 26, 2013 at 1:48 | comment | added | Joseph O'Rourke | That image is taken from Fig.1 of the paper I cited; I just wanted to illustrate the gaps. The computation of one disk to fill such a gap with the largest disk is easy, and then you are left with the same type of gaps for the next iteration. | |
| Jul 26, 2013 at 1:32 | comment | added | Vidit Nanda | Thanks for the answer (and the picture)! Is there a general reason why filling 3 and 4 gaps is easier? One could concoct a long skinny 3-gap which would presumably take more disks to cover than, say, a more regular shape. Also, in the application it is necessary to have the disks completely contained in the polytope (so the boundary disks in your picture would be disallowed). | |
| Jul 26, 2013 at 0:11 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Typo.
|
| Jul 26, 2013 at 0:01 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |