Drawing graphs on rectangular grids

DOI10.1016/0166-218X(94)00020-EzbMath0853.05030MaRDI QIDQ1902892

Markus W. Schäffter

Publication date: 3 December 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

embeddingrectangular grids

Mathematics Subject Classification ID

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

Related Items (11)

Algorithms for area-efficient orthogonal drawing ⋮ A better heuristic for orthogonal graph drawings ⋮ Vertex Contact Graphs of Paths on a Grid ⋮ Bend-optimal orthogonal graph drawing in the general position model ⋮ Orthogonal drawing of high degree graphs with small area and few bends ⋮ An annotated review on graph drawing and its applications ⋮ Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible ⋮ Square-Orthogonal Drawing with Few Bends per Edge ⋮ Non-planar square-orthogonal drawing with few-bend edges ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Optimal two-sided embeddings of complete binary trees in rectangular grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing an st-numbering
• Drawing planar graphs using the canonical ordering
• On minimal-node-cost planar embeddings
• Universality considerations in VLSI circuits

This page was built for publication: Drawing graphs on rectangular grids