Drawing slicing graphs with face areas

DOI10.1016/j.tcs.2008.10.038zbMath1162.68026OpenAlexW2009461451MaRDI QIDQ1007248

Hiroshi Nagamochi, Akifumi Kawaguchi

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.038

zbMATH Keywords

graph algorithmsgraph drawingplane graphsorthogonal drawingslicing graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Rectilinear Duals Using Monotone Staircase Polygons ⋮ Constrained floorplans in 2D and 3D ⋮ An annotated review on graph drawing and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the optimal binary plane partition for sets of isothetic rectangles
• Graph drawing software
• Bemerkungen zum Vierfarbenproblem
• Convex Representations of Graphs
• Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Sliceable Floorplanning by Graph Dualization
• Graph-Theoretic Concepts in Computer Science
• Convex Maps
• Graph Drawing
• Drawing graphs. Methods and models

This page was built for publication: Drawing slicing graphs with face areas