A note on 3D orthogonal graph drawing

DOI10.1016/J.DAM.2005.02.003MaRDI QIDQ2486752zbMATHOpenAlexFDO

Authors Timothy M. Chan, Therese 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)

Recommendations

• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• Three-dimensional orthogonal graph drawing with optimal volume
• A note on 3D orthogonal drawings with direction constrained edges
• Bounds For Orthogonal 3-D Graph Drawing
• scientific article; zbMATH DE number 2080107

Cites work

• scientific article; zbMATH DE number 2084285 (Why is no real title available?)
• scientific article; zbMATH DE number 2080107 (Why is no real title available?)
• scientific article; zbMATH DE number 3291152 (Why is no real title available?)
• Bounds For Orthogonal 3-D Graph Drawing
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Fully dynamic \(3\)-dimensional orthogonal graph drawing
• Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
• On Edge Coloring Bipartite Graphs
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• Three-dimensional orthogonal graph drawing algorithms

Cited in

(2)

• Complexity results for three-dimensional orthogonal graph drawing
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings

This page was built for publication: A note on 3D orthogonal graph drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486752)