The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing

DOI10.1007/978-3-642-00219-9_9zbMath1213.05052OpenAlexW1878134661WikidataQ29042394 ScholiaQ29042394MaRDI QIDQ3611839

David Eppstein

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Ideal spatial graph configurations ⋮ Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings ⋮ About half permutations ⋮ On the construction of planar embedding for a class of orthogonal polyhedra ⋮ Isometric Diamond Subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing an st-numbering
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Three-dimensional orthogonal graph drawing with optimal volume
• Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
• Group Action Graphs and Parallel Architectures
• 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
• Isometric Diamond Subgraphs
• Adjacent Vertices on a Permutohedron
• Bounds For Orthogonal 3-D Graph Drawing
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
• Optimal three-dimensional layout of interconnection networks

This page was built for publication: The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing