Article

An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)

Authors:

Gunnar W. Klau,

Petra MutzelAuthors Info & Claims

GD '00: Proceedings of the 8th International Symposium on Graph Drawing

Pages 37 - 51

Published: 20 September 2000 Publication History

Abstract

We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turn-regularity, also in combination with two improvement heuristics based on longest paths and network flows, and an exact method which is able to compute provable optimal drawings of minimum total edge length.

We provide a performance evaluation in terms of quality and running time. The test data consists of two test-suites already used in previous experimental research. In order to get hard instances, we randomly generated an additional set of planar graphs.

References

[1]

C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Soft. Eng., SE-12(4):538-546, 1986.

[2]

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.

[3]

M. Jünger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, Special Issue on Graph Drawing, 16(1):33-59, 1996.

[4]

P. Mutzel and R. Weiskircher. Optimizing over all combinatorial embeddings of a planar graph. 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 361-376. Springer-Verlag, 1999.

[5]

C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. Technical report, Technische Universität Wien, 2000. Submitted for publication.

[6]

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.

[7]

P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In Proc. 5th Workshop Algorithms Data Struct. (WADS '97), volume 1272 of LNCS, pages 331-344, 1997.

[8]

M. Eiglsperger, U. Fößmeier, and M. Kaufmann. Orthogonal graph drawing with constraints. In Proc. 11th Symposium on Discrete Algorithms (SODA '00). ACM-SIAM, 2000.

[9]

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.

[10]

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.

[11]

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. Springer-Verlag, 1999.

[12]

C. Gutwenger, M. Jünger, G. W. Klau, and P. Mutzel. Graph drawing algorithm engineering with AGD. Technical report, Technische Universität Wien, 2000.

[13]

AGD. AGD User Manual. Max-Planck-Institut Saarbrücken, Universität Halle, Universität Köln, 1999. http://www.mpi-sb.mpg.de/AGD.

[14]

Graph drawing toolkit: An object-oriented library for handling and drawing graphs. http://www.dia.uniroma3.it/~gdt.

[15]

N. Gelfand and R. Tamassia. Algorithmic patterns for orthogonal graph drawing. In S. Whitesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes in Computer Science, pages 138-152. Springer-Verlag, 1998.

[16]

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.

[17]

G. Di Battista, A. Garg, and G. Liotta. An experimental comparison of three graph drawing algorithms. In Proceedings of the 11th Annual Symposium on Computational Geometry (SoCG'95), pages 306-315, 1995.

[18]

M. Jünger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In F. J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD'95), volume 1027 of LNCS, pages 337-348. Springer-Verlag, 1995.

[19]

F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F. J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD '95), volume 1027 of LNCS, pages 76-87. Springer-Verlag, 1996.

[20]

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.

[21]

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.

[22]

T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.

[23]

G. W. Klau, K. Klein, and P. Mutzel. An experimental comparison of orthogonal compaction algorithms. Technical Report TR-186-1-00-03, Technische Universität Wien, 2000. Online version at http://www.ads.tuwien.ac.at/publications/TR/TR-186-1-00-03.

Cited By

Chimani MGutwenger CMutzel PSpönemann MWong H(2010)Crossing minimization and layouts of directed hypergraphs with port constraintsProceedings of the 18th international conference on Graph drawing10.5555/1964371.1964385(141-152)Online publication date: 21-Sep-2010
https://dl.acm.org/doi/10.5555/1964371.1964385
Eades PGutwenger CHong SMutzel P(2010)Graph drawing algorithmsAlgorithms and theory of computation handbook10.5555/1882723.1882729(6-6)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1882723.1882729
Binucci CDidimo WLiotta GNonato M(2005)Orthogonal drawings of graphs with vertex and edge labelsComputational Geometry: Theory and Applications10.1016/j.comgeo.2005.02.00132:2(71-114)Online publication date: 1-Oct-2005
https://dl.acm.org/doi/10.1016/j.comgeo.2005.02.001
Show More Cited By

Index Terms

An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)
1. Mathematics of computing
  1. Discrete mathematics

Index terms have been assigned to the content through auto-classification.

Recommendations

No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)
Computing and Combinatorics
Abstract
A plane graph is a planar graph with a fixed planar embedding in the plane. In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point ...
Restrained domination and its variants in extended supergrid graphs
Abstract
Domination problem is a well-known NP-complete problem for general graphs. In this paper, we will study its three variants, including restrained, independent restrained, and restrained-step dominations. A restrained dominating set of a ...
Highlights
- Extended supergrid graphs can be applied to computerized sewing machine, 3D printers, and so on.
Greeding matching algorithms, an experimental study

We conduct an experimental study of several greedy algorithms for finding large matchings in graphs. Further we propose a new graph reduction, called <i>k</i>-Block Reduction, and present two novel algorithms using extra heuristics in the matching step ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

GD '00: Proceedings of the 8th International Symposium on Graph Drawing

September 2000

417 pages

ISBN:3540415548

Editor:
Joe Marks

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 September 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chimani MGutwenger CMutzel PSpönemann MWong H(2010)Crossing minimization and layouts of directed hypergraphs with port constraintsProceedings of the 18th international conference on Graph drawing10.5555/1964371.1964385(141-152)Online publication date: 21-Sep-2010
https://dl.acm.org/doi/10.5555/1964371.1964385
Eades PGutwenger CHong SMutzel P(2010)Graph drawing algorithmsAlgorithms and theory of computation handbook10.5555/1882723.1882729(6-6)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1882723.1882729
Binucci CDidimo WLiotta GNonato M(2005)Orthogonal drawings of graphs with vertex and edge labelsComputational Geometry: Theory and Applications10.1016/j.comgeo.2005.02.00132:2(71-114)Online publication date: 1-Oct-2005
https://dl.acm.org/doi/10.1016/j.comgeo.2005.02.001
Eiglsperger MGutwenger CKaufmann MKupke JJünger MLeipert SKlein KMutzel PSiebenhaller M(2004)Automatic layout of UML class diagrams in orthogonal styleInformation Visualization10.1057/palgrave.ivs.95000783:3(189-208)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1057/palgrave.ivs.9500078
Eiglsperger MKaufmann MSiebenhaller MDiehl SStasko J(2003)A topology-shape-metrics approach for the automatic layout of UML class diagramsProceedings of the 2003 ACM symposium on Software visualization10.1145/774833.774860(189-ff)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/774833.774860
Gutwenger CJünger MKlein KKupke JLeipert SMutzel PDiehl SStasko J(2003)A new approach for visualizing UML class diagramsProceedings of the 2003 ACM symposium on Software visualization10.1145/774833.774859(179-188)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/774833.774859

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents