Circle Packing and Its Applications
4,954 views · Published 22 June 2016 · 1:03:45 · Indexed 21 October 2026
Channel: Microsoft Research · 2016 · Science & Technology
The Koebe-Andreev-Thurston Circle Packing Theorem lets us draw planar graphs in a canonical way, so that the geometry of the drawing reveals analytic properties of the graph. In this talk, I will review the theory of circle packing and show several applications, old and new, to probability on planar graphs.
