A Split&Push Approach to 3D Orthogonal Drawing

DOI10.7155/JGAA.00027zbMATH Open0953.68108OpenAlexW2120253093MaRDI QIDQ4511259FDOQ4511259

Authors: Giuseppe Di Battista, Maurizio Patrignani 

Publication date: 14 December 2000

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

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

Recommendations

• The three-phase method: a unified approach to orthogonal graph drawing
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
• Three-dimensional orthogonal graph drawing algorithms
• scientific article; zbMATH DE number 1500687
• Fully dynamic \(3\)-dimensional orthogonal graph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (7)

• Complexity results for three-dimensional orthogonal graph drawing
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Embedding problems for paths with direction constrained edges.
• Satisfactory graph partition, variants, and generalizations
• The three-phase method: a unified approach to orthogonal graph drawing
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
• On stable cutsets in claw-free graphs and planar graphs

This page was built for publication: A Split&Push Approach to 3D Orthogonal Drawing

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