A Combinatorial Approach to Orthogonal Placement Problems

This article presents the main results of a PhD thesis that deals with two families of NP-hard orthogonal placement problems. We develop a common combinatorial framework for compaction problems in graph drawing and for labeling problems in computational cartography. Compaction problems are concerned with performing the conversion from a dimensionless description of the orthogonal shape of a graph to an area-efficient drawing in the grid. Map labeling is the task of attaching labels to point-features so that the resulting placement is legible. On the basis of new combinatorial formulations for these problems we develop exact algorithms. Extensive computational studies on real-world benchmarks show that our linear programming-based algorithms solve large instances of the placement problems to provable optimality within short computation time. Often, our algorithms are the first exact algorithms for the respective problem variant.

[1]  Maurizio Patrignani.  On the complexity of orthogonal compaction , 2001, Comput. Geom..

[2]  F. Miller Maley.  An Observation Concerning Constraint-Based Compaction , 1987, Inf. Process. Lett..

[3]  Michael Jünger,et al.  Practical problem solving with cutting plane algorithms in combinatorialoptimization , 1993, Combinatorial Optimization.

[4]  Walter Didimo,et al.  Turn-regularity and optimal area drawings of orthogonal representations , 2000, Comput. Geom..

[5]  Joe Marks,et al.  The Computational Complexity of Cartographic Label Placement , 1991 .

[6]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[8]  Ioannis G. Tollis,et al.  On the Edge Label Placement Problem , 1996, GD.

[9]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[10]  Richard M. Karp,et al.  On Linear Characterizations of Combinatorial Optimization Problems , 1982, SIAM J. Comput..

[11]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[12]  Michael Kaufmann,et al.  Orthogonal graph drawing with constraints , 2000, SODA '00.

[13]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

[14]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[15]  Madhav V. Marathe,et al.  Map labeling and its generalizations , 1997, SODA '97.

[16]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[17]  M. Y. Hsueh,et al.  Symbolic layout and compaction of integrated circuits , 1980 .

[18]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[19]  D. Dolev,et al.  On linear area embedding of planar graphs , 1981 .

[20]  Frank Hoffmann,et al.  Embedding rectilinear graphs in linear time , 1988 .

[21]  Sheldon B. Akers,et al.  IC mask layout with a single conductor layer , 1970, DAC '70.

[22]  Alexander Wolff,et al.  Point labeling with sliding labels , 1999, Comput. Geom..

[23]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

[24]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[25]  Joe Marks,et al.  An empirical study of algorithms for point-feature label placement , 1995, TOGS.

[26]  Roberto Tamassia,et al.  On the Compuational Complexity of Upward and Rectilinear Planarity Testing , 1994, Graph Drawing.

[27]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[28]  Alfred E. Dunlop.  SLIP: symbolic layout of integrated circuits with compaction , 1978 .

[29]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[30]  Giuseppe Liotta,et al.  An Experimental Comparison of Four Graph Drawing Algorithms , 1997, Comput. Geom..

[31]  Petra Mutzel,et al.  Inserting an Edge into a Planar Graph , 2001, SODA '01.

[32]  Fabrizio Luccio,et al.  A Visibility Problem in VLSI Layout Compaction , 1984 .

[33]  Frank Wagner,et al.  A packing problem with applications to lettering of maps , 1991, SCG '91.

[34]  Hiroyuki Watanabe,et al.  Graph-Optimization Techniques for IC Layout and Compaction , 1983, 20th Design Automation Conference Proceedings.

[35]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[36]  Anna Lubiw,et al.  Elastic Labels: the Two-Axis Case , 1997, Graph Drawing.

[37]  Ioannis G. Tollis,et al.  Techniques for the Refinement of Orthogonal Graph Drawings , 2000, J. Graph Algorithms Appl..

[38]  Avi Wigderson,et al.  Rectilinear Graphs and their Embeddings , 1985, SIAM J. Comput..

[39]  David S. Johnson,et al.  Stockmeyer: some simplified np-complete graph problems , 1976 .

[40]  Petra Mutzel,et al.  Quasi-orthogonal drawing of planar graphs , 1998 .

[41]  Michael Kaufmann,et al.  Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.

[42]  Michael Kaufmann,et al.  Algorithms and Area Bounds for Nonplanar Orthogonal Drawings , 1997, GD.

[43]  Karen Aardal,et al.  An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling , 1999, ESA.

[44]  Chak-Kuen Wong,et al.  An algorithm for optimal two-dimensional compaction of VLSI layouts , 1983, Integr..

[45]  Michael Jünger,et al.  Graph Drawing Algorithm Engineering with AGD , 2001, Software Visualization.

[46]  Thomas Ziegler,et al.  Crossing minimization in automatic graph drawing , 2000 .

[47]  Walter Didimo,et al.  Computing Orthogonal Drawings with the Minimum Number of Bends , 1997, IEEE Trans. Computers.

[48]  Michael Kaufmann,et al.  On Improving Orthogonal Drawings: The 4M-Algorithm , 1998, GD.

[49]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[50]  D. Dolev,et al.  Planar Embedding of Planar Graphs , 1983 .

[51]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[52]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[53]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[54]  Pinhas Yoeli,et al.  The Logic of Automated Map Lettering , 1972 .

[55]  Ioannis G. Tollis,et al.  An Algorithm for Labeling Edges of Hierarchical Drawings , 1997, GD.

[56]  Michael Jünger,et al.  The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization , 2000, Softw. Pract. Exp..

[57]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[58]  Angelo Gregori,et al.  Unit-Length Embedding of Binary Trees on a Square Grid , 1989, Inf. Process. Lett..

[59]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[60]  Andrew V. Goldberg,et al.  Negative-cycle detection algorithms , 1996, Math. Program..

[61]  Marc J. van Kreveld,et al.  Practical extensions of point labeling in the slider model , 1999, GIS '99.

[62]  Thomas Lengauer,et al.  Algorithmic Aspects of One-Dimensional Layout Compaction , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[63]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[64]  Stephen A. Hirsch,et al.  An Algorithm for Automatic Name Placement Around Point Data , 1982 .

[65]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[66]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[67]  James A. Storer,et al.  On minimal-node-cost planar embeddings , 1984, Networks.

[68]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[69]  TamassiaRoberto,et al.  Algorithms for drawing graphs , 1994 .

[70]  Petra Mutzel,et al.  AGD-Library: A Library of Algorithms for Graph Drawing , 1997 .

[71]  Steven Zoraster,et al.  The Solution of Large 0-1 Integer Programming Problems Encountered in Automated Cartography , 1990, Oper. Res..