Paper Info
Title
Packing Disks by Flipping and Flowing
Abstract
We provide a new type of proof for the Koebe-Andreev-Thurston (KAT) planar circle packing theorem based on combinatorial edge-flips. In particular, we showthat starting from a disk packing with a maximal planar contact graph G, one can remove any flippable edge e(-) of this graph and then continuously flow the disks in the plane, so that at the end of the flow, one obtains a new disk packing whose contact graph is the graph resulting from flipping the edge e(-y) in G. This flow is parameterized by a single inversive distance.
Year
DOI
Venue
2021
10.1007/s00454-020-00242-8
DISCRETE & COMPUTATIONAL GEOMETRY
Keywords
DocType
Volume
Circle packing, Rigidity, Inversive distance
Journal
66
Issue
ISSN
Citations 
4
0179-5376
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Connelly Robert100.34
Steven J. Gortler24205366.17