Circle packings of maps in polynomial time

DOI10.1006/EUJC.1996.0135zbMath0891.52008OpenAlexW2003689196WikidataQ126100788 ScholiaQ126100788MaRDI QIDQ1372615

Bojan Mohar

Publication date: 18 November 1997

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0135

zbMATH Keywords

circle packingpolynomial time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Relations of low-dimensional topology with graph theory (57M15)

Related Items (10)

Planar and Toroidal Morphs Made Easier ⋮ Circle packings of maps —The Euclidean case ⋮ Contact Representations of Graphs in 3D ⋮ Planar and toroidal morphs made easier ⋮ Triangulating planar graphs while minimizing the maximum degree ⋮ A linearized circle packing algorithm ⋮ An annotated bibliography on 1-planarity ⋮ Variational principles for branched circle patterns ⋮ Tree amalgamation of graphs and tessellations of the Cantor sphere ⋮ Conformal mapping in linear time

This page was built for publication: Circle packings of maps in polynomial time