Circle packings of maps in polynomial time

DOI10.1006/eujc.1996.0135zbMath0891.52008MaRDI 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 packing; polynomial time algorithm

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C10: Planar graphs; geometric and topological aspects of graph theory

52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)

57M15: Relations of low-dimensional topology with graph theory

Related Items

Triangulating planar graphs while minimizing the maximum degree