LIPIcs.SoCG.2016.69.pdf
- Filesize: 0.58 MB
- 4 pages
Document
Exploring Circle Packing Algorithms
Authors
-
Part of:
Volume:
32nd International Symposium on Computational Geometry (SoCG 2016)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-06-10
Cite As Get BibTex
Kevin Pratt, Connor Riley, and Donald Sheehy. Exploring Circle Packing Algorithms. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 69:1-69:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.SoCG.2016.69
Abstract
We present an interactive tool for visualizing and experimenting with different circle packing algorithms.
Subject Classification
Keywords
- Computational Geometry
- Processing
- Javascript
- Visualization
- Incremental Algorithms
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Alexander I. Bobenko and Boris A. Springborn. Variational principles for circle patterns and koebe’s theorem. Transactions of the American Mathematical Society, 356(2):659-689, 2003.
-
Yves Colin de Verdière. Un principe variationnel pour les empilements de cercles. Inventiones mathematicae, 104(1):655-669, 1991.
-
Jonathan A. Kelner. Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus. SIAM J. Comput., 35(4):882-902, 2006.
-
Gary L. Miller, Shang-Hua Teng, William Thurston, and Stephen A. Vavasis. Separators for sphere-packings and nearest neighbor graphs. J. ACM, 44(1):1-29, 1997.
-
Bojan Mohar. A polynomial time circle packing algorithm. Discrete Mathematics, 117(1-3):257-263, 1993.
-
Kenneth Stephenson. Introduction to Circle Packing. Cambridge University Press, New York, New York, 2005.