On the Complexity of Orthogonal Compaction
We consider three closely related optimization problems, arising from the graph drawing and the VLSI research areas, and conjectured to be NP-hard, and we prove that, in fact, they are NP-complete. Starting from an orthogonal representation of a graph, i.e., a description of the shape of the edges that does not specify segment lengths or vertex positions, the three problems consist of providing an orthogonal grid drawing of it, while minimizing the area, the total edge length, or the maximum edge length, respectively.
KeywordsEdge Length Conjunctive Normal Form Truth Assignment Graph Drawing Orthogonal Representation
Unable to display preview. Download preview PDF.
- 1.P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In F. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia, editors, Proc. 5th Workshop Algorithms Data Struct., volume 1272 of LNCS, pages 331–344. Springer-Verlag, 1997.Google Scholar
- 2.S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Optimal compaction of orthogonal representations. In CGC Workshop on Geometric Computing, 1998.Google Scholar
- 4.D. Dolev and H. Trickey. On linear area embedding of planar graphs. Report cs-81-876, Stanford Univ., 1981.Google Scholar
- 7.F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.Google Scholar
- 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, Germany, 1998.Google Scholar
- 10.G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. Cornuejols, R. E. Burkard, and G. J. Woeginger, editors, Integer Progr. Comb. Opt. (Proc. IPCO’ 99), volume 1610 of LNCS, Springer-Verlag, to appear.Google Scholar
- 11.T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner, 1990.Google Scholar
- 13.M. Patrignani. On the complexity of orthogonal compaction. Technical Report RT-DIA-39-99, Dipartimento di Informatica e Automazione, Universit.a di Roma Tre, Rome, Italy, Jan. 1999.Google Scholar