Drawing Clustered Graphs on an Orthogonal Grid
From MaRDI portal
algorithmgraphical representationnumber of bendsorthogonal grid rectangular cluster drawingsplanar graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cited in
(15)- How to draw a clustered tree
- Clustered planarity = flat clustered planarity
- How to draw the minimum cuts of a planar graph
- Completely connected clustered graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Zooming-out on higraph-based diagrams: syntactic and semantic issues
- scientific article; zbMATH DE number 2084266 (Why is no real title available?)
- Straight-Line Rectangular Drawings of Clustered Graphs
- How to Draw a Clustered Tree
- scientific article; zbMATH DE number 1189242 (Why is no real title available?)
- Straightening Drawings of Clustered Hierarchical Graphs
- Graph Drawing
- How to draw a planar clustered graph
- Straight-line rectangular drawings of clustered graphs
- Drawing \(c\)-planar biconnected clustered graphs
This page was built for publication: Drawing Clustered Graphs on an Orthogonal Grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504998)