Bounds For Orthogonal 3-D Graph Drawing
DOI10.7155/JGAA.00018zbMATH Open0946.05033OpenAlexW2118750586MaRDI QIDQ4505000FDOQ4505000
Author name not available (Why is that?)
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
Recommendations
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)
Cited In (21)
- Upward Book Embeddings of st-Graphs
- Colorability in Orthogonal Graph Drawing
- Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
- Graph Drawing
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- A note on 3D orthogonal graph drawing
- Title not available (Why is that?)
- Linear layouts of bipartite planar graphs
- Fully dynamic \(3\)-dimensional orthogonal graph drawing
- Embedding problems for paths with direction constrained edges.
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Three-dimensional orthogonal graph drawing with optimal volume
- Three-dimensional orthogonal graph drawing algorithms
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
- Title not available (Why is that?)
- Bend-optimal orthogonal drawings of triconnected plane graphs
- The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
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)
