A note on 3D orthogonal graph drawing

DOI10.1016/J.DAM.2005.02.003zbMATH Open1071.05052OpenAlexW1973455746MaRDI QIDQ2486752FDOQ2486752

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

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

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)

Cites Work

• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Three-dimensional orthogonal graph drawing algorithms
• 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
• 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
• Title not available (Why is that?)
• Bounds For Orthogonal 3-D Graph Drawing
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

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

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)