Timeline for Covering convex polygons with inscribed disks
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 26, 2013 at 0:41 | comment | added | Yoav Kallus | Better yet probably, start with a fixed Apollonian gasket in a triangle, triangulate $P$, take a conformal map mapping vertices to vertices from the original triangle to the triangles that make up $P$. Presumably this conformal map is common enough that is implemented in some library. | |
| Jul 26, 2013 at 0:01 | answer | added | Joseph O'Rourke | timeline score: 5 | |
| Jul 25, 2013 at 23:36 | history | edited | Ricardo Andrade |
added top level tag
|
|
| Jul 25, 2013 at 23:17 | comment | added | Yoav Kallus | Maybe starting with a fixed Apollonian gasket and using a conformal map to map the unit disk to $P$ could be an approach which could be made to work? | |
| Jul 25, 2013 at 22:45 | answer | added | Yoav Kallus | timeline score: 4 | |
| Jul 25, 2013 at 21:10 | comment | added | user25199 | Greedy is an interesting problem, leading to Apollonian packings. But as you say, probably not optimal. An alternative, regular lattices of small disks, may not be optimal either. So, good question! Of course, removing any disk (not just greedy) leads to a non-convex non-polytope. | |
| Jul 25, 2013 at 19:39 | history | asked | Vidit Nanda | CC BY-SA 3.0 |