Optimal three-dimensional orthogonal graph drawing in the general position model.
From MaRDI portal
Publication:1874390
DOI10.1016/S0304-3975(02)00044-0zbMath1040.68069OpenAlexW1972308905MaRDI QIDQ1874390
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00044-0
Related Items (10)
Linkless symmetric drawings of series parallel digraphs ⋮ Bend-optimal orthogonal graph drawing in the general position model ⋮ Imbalance is fixed parameter tractable ⋮ Bounded degree acyclic decompositions of digraphs. ⋮ Complexity results for three-dimensional orthogonal graph drawing ⋮ A note on 3D orthogonal graph drawing ⋮ Balanced vertex-orderings of graphs ⋮ Clean the graph before you draw it! ⋮ The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing ⋮ Imbalance parameterized by twin cover revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-dimensional graph drawing
- Multilayer grid embeddings for VLSI
- Three short proofs in graph theory
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
- Universal 3-dimensional visibility representations for graphs
- Three-dimensional orthogonal graph drawing algorithms
- Balanced vertex-orderings of graphs
- Efficient orthogonal drawings of high degree graphs
- Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
- Three-Dimensional VLSI
- A Visibility Representation for Graphs in Three Dimensions
- Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
- A Split&Push Approach to 3D Orthogonal Drawing
- Drawing with colors
- On the complexity of orthogonal compaction
This page was built for publication: Optimal three-dimensional orthogonal graph drawing in the general position model.
