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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1353, Issue , 1997, Pages 391-402

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

^a MCGILL UNIVERSITY   (Canada)

^b Tom Sawyer Software   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INPUT GRAPHS; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; ORTHOGONAL GRAPHS; THREE PHASE; UNIFIED APPROACH;

DRAWING (GRAPHICS);

EID: 84905858462     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_84     Document Type: Conference Paper

References (21)

1. T. Biedl. Orthogonal Graph Visualization: The Three-Phase Method With Applications. PhD thesis, RUTCOR, Rutgers University, May 1997.
2. T. Biedl and G. Kant. A better heuristic for orthogoal graph drawings. In 2nd European Symposium on Algorithms, volume 855 of Lecture Notes in Computer Science, pages 124-135. Springer Verlag, 1994.
3. T. Biedl and M. Kaufmaan. Static and incremental high-degree orthogonal drawings. In 5th European Symposium on Algorithms, Lecture Notes in Computer Science. Springer Verlag, 1997. To appear.
4. F. Brandenburg, editor. Symposium on Graph Drawing 95, volume 1027 of Lecture Notes in Computer Science. Springer Verlag, 1996.
5. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comp. Geometry: Theory and Applications, 4(5):235-282, 1994.
6. U. Fößmeier, G. Kant, and M. Kaufmann. 2-visibility drawings of planar graphs. In North [12], pages 155-168.
7. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In Brandenburg [4], pages 254-266.
8. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996.
9. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubnet/ Wiley & Sons, Stuttgart/Chicester, 1990.
10. K. Miriyala, S. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In 6th Intl. IEEE Workshop Computer-Aided Software Eng. 1993.
11. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. Y. Visual Languages and Computing, pages 183-210, June 1995.
12. S. North, editor. Symposium on Graph Drawing g6, volume 1190 of Lecture Notes in Computer Science. Springer Verlag, 1997.
13. A. Papakostas, J. M. Six, and I. Tollis. Experimental and theoretical results in interactive orthogonal graph drawing. In North [12], pages 371-386.
14. A. Papakostas and I. Toliis. Issues in interactive orthogonal graph drawing. In Brandenburg [4], pages 419-430.
15. A. Papakostas and I. ToUis. High-degree orthogonal drawings with small grid-size and few bends. In 5th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science. Springer Veriag, 1997. To appear.
16. A. Papakostas and I. Tollis. A pairing technique for area-efficient orthogonal drawings. In North [12], pages 355-370.
17. P. Rosenstiehi and R. E. Tarjan. Rectilinear planar layouts and bipolar orientation of planar graphs. Discrete Computational Geometry, 1:343-353, 1986.
18. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal of Computing, 16(3):421-444, 1987.
19. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Systems, Man and Cybernetics, 18(1), 1988.
20. R. Tamassia and I. ToUis. A unified approach to visibility representations of planar graphs. Discrete Computational Geometry, 1:321-341, 1986.
21. R Tamassia and I. Tollis, editors. DIMA CS International Workshop, Graph Drawing 95, volume 894 of Lecture Notes in Computer Science. Springer Verlag, 1995.