Computing cartograms with optimal complexity

DOI10.1145/2261250.2261254zbMath1293.05058arXiv1201.0066OpenAlexW2010712298MaRDI QIDQ5891418

Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt, Md. Jawaherul Alam, Stefan Felsner, Therese C. Biedl

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.0066

zbMATH Keywords

planar graphscartogramscontact graphsgeometric representations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Computing cartograms with optimal complexity

This page was built for publication: Computing cartograms with optimal complexity