Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions

DOI10.7155/jgaa.00019zbMath0946.05032OpenAlexW2123428756MaRDI QIDQ4505001

Achilleas Papakostas, Ioannis. G. Tollis

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/48532

zbMATH Keywords

algorithmsorthogonal graph drawing

Mathematics Subject Classification ID

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 (5)

Optimal three-dimensional orthogonal graph drawing in the general position model. ⋮ Complexity results for three-dimensional orthogonal graph drawing ⋮ The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Embedding problems for paths with direction constrained edges.

This page was built for publication: Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions