The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing

DOI10.1007/978-3-642-00219-9_9MaRDI QIDQ3611839zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• The complexity of bendless three-dimensional orthogonal graph drawing
• Orthogonal Drawings of Plane Graphs Without Bends
• Three-dimensional orthogonal graph drawing algorithms
• Colorability in Orthogonal Graph Drawing
• scientific article; zbMATH DE number 2084292

Cites work

• 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
• Adjacent Vertices on a Permutohedron
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
• Bounds For Orthogonal 3-D Graph Drawing
• Computing an st-numbering
• Fully dynamic \(3\)-dimensional orthogonal graph drawing
• Group Action Graphs and Parallel Architectures
• scientific article; zbMATH DE number 2084286 (Why is no real title available?)
• scientific article; zbMATH DE number 2079390 (Why is no real title available?)
• scientific article; zbMATH DE number 824939 (Why is no real title available?)
• Isometric Diamond Subgraphs
• Optimal three-dimensional layout of interconnection networks
• 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 with optimal volume

Cited in

(10)

• 1-bend 3-D orthogonal box-drawings: Two open problems solved
• Hardness of approximate compaction for nonplanar orthogonal graph drawings
• Three-Dimensional 1-Bend Graph Drawings
• Isometric Diamond Subgraphs
• About half permutations
• The complexity of bendless three-dimensional orthogonal graph drawing
• Ideal spatial graph configurations
• Drawing Kn in Three Dimensions with One Bend per Edge
• Graph Drawing
• On the construction of planar embedding for a class of orthogonal polyhedra

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

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