Three-dimensional orthogonal graph drawing algorithms
From MaRDI portal
Publication:1570822
DOI10.1016/S0166-218X(00)00172-4zbMath0958.68135OpenAlexW2147807119WikidataQ127481738 ScholiaQ127481738MaRDI QIDQ1570822
Antonios Symvonis, Peter Eades, S. H. Whitesides
Publication date: 11 July 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00172-4
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)
Related Items
Optimal three-dimensional orthogonal graph drawing in the general position model. ⋮ 3D straight-line grid drawing of 4-colorable graphs ⋮ Linkless symmetric drawings of series parallel digraphs ⋮ Bend-optimal orthogonal graph drawing in the general position model ⋮ \(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ Complexity results for three-dimensional orthogonal graph drawing ⋮ A note on 3D orthogonal graph drawing ⋮ Optimal three-dimensional layout of interconnection networks ⋮ Balanced vertex-orderings of graphs ⋮ Right Angle Crossing Drawings of Graphs ⋮ Embedding problems for paths with direction constrained edges. ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to visibility representations of planar graphs
- The complexity of minimizing wire lengths in VLSI layouts
- Algorithms for drawing graphs: An annotated bibliography
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
- Algorithms for area-efficient orthogonal drawing
- A better heuristic for orthogonal graph drawings
- Drawing graphs on rectangular grids
- Drawing planar graphs using the canonical ordering
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Three-Dimensional VLSI
- On minimal-node-cost planar embeddings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Bipartite Edge Coloring in $O(\Delta m)$ Time
- Bounds For Orthogonal 3-D Graph Drawing
- Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
- Optimal three-dimensional VLSI layouts
- On Representatives of Subsets