Bounds For Orthogonal 3-D Graph Drawing

DOI10.7155/JGAA.00018MaRDI QIDQ4505000zbMATH OpenOpenAlexFDO

Authors

Publication date 19 September 2000

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/48533

zbMATH Keywords

orthogonal grid drawings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 2080107
• scientific article; zbMATH DE number 2080105
• Three-dimensional orthogonal graph drawing algorithms
• 1-bend 3-D orthogonal box-drawings: Two open problems solved
• Three-dimensional orthogonal graph drawing with optimal volume

Cited in

(22)

• The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
• Colorability in Orthogonal Graph Drawing
• Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
• Upward book embeddability of \(st\)-graphs: complexity and algorithms
• A note on 3D orthogonal graph drawing
• scientific article; zbMATH DE number 2084286 (Why is no real title available?)
• Linear layouts of bipartite planar graphs
• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
• Fully dynamic \(3\)-dimensional orthogonal graph drawing
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• Three-dimensional orthogonal graph drawing algorithms
• Upward book embeddings of st-graphs
• Bend-optimal orthogonal drawings of triconnected plane graphs
• scientific article; zbMATH DE number 2080109 (Why is no real title available?)
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Realization of graphs in the space of bounded height
• Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
• Embedding problems for paths with direction constrained edges.
• Graph Drawing
• scientific article; zbMATH DE number 2080105 (Why is no real title available?)
• scientific article; zbMATH DE number 2080107 (Why is no real title available?)
• Three-dimensional orthogonal graph drawing with optimal volume

This page was built for publication: Bounds For Orthogonal 3-D Graph Drawing

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