Orthogonal Cartograms with Few Corners Per Face

DOI10.1007/978-3-642-22300-6_9zbMath1342.68250OpenAlexW1868235818MaRDI QIDQ5199234

Lesvia Elena Ruiz Velázquez, Therese C. Biedl

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Rectilinear Duals Using Monotone Staircase Polygons ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Constrained floorplans in 2D and 3D ⋮ Computing cartograms with optimal complexity ⋮ On the area-universality of triangulations ⋮ On Area-Universal Quadrangulations

This page was built for publication: Orthogonal Cartograms with Few Corners Per Face