Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
From MaRDI portal
Recommendations
Cited in
(14)- Three-dimensional orthogonal graph drawing algorithms
- Embedding problems for paths with direction constrained edges.
- Incremental unknowns and graph techniques in three space dimensions
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- Fully dynamic \(3\)-dimensional orthogonal graph drawing
- The three-phase method: a unified approach to orthogonal graph drawing
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
- The shape of orthogonal cycles in three dimensions
- scientific article; zbMATH DE number 1500687 (Why is no real title available?)
- A Split&Push Approach to 3D Orthogonal Drawing
- scientific article; zbMATH DE number 7286697 (Why is no real title available?)
- The DFS-heuristic for orthogonal graph drawing
- Area-efficient static and incremental graph drawings
- Complexity results for three-dimensional orthogonal graph drawing
This page was built for publication: Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4505001)