Drawing Clustered Graphs on an Orthogonal Grid

DOI10.7155/jgaa.00016zbMath0960.05042OpenAlexW2127330160MaRDI QIDQ4504998

Hiroshi Nagamochi, Qingwen Feng, Peter Eades

Publication date: 19 September 2000

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/48709

zbMATH Keywords

algorithmplanar graphsgraphical representationnumber of bendsorthogonal grid rectangular cluster drawings

Mathematics Subject Classification ID

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

Related Items (8)

How to draw the minimum cuts of a planar graph ⋮ Straight-Line Rectangular Drawings of Clustered Graphs ⋮ Drawing \(c\)-planar biconnected clustered graphs ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Completely connected clustered graphs ⋮ Zooming-out on Higraph-based diagrams ⋮ How to draw a clustered tree

This page was built for publication: Drawing Clustered Graphs on an Orthogonal Grid