Skip to main content
Springer Nature Link
Log in

Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract)

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1610))

Abstract

We consider the two-dimensional compaction problem for orthogonal grid drawings in which the task is to alter the coordinates of the vertices and edge segments while preserving the shape of the drawing so that the total edge length is minimized. The problem is closely related to two-dimensional compaction in Vlsi-design and has been shown to be NP-hard.

We characterize the set of feasible solutions for the two-dimensional compaction problem in terms of paths in the so-called constraint graphs in x- and y-direction. Similar graphs (known as layout graphs) have already been used for one-dimensional compaction in Vlsi-design, but this is the first time that a direct connection between these graphs is established. Given the pair of constraint graphs, the two-dimensional compaction task can be viewed as extending these graphs by new arcs so that certain conditions are satisfied and the total edge length is minimized. We can recognize those instances having only one such extension; for these cases we solve the compaction problem in polynomial time.

We transform the geometrical problem into a graph-theoretical one and formulate it as an integer linear program. Our computational experiments show that the new approach works well in practice.

This work is partially supported by the Bundesministerium für Bildung, Wissenschaft, Forschung und Technologie (No. 03-MU7MP1-4).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

  2. R. K. Ahuja, T. L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.

    Google Scholar 

  3. D. Alberts, C. Gutwenger, P. Mutzel, and S. Näher. AGD-Library: A library of algorithms for graph drawing. In G. Italiano and S. Orlando, editors, WAE’ 97 (Proc. on the Workshop on Algorithm Engineering), Venice, Italy, Sept. 11–13, 1997. http://www.dsi.unive.it/~wae97.

  4. G. D. Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. CGTA: Computational Geometry: Theory and Applications, 7:303–316, 1997.

    MATH  Google Scholar 

  5. S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings of orthogonal representations. Technical report, Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, 1999. To appear.

    Google Scholar 

  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 Lecture Notes in Computer Science, pages 254–266. Springer-Verlag, 1996.

    Chapter  Google Scholar 

  7. M. Jünger and S. Thienel. Introduction to ABACUS-A Branch-And-CUt System. Operations Research Letters, 22:83–95, March 1998.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. Kedem and H. Watanabe. Graph optimization techniques for IC-layout and compaction. IEEE Transact. Comp.-Aided Design of Integrated Circuits and Systems, CAD-3(1):12–20, 1984.

    Article  Google Scholar 

  9. 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, December 1998.

    Google Scholar 

  10. 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, May 1998.

    Google Scholar 

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

    MATH  Google Scholar 

  12. K. Mehlhorn, S. Näher, M. Seel, and C. Uhrig. LEDA Manual Version 3.7.1. Technical report, Max-Planck-Institut für Informatik, 1998. http://www.mpi-sb.mpg.de/LEDA.

  13. K. Mehlhorn and S. Näher. LEDA: A platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96–102, 1995.

    Article  Google Scholar 

  14. M. Patrignani. On the complexity of orthogonal compaction. Technical Report RT-DIA-39-99, Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, January 1999.

    Google Scholar 

  15. M. Schlag, Y.-Z. Liao, and C. K. Wong. An algorithm for optimal two-dimensional compaction of VLSI layouts. Integration, the VLSI Journal, 1:179–209, 1983.

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik Im Stadtwald, D-66123, Saarbrücken, Germany

    Gunnar W. Klau & Petra Mutzel

Authors
  1. Gunnar W. Klau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petra Mutzel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. GSIA, Carnegie Mellon University, Schenley Park, Pittsburgh, PA, 15213, USA

    Gérard Cornuéjols

  2. Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010, Graz, Austria

    Rainer E. Burkard  & Gerhard J. Woeginger  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klau, G.W., Mutzel, P. (1999). Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract). In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-48777-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66019-4

  • Online ISBN: 978-3-540-48777-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics