The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings

DOI10.1016/S0020-0190(96)00133-0zbMath1022.68625OpenAlexW2094244192WikidataQ126296983 ScholiaQ126296983MaRDI QIDQ1350939

Peter Eades, Charles Stirk, S. H. Whitesides

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00133-0

zbMATH Keywords

algorithmsgraph algorithmscomputational geometrygraph drawing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Optimal three-dimensional orthogonal graph drawing in the general position model. ⋮ On the hardness of range assignment problems ⋮ Three-dimensional graph drawing ⋮ Complexity results for three-dimensional orthogonal graph drawing ⋮ A note on 3D orthogonal graph drawing ⋮ Optimal three-dimensional layout of interconnection networks ⋮ The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Advances in the theory and practice of graph drawing ⋮ Embedding problems for paths with direction constrained edges.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of minimizing wire lengths in VLSI layouts
• Algorithms for drawing graphs: An annotated bibliography
• Three-Dimensional VLSI
• Crossing Number is NP-Complete
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Optimal three-dimensional VLSI layouts
• On the complexity of approximating and illuminating three-dimensional convex polyhedra

This page was built for publication: The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings