+- MKLab (https://mklab.gr)
+-- Forum: [INDEX] (https://mklab.gr/forumdisplay.php?fid=1)
+--- Forum: MATHEMATICS (https://mklab.gr/forumdisplay.php?fid=3)
+---- Forum: ARTICLES (https://mklab.gr/forumdisplay.php?fid=13)
+----- Forum: GEOMETRY (https://mklab.gr/forumdisplay.php?fid=150)
+----- Thread: Circle packing theorem (/showthread.php?tid=1900)
Circle packing theorem - mklabgr - 09-07-2026
Summary
The Circle Packing Theorem, also known as the Koebe–Andreev–Thurston theorem, establishes a striking bridge between planar graph theory and geometry. Given a finite connected simple planar graph $G$, one can construct a collection of circles with disjoint interiors such that two circles are tangent exactly when the corresponding vertices of $G$ are connected by an edge. Thus every planar graph can be represented geometrically purely through tangencies of circles. When $G$ is maximal planar, the resulting packing is essentially unique: any two such packings differ only by reflections and Möbius transformations.
The theorem has deep connections with complex analysis, conformal geometry, topology and hyperbolic geometry. William Thurston showed that increasingly fine circle packings can be used as discrete approximations to conformal mappings; in particular, mappings constructed from packings with circles of radius roughly $1/n$ converge, as $n\to\infty$, to the conformal maps appearing in the Riemann mapping theorem. The theory also extends from the Euclidean plane to the sphere, hyperbolic plane and more general Riemann surfaces, where the geometry of the underlying surface determines the appropriate form of the packing.
Circle packing theory has numerous applications, including graph drawing, planar separator theorems, polyhedral realizations, random walks, conformal mapping, mesh generation and even visualization of the human brain. The theorem was first proved by Paul Koebe in 1936, while later work by Andreev and especially Thurston greatly expanded its interpretation and importance. Thurston's conjecture that circle packings approximate Riemann mappings was proved by Burton Rodin and Dennis Sullivan in 1987, helping establish circle packing as an important form of discrete conformal geometry.
Key takeaways
- Every finite planar graph can be represented by mutually tangent circles.
- Vertices $\leftrightarrow$ circles and edges $\leftrightarrow$ tangencies.
- For maximal planar graphs, the packing is unique up to Möbius transformations and reflection.
- The theorem provides a powerful link between graph theory, geometry and complex analysis, particularly as a discrete analogue of conformal mapping.
ARTICLE