Drawing Planar Graphs with Prescribed Face Areas

DOI10.1007/978-3-662-53536-3_14zbMath1417.05137OpenAlexW2527180646MaRDI QIDQ3181055

Linda Kleist

Publication date: 22 December 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://jocg.org/index.php/jocg/article/view/3055

Mathematics Subject Classification ID

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 (3)

Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ On Area-Universal Quadrangulations ⋮ Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles

Cites Work

• Unnamed Item
• Unnamed Item
• On grid intersection graphs
• Drawing planar 3-trees with given face areas
• Area-Universal and Constrained Rectangular Layouts
• Floorplans, planar graphs, and layouts
• Plane Cubic Graphs with Prescribed Face Areas
• On Triangle Contact Graphs
• Exploiting Air-Pressure to Map Floorplans on Point Sets
• Computing cartograms with optimal complexity
• Proportional Contact Representations of Planar Graphs

This page was built for publication: Drawing Planar Graphs with Prescribed Face Areas