A Simple Proof of Thue's Theorem on Circle Packing
Hai-Chau Chang, Lih-Chung Wang

TL;DR
This paper presents a straightforward proof of Thue's circle packing theorem using density analysis of Delaunay triangulation, simplifying the understanding of optimal circle arrangements.
Contribution
It introduces a simplified proof method for Thue's theorem based solely on Delaunay triangulation density analysis.
Findings
Proof is more accessible and easier to understand.
Validates Thue's theorem through a new geometric approach.
Potentially facilitates further research in circle packing problems.
Abstract
A simple proof of Thue theorem on Circle Packing is given. The proof is only based on density analysis of Delaunay triangulation for the set of points that are centers of circles in a saturated circle configuration.
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 · 3D Modeling in Geospatial Applications · Optics and Image Analysis
