Computing Labeled Orthogonal Drawings

Binucci, Carla and Didimo, Walter and Liotta, Giuseppe and Nonato, Maddalena (2002) Computing Labeled Orthogonal Drawings. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 66-73 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_7).

Full text not available from this repository.

Abstract

This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as a rectangle of prescribed size and it can be associated with either a vertex or an edge. Several optimization goals are taken into account. Namely, the labeled drawing can be required to have minimum total edge length, minimum width, minimum height, or minimum area. We present ILP models to compute optimal drawings with respect to the first three objectives and an algorithm exploiting these models which computes a drawing of minimum area (the compaction problem is known to be NP-complete in general).

Item Type:Conference Paper
Additional Information:10.1007/3-540-36151-0_7
Classifications:G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.630 Labeling
P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:270

Repository Staff Only: item control page

References

C. Binucci, W. Didimo, G. Liotta, and M. Nonato. Computing labeled orthogonal drawings, manuscript: http://www.diei.unipg.it/PAG_PERS/binucci/binucci.htm.

C. Binucci, W. Didimo, G. Liotta, and M. Nonato. Labeling heuristics for orthogonal drawings. In Symposium on Graph Drawing (GD '01), volume 2265 of LNCS, pages 139-153, 2002.

S. Bridgeman, G.D. Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry: Theory and Applications, 16:53-93, 2000.

R. Castello, R. Milli, and I. Tollis. An algorithmic framework for visualizing statecharts. In Symposium on Graph Drawing (GD '00), volume 1984 of LNCS, pages 139-149, 2001.

G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.

F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.

K.G. Kakoulis and I.G. Tollis. An algorithm for labeling edges of hierarchical drawings. In Symposium on Graph Drawing (GD '97), volume 1353 of LNCS, pages 169-180, 1998.

K.G. Kakoulis and I.G. Tollis. On the complexity of the edge label placement problem. Computational Geometry: Theory and Applications, 18:1-17, 2001.

M. Kaufmann and D. Wagner. Drawing Graphs. Springer Verlag, 2001.

G. Klau and P. Mutzel. Optimal labeling of point features in rectangular labeling models. Mathematical Programming, Series B, To appear.

G. Klau and P. Mutzel. Combining graph labeling and compaction. In Symposium on Graph Drawing (GD '99), LNCS, pages 27-37, 1999.

G. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In Integer Programming and Combinatorial Optimization (IPCO '99), volume 1610 of LNCS, pages 304-319, 1999.

G. Klau and P. Mutzel. Optimal labelling of point features in the sliding model. In Proc. COCOON '00, volume 1858 of LNCS, pages 340-350, 2001.

S. Nakano, T. Nishizeki, T. Tokuyama, and S. Watanabe. Labelling points with rectangles of various shape. In Symposium on Graph Drawing (GD '00), volume 1984 of LNCS, pages 91-102, 2001.

T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, volume 32 of Annals of Discrete Mathematics. North-Holland, 1988.

M. Patrignani. On the complexity of orthogonal compaction. Computational Geometry: Theory and Applications, 19:47-67, 2001.

T. Strijk and A. Wolff. The map labeling bibliography. on-line: http://www.math-inf.uni-greifswald.de/map-labeling/bibligraphy/.