A note on 3D orthogonal graph drawing

DOI10.1016/j.dam.2005.02.003zbMath1071.05052OpenAlexW1973455746MaRDI QIDQ2486752

Timothy M. Chan, Therese C. Biedl

Publication date: 17 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.003

zbMATH Keywords

Three-dimensional

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Complexity results for three-dimensional orthogonal graph drawing

Cites Work

• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• Three-dimensional orthogonal graph drawing algorithms
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
• Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
• On Edge Coloring Bipartite Graphs
• Bounds For Orthogonal 3-D Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item