Orthogonal Drawings for Plane Graphs with Specified Face Areas

DOI10.1007/978-3-540-72504-6_53MaRDI QIDQ5425470zbMATH OpenOpenAlexFDO

Authors Akifumi Kawaguchi, Hiroshi Nagamochi

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

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

Recommendations

• On orthogonally convex drawings of plane graphs
• Orthogonal drawings based on the stratification of planar graphs
• Orthogonal drawings based on the stratification of planar graphs
• Drawing planar graphs with prescribed face areas
• Drawing planar graphs with prescribed face areas
• Computing and Combinatorics
• Smooth Orthogonal Drawings of Planar Graphs
• scientific article; zbMATH DE number 2084292
• Orthogonal Drawings of Plane Graphs Without Bends
• On orthogonally convex drawings of plane graphs (extended abstract)

Cited in

(18)

• Octagonal drawings of plane graphs with prescribed face areas
• Drawing slicing graphs with face areas
• Algorithms for area-efficient orthogonal drawing
• Orthogonal drawings based on the stratification of planar graphs
• On the area-universality of triangulations
• Small-area orthogonal drawings of 3-connected graphs
• Drawing planar 3-trees with given face-areas
• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Orthogonal cartograms with at most 12 corners per face
• Drawing planar graphs with prescribed face areas
• Orthogonal Drawings of Plane Graphs Without Bends
• RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
• Orthogonal cartograms with few corners per face
• Smooth Orthogonal Drawings of Planar Graphs
• Graph-Theoretic Concepts in Computer Science
• On area-universal quadrangulations
• Computing cartograms with optimal complexity
• An annotated review on graph drawing and its applications

This page was built for publication: Orthogonal Drawings for Plane Graphs with Specified Face Areas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425470)