The point-set embeddability problem for plane graphs

In this paper, we study the point-set-embeddability-problem, i.e., given a planar graph and a set of points, is there a mapping of the vertices to the points such that the resulting straight-line drawing is planar? It was known that this problem is NP-hard if the embedding can be chosen, but becomes polynomial for triangulated graphs of treewidth 3. We show here that in fact it can be answered for all planar graphs with a fixed combinatorial embedding that have constant treewidth and constant face-degree. We also prove that as soon as one of the conditions is dropped (i.e., either the treewidth is unbounded or some faces have large degrees), point-set-embeddability with a fixed embedding becomes NP-hard. The NP-hardness holds even for a 3-connected planar graph with constant treewidth, triangulated planar graphs, or 2-connected outer-planar graphs.

[1]  In-kyeong Choi.  On straight line representations of random planar graphs , 1992 .

[2]  Mohammad Sohel Rahman,et al.  Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees , 2011, COCOON.

[3]  Ton Kloks,et al.  Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[4]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[5]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[6]  Dimitrios M. Thilikos,et al.  Square Roots of Minor Closed Graph Classes , 2011, Electron. Notes Discret. Math..

[7]  Emilio Di Giacomo,et al.  Upward straight-line embeddings of directed graphs into point sets , 2010, Comput. Geom..

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

[9]  Emilio Di Giacomo,et al.  Constrained Point-Set Embeddability of Planar Graphs , 2008, Graph Drawing.

[10]  R. Pollack,et al.  Embedding a planar triangulation with vertices at specified points , 1991 .

[11]  Neil Robertson,et al.  Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering , 2003, J. Comb. Theory, Ser. B.

[12]  Stephane Durocher,et al.  On the Hardness of Point-Set Embeddability - (Extended Abstract) , 2012, WALCOM.

[13]  Maria J. Serna,et al.  Cutwidth II: Algorithms for partial w-trees of bounded degree , 2005, J. Algorithms.

[14]  Emilio Di Giacomo,et al.  The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing , 2010, WALCOM.

[15]  K. Wagner.  Bemerkungen zum Vierfarbenproblem. , 1936 .

[16]  Prosenjit Bose,et al.  On Embedding an Outer-Planar Graph in a Point Set , 1997, GD.

[17]  Emilio Di Giacomo,et al.  k-colored Point-set Embeddability of Outerplanar Graphs , 2008, J. Graph Algorithms Appl..

[18]  Micha Sharir,et al.  On the number of crossing-free matchings, (cycles, and partitions) , 2006, SODA '06.

[19]  Michael Kaufmann,et al.  Upward Geometric Graph Embeddings into Point Sets , 2010, Graph Drawing.

[20]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[21]  B. Mohar,et al.  Graph Minors , 2009 .

[22]  Dorothea Wagner,et al.  Minimizing the Area for Planar Straight-Line Grid Drawings , 2007, Graph Drawing.

[23]  Debajyoti Mondal,et al.  Point-set embeddings of plane 3-trees , 2012, Comput. Geom..

[24]  Emilio Di Giacomo,et al.  Point-set embeddings of trees with given partial drawings , 2009, Comput. Geom..

[25]  Michael Kaufmann,et al.  Upward Point-Set Embeddability , 2011, SOFSEM.

[26]  Maria J. Serna,et al.  Cutwidth I: A linear time fixed parameter algorithm , 2005, J. Algorithms.

[27]  Alexander Wolff,et al.  Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles , 2012, WALCOM.

[28]  Emilio Di Giacomo,et al.  Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge , 2007, Algorithmica.

[29]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[30]  Ioan Todinca,et al.  Chordal embeddings of planar graphs , 2003, Discret. Math..

[31]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[32]  Robin Thomas,et al.  Call routing and the ratcatcher , 1994, Comb..

[33]  Sergio Cabello.  Planar embeddability of the vertices of a graph using a fixed point set is NP-hard , 2006, J. Graph Algorithms Appl..

[34]  David Eppstein,et al.  Finding minimum areak-gons , 1992, Discret. Comput. Geom..

[35]  H. L. Bodlaender,et al.  Treewidth: Algorithmic results and techniques , 1997 .

[36]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[37]  Jorge Urrutia,et al.  Straight Line Embeddings of Planar Graphs on Point Sets , 1996, Canadian Conference on Computational Geometry.

[38]  Michael Kaufmann,et al.  Journal of Graph Algorithms and Applications Embedding Vertices at Points: Few Bends Suffice for Planar Graphs , 2022 .

[39]  Emilio Di Giacomo,et al.  Drawing colored graphs on colored points , 2007, Theor. Comput. Sci..

[40]  Giuseppe Liotta,et al.  Point-Set Embeddability of 2-Colored Trees , 2012, Graph Drawing.