Rectangular grid drawings of plane graphs

DOI10.1007/3-540-61332-3_142zbMath1529.68223OpenAlexW1590518252WikidataQ60608630 ScholiaQ60608630MaRDI QIDQ6142896

Shin-ichi Nakano, Takao Nishizeki, Unnamed Author

Publication date: 29 January 2024

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

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_142

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Drawing plane graphs nicely
• On area-efficient drawings of rectangular duals for VLSI floor-plan
• How to draw a planar graph on a grid
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Planar graphs: Theory and algorithms
• Algorithms for drawing graphs: An annotated bibliography
• An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
• On Finding the Rectangular Duals of Planar Triangular Graphs

This page was built for publication: Rectangular grid drawings of plane graphs