Abstract
In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for manypractical applications like UML. The algorithm provides a drastic improvement on previous approaches. It has linear worst case running time and experiments show that it performs veryw ell in practice.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
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.
M. Eiglsperger. Constraints im Kandinsky-Algorithmus. Master’s thesis, Universit ät Tübingen, 1999.
U. Fößmeier. Orthogonale Visualisierungstechniken für Graphen. PhD thesis, Eberhard-Karls-Universität zu Tübingen, 1997.
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.
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.
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.
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.
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.
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.
T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Applicable Theoryin Computer Science. Wiley-Teubner, 1990.
M. Patrignani. On the complexityof orthogonal compaction. Computational Geometry: Theory and Applications, 19(1):47–67, 2001.
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421–444, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiglsperger, M., Kaufmann, M. (2002). Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive