How to Use
Select graph:
- cd: Contact dim
- Touching: Not overlap
- Penny: d=2 equal
Circle Packing Theorem
Koebe-Andreev-Thurston: every planar graph is a contact graph of circles in 2D! So cd(G) ≤ 2 for planar. This beautiful theorem connects planar topology to sphere packing geometry.
Higher Dimensions
d=3: sphere packing contact graphs. Not all graphs are contact graphs in any fixed d. Apollonian gaskets produce interesting contact graphs. Related to sphere packing density problems.
Step-by-Step Instructions
- 1Select graph.
- 2Compute cd.
- 3Check planarity.
- 4Apply Koebe.
- 5Visualize packing.