Download:
|
by Gunnar W. Klau, Petra Mutzel
Mathematics: Key Technology for the Future, Joint Projects Between Universities and Industry
http://www.apm.tuwien.ac.at/people/gunnar/pubs/KM00c.ps
Add To MetaCart
Abstract:
Abstract. We consider the problem of automatically generating readable layouts for state diagrams. Such diagrams appear in the eld 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 dicult, 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. 1
Citations
|
365
|
A heuristic for graph drawing
– Eades
- 1984
|
|
112
|
An empirical study of algorithms for point-feature label placement
– Christensen, Marks, et al.
- 1995
|
|
108
|
On Embedding a Graph in the Grid with the minimum Number of Bends
– Tamassia
- 1987
|
|
89
|
Automatic graph drawing and readability of diagrams
– Tamassia, Battista, et al.
- 1998
|
|
56
|
a platform for combinatorial and geometric computing
– LEDA
- 1999
|
|
41
|
An experimental comparison of four graph drawing algorithms
– Battista, Garg, et al.
- 1997
|
|
32
|
Negative-cycle detection algorithms
– Cherkassky, Goldberg
- 1996
|
|
31
|
Drawing high degree graphs with low bend numbers
– Fomeier, Kaufmann
- 1996
|
|
17
|
Quasi-orthogonal drawing of planar graphs
– KLAU, MUTZEL
- 1998
|
|
12
|
Turn-regularity and optimal area drawings of orthogonal representations
– Bridgeman, Battista, et al.
- 2000
|
|
10
|
Algorithms and area bounds for nonplanar orthogonal drawings
– Fomeier, Kaufmann
- 1997
|
|
10
|
Optimal compaction of orthogonal grid drawings
– Klau, Mutzel
- 1999
|
|
10
|
Optimal labelling of point features in the slider model
– Klau, Mutzel
- 2000
|
|
10
|
Point labeling with sliding labels. Computational Geometry: Theory and Applications
– Kreveld, Strijk, et al.
- 1999
|
|
10
|
An optimisation algorithm for maximum independent set with applications in map labelling
– Verweij, Aardal
- 1999
|
|
9
|
The Map-Labeling Bibliography. http://www.math-inf. uni-greifswald.de/map-labeling/bibliography
– Wol, Strijk
- 1996
|
|
8
|
Combining graph labeling and compaction
– Klau, Mutzel
- 1999
|
|
8
|
On the complexity of orthogonal compaction
– Patrignani
- 1999
|
|
6
|
The three-phase method: A uni approach to orthogonal graph drawing
– Biedl, Madden, et al.
- 1997
|
