Bounds For Orthogonal 3-D Graph Drawing
From MaRDI portal
Publication:4505000
DOI10.7155/jgaa.00018zbMath0946.05033OpenAlexW2118750586MaRDI QIDQ4505000
No author found.
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
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Linear layouts of bipartite planar graphs ⋮ Bend-optimal orthogonal drawings of triconnected plane graphs ⋮ A note on 3D orthogonal graph drawing ⋮ The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing ⋮ Colorability in Orthogonal Graph Drawing ⋮ Upward Book Embeddings of st-Graphs ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Embedding problems for paths with direction constrained edges.