THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING

DOI10.1142/S0218195900000310zbMath0970.68186OpenAlexW2144946213MaRDI QIDQ2708038

Brendan P. Madden, Therese C. Biedl, Ioannis. G. Tollis

Publication date: 17 April 2001

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195900000310

zbMATH Keywords

orthogonal graph drawings

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

Layered drawing of undirected graphs with generalized port constraints ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Overloaded Orthogonal Drawings ⋮ Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings ⋮ The DFS-heuristic for orthogonal graph drawing ⋮ Balanced vertex-orderings of graphs ⋮ Layered Drawing of Undirected Graphs with Generalized Port Constraints ⋮ The Turing Test for Graph Drawing Algorithms

Cites Work

• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for area-efficient orthogonal drawing
• A better heuristic for orthogonal graph drawings
• Drawing planar graphs using the canonical ordering
• Efficient orthogonal drawings of high degree graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• P-Complete Approximation Problems

This page was built for publication: THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING