The three-phase method: A unified approach to orthogonal graph drawing

International Journal of Computational Geometry and Applications

Volumn 10, Issue 6, 2000, Pages 553-580

  Biedl, Therese C ^a   Madden, Brendan P ^b   Tollis, Ioannis G ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Tom Sawyer Software   (United States)

^c The University of Texas at Dallas   (United States)

Author keywords

Graph visualization; High degree graphs; Interactive drawing; Orthogonal graph drawing; Three phase method

Indexed keywords

EID: 0034553218     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000310     Document Type: Article

References (30)

1. S. N. Bhatt and C. E. Leiserson. How to assemble tree machines. In Franco P. Preparata, editor, Advances in Computing Research, volume 2: VLSI Theory, pages 95-114. JAI Press, Reading, MA, 1984.
2. T. Biedl. Orthogonal Graph Visualization: The Three-Phase Method With Applications. PhD thesis, RUTCOR, Rutgers University, May 1997.
3. T. Biedl. The DFS-heuristic for orthogonal graph drawing. Technical Report RRR 28-98, RUTCOR, Rutgers University, July 1998. To appear in Computational Geometry: Theory and Application.
4. T. Biedl. Three approaches to 3D-orthogonal box-drawings. In Graph Drawing '98, volume 1547 of Lecture Notes in Computer Science, pages 30-43. Springer-Verlag, 1998.
5. T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications, 9:159-180, 1998.
6. T. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In 5th European Symposium on Algorithms, volume 1284 of Lecture Notes in Computer Science, pages 37-52. Springer-Verlag, 1997.
7. 17, pages 25-44.
8. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for Geometric Representations of Graphs. Prentice-Hall, 1998.
9. 17, pages 155-168.
10. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. Brandenburg, editor, Symposium on Graph Drawing 95, volume 1027 of Lecture Notes in Computer Science, pages 254-266. Springer-Verlag, 1996.
11. U. Fößmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Symposium on Graph Drawing 97, volume 1353 of Lecture Notes in Computer Science, pages 134-145. Springer-Verlag, 1998.
12. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996.
13. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner/Wiley & Sons, Stuttgart/Chicester, 1990.
14. K. Miriyala, S.W. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In 6th International IEEE Workshop on Computer-Aided Software Engineering. IEEE Computer Society Press, 1993.
15. K. Misue, P. Eades, Wei Lai, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages and Computing, pages 183-210, June 1995.
16. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. ISBN 0-521-47465-5.
17. S. North, editor. Symposium on Graph Drawing 96, volume 1190 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
18. 17, pages 371-386.
19. A. Papakostas and I. Tollis. High-degree orthogonal drawings with small grid-size and few bends. In 5th Workshop on Algorithms and Data Structures, volume 1272 of Lecture Notes in Computer Science, pages 354-367. Springer-Verlag, 1997.
20. A. Papakostas and I. Tollis. Efficient orthogonal drawings of high degree graphs. Algorithmica 26(1): 100-125, 2000.
21. A. Papakostas and I. Tollis. Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications, 9:83-110, 1998.
22. A. Papakostas and I. Tollis. Interactive orthogonal graph drawing. IEEE Trans. Comput., 47(11):1297-1309, 1998.
23. P. M. Pardalos, F. Rendl, and H. Wolkowicz. The quadratic assignment problem: a survey and recent developments. In Quadratic assignment and related problems, volume 16 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 1-42. Amer. Math. Soc., Providence, RI, 1994.
24. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Computational Geometry, 1:343-353, 1986.
25. S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the Association of Computing Machinery, 23:555-565, 1976.
26. A. Schrijver. Theory of Linear and Integer Programming. Wiley - Interscience Series in Discrete Mathematics and Optimization, Chicester, 1986.
27. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421-444, 1987.
28. R. Tamassia, G. Di Battista, and Carlo Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, 18(1), January/ February 1988.
29. R. Tamassia and I. Tollis. A unified approach to visibility representations of planar graphs. Discrete Computational Geometry, 1:321-341, 1986.
30. R. Tamassia and I. Tollis. Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems, 36(9):1230-1234, 1989.