Fast compaction for orthogonal drawings with vertices of prescribed size

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

Volumn 2265 LNCS, Issue , 2002, Pages 124-138

  Eiglsperger, Markus ^a   Kaufmann, Michael ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); ALGORITHMS;

COMPACTION ALGORITHMS; CRITICAL CONSTRAINTS; ORTHOGONAL DRAWINGS; RUNNING TIME;

COMPACTION;

EID: 84867455006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_11     Document Type: Conference Paper

References (15)

1. G. Di Battista, W. Didimo, Maurizo Patrignani, and Maurizio Pizzonia. Orthogonal and quasi-upward drawings with vertices of prescribed size. In J. Kratochvil, editor, Proceedings of the 7th International Symposium on Graph Drawing (GD'99), volume 1731 of LNCS, pages 297-310. Springer, 1999.
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
4. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algortihms. Comput. Geom. Theory Appl., 7:303-325, 1997.
5. M. Eiglsperger. Constraints im Kandinsky-Algorithmus. Master's thesis, Universität Tübingen, 1999.
6. U. Fößmeier. Orthogonale Visualisierungstechniken für Graphen. PhD thesis, Eberhard-Karls-Universität zu Tübingen, 1997.
7. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD'95), volume 1027 of LNCS, pages 254-266. Springer, 1996.
8. U. Fößmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Proceedings of the 5th International Symposium on Graph Drawing (GD'97), volume 1353 of LNCS, pages 134-145. Springer, 1997.
9. K. Klein G. W. Klau and P. Mutzel. An experimental comparison of orthogonal compaction algorithms. In Proceedings of the 8th International Symposium on Graph Drawing (GD'2000), number 1984 in LNCS, pages 37-51, 2001.
10. G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report 98-1-013, Max-Planck-Institut für Informatik, Saarbrücken, 1998.
11. G. W. Klau and P. Mutzel. Combining graph labeling and compaction. In J. Kratochvil, editor, Proceedings of the 7th International Symposium on Graph Drawing (GD'99), number 1731 in LNCS, pages 27-37. Springer, 1999.
12. G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In Integer Programming and Combinatorial Optimization (IPCO'99), number 1610 in LNCS, pages 304-319, 1999.
13. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Applicable Theoryin Computer Science. Wiley-Teubner, 1990.
14. M. Patrignani. On the complexity of orthogonal compaction. Computational Geometry: Theory and Applications, 19(1):47-67, 2001.
15. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421-444, 1987.