A proof of the Koebe-Andre'ev-Thurston theorem via flow from tangency packings
John C. Bowers

TL;DR
This paper extends a method for circle packings to include overlaps, providing a new proof of the Koebe-Andre'ev-Thurston theorem and a numerical algorithm, by connecting circle configurations with hyperbolic geometry in Minkowski space.
Contribution
It generalizes the flip-and-flow method to overlapping circle packings and introduces a Minkowski space framework for analyzing circle polyhedra.
Findings
Extended the circle packing theorem to include overlaps up to π/2.
Provided a numerical algorithm for computing overlapping circle packings.
Proved all convex circle polyhedra are infinitesimally rigid.
Abstract
Recently, Connelly and Gortler gave a novel proof of the circle packing theorem for tangency packings by introducing a hybrid combinatorial-geometric operation, flip-and-flow, that allows two tangency packings whose contact graphs differ by a combinatorial edge flip to be continuously deformed from one to the other while maintaining tangencies across all of their common edges. Starting from a canonical tangency circle packing with the desired number of circles a finite sequence of flip-and-flow operations may be applied to obtain a circle packing for any desired (proper) contact graph with the same number of circles. In this paper, we extend the Connelly-Gortler method to allow circles to overlap by angles up to . As a result, we obtain a new proof of the general Koebe-Andre'ev-Thurston theorem for disk packings on with overlaps and a numerical algorithm for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Materials and Mechanics · Geometric and Algebraic Topology
