Minimum-width grid drawings of plane graphs

DOI10.1016/S0925-7721(98)00016-9zbMath0904.68177WikidataQ127395572 ScholiaQ127395572MaRDI QIDQ1265328

Shin-ichi Nakano, Marek Chrobak

Publication date: 11 January 1999

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

zbMATH Keywords

plane graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Drawing Planar Graphs on Area ⋮ A Lower Bound on the Area Requirements of Series-Parallel Graphs ⋮ Grid representations and the chromatic number ⋮ Reprint of: ``Grid representations and the chromatic number ⋮ Small Point Sets for Simply-Nested Planar Graphs ⋮ Rectangular grid drawings of plane graphs ⋮ An annotated review on graph drawing and its applications ⋮ Snapping Graph Drawings to the Grid Optimally ⋮ Compact Grid Representation of Graphs ⋮ Listing All Plane Graphs ⋮ Drawing Planar Graphs with Reduced Height

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for drawing a planar graph on a grid
• Drawing plane graphs nicely
• How to draw a planar graph on a grid
• Area requirement and symmetry display of planar upward drawings
• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• Grid embedding of 4-connected plane graphs
• Drawing planar graphs using the canonical ordering
• Bemerkungen zum Vierfarbenproblem
• TWO TREE DRAWING CONVENTIONS
• How to Draw a Graph
• Convex Maps