In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss different models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal drawings. This approach simplifies the description and implementation of orthogonal graph drawing, and can be applied to global as well as interactive and incremental settings.
CITATION STYLE
Biedl, T. C., Madden, B. P., & Tollis, I. G. (1997). The three-phase method: A unified approach to orthogonal graph drawing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 391–402). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_84
Mendeley helps you to discover research relevant for your work.