Exploring Circle Packing Algorithms

Authors Kevin Pratt, Connor Riley, Donald Sheehy

Thumbnail PDF


  • Filesize: 0.58 MB
  • 4 pages

Document Identifiers

Author Details

Kevin Pratt
Connor Riley
Donald Sheehy

Cite AsGet 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)


We present an interactive tool for visualizing and experimenting with different circle packing algorithms.
  • Computational Geometry
  • Processing
  • Javascript
  • Visualization
  • Incremental Algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. 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. Google Scholar
  2. Yves Colin de Verdière. Un principe variationnel pour les empilements de cercles. Inventiones mathematicae, 104(1):655-669, 1991. Google Scholar
  3. Jonathan A. Kelner. Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus. SIAM J. Comput., 35(4):882-902, 2006. Google Scholar
  4. 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. Google Scholar
  5. Bojan Mohar. A polynomial time circle packing algorithm. Discrete Mathematics, 117(1-3):257-263, 1993. Google Scholar
  6. Kenneth Stephenson. Introduction to Circle Packing. Cambridge University Press, New York, New York, 2005. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail