Abstract
We consider the problem of automatically generating readable layouts for state diagrams. Such diagrams appear in the field of automation engineering in the design process of control systems. Our industrial partner, the Siemens AG, realised that due to the complex nature of these diagrams, automatic layout tools lead to a better design and documentation of control systems.
The layout problem turns out to be difficult, since not only a graph drawing problem has to be solved but also an additional labelling problem. In this article we study the combined graph layout and labelling problem and present new results for the two-dimensional compaction problem in graph drawing, the label number maximisation problem and the combined graph labelling problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD ′97), volume 1353 of LNCS, pages 391–402. Springer-Verlag, 1997.
S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings for orthogonal representations. Computational Geometry Theory and Applications (CGTA). To appear.
B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. Mathematical Programming, 85(2):277–311, 1999.
J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics, 14(3):203–232, 1995.
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, 1999.
G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, 7:303–316, 1997.
U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD ′95), volume 1027 of LNCS, pages 254–266. Springer-Verlag, 1996.
U. Fößmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD ′97), volume 1353 of LNCS, pages 134–145. Springer-Verlag, 1997.
ILOG. CPLEX 6.5 Reference Manual, 1999.
G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. Technical Report MPI-I-98-1-031, Max-Planck-Institut für Informatik, Saarbrücken, 1998.
G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-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. Kratochvíl, editor, Proc. 8th Internat. Symp. on Graph Drawing (GD ′99), volume 1731 of LNCS, pages 27–37, Štiřín Castle, Czech Republic, 1999. Springer-Verlag.
G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G._P. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization (IPCO ′99), volume 1610 of LNCS, pages 304–319, Graz, Austria, 1999. Springer-Verlag.
G. W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In Proc. 6th Annual International Computing and Combinatorics Conference (COCOON 2000), LNCS, Sydney, Australia, 2000. Springer-Verlag. To appear.
K. Mehlhorn and S. Näher. LEDA. A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
M. Patrignani. On the complexity of orthogonal compaction. In F. Dehne, A. Gupta, J.-R. Sack, and R. Tamassia, editors, Proc. 6th International Workshop on Algorithms and Data Structures (WADS ′99), volume 1663 of LNCS, pages 56–61. Springer-Verlag, 1999.
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.
R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61–79, 1988.
M. van Kreveld, T. Strijk, and A. Wolff. Point labeling with sliding labels. Computational Geometry: Theory and Applications, 13:21–47, 1999.
B. Verweij and K. Aardal. An optimisation algorithm for maximum independent set with applications in map labelling. In Proc. 7th Europ. Symp. on Algorithms (ESA ′99), volume 1643 of LNCS, pages 426–437, Prague, Czech Republic, 1999. Springer-Verlag.
A. Wolff and T. Strijk. The map labeling bibliography, http://www.math-inf.uni-greifswald.de.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mutzel, P., Klau, G.W. (2003). Automatic Layout and Labelling of State Diagrams. In: Jäger, W., Krebs, HJ. (eds) Mathematics — Key Technology for the Future. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55753-8_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-55753-8_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62914-3
Online ISBN: 978-3-642-55753-8
eBook Packages: Springer Book Archive