Orthogonal Drawings for Plane Graphs with Specified Face Areas

DOI10.1007/978-3-540-72504-6_53zbMath1200.68171OpenAlexW1876595912MaRDI QIDQ5425470

Hiroshi Nagamochi, Akifumi Kawaguchi

Publication date: 13 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_53

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ An annotated review on graph drawing and its applications ⋮ Computing cartograms with optimal complexity ⋮ On the area-universality of triangulations ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ On Area-Universal Quadrangulations