Drawing planar 3-trees with given face areas

DOI10.1016/j.comgeo.2012.09.004zbMath1257.05100OpenAlexW2023271676MaRDI QIDQ1931272

Lesvia Elena Ruiz Velázquez, Therese C. Biedl

Publication date: 25 January 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.09.004

zbMATH Keywords

cartogramplanar graphgraph drawing3-tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

Drawing Planar Graphs with Prescribed Face Areas ⋮ RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ Table cartogram ⋮ On the area-universality of triangulations ⋮ On triangulating \(k\)-outerplanar graphs ⋮ Triangulating Planar Graphs While Keeping the Pathwidth Small ⋮ On Area-Universal Quadrangulations ⋮ All subgraphs of a wheel are 5-coupled-choosable

This page was built for publication: Drawing planar 3-trees with given face areas