论文信息 - Planar straight-line point-set embedding of trees with partial embeddings

Planar straight-line point-set embedding of trees with partial embeddings

Given a set P of n points in the plane, an n-node tree T, and a partial embedding E of T on P (i.e. a planar straight-line point-set embedding of some sub-trees of T on a sub-set of P), we show that the problem of deciding whether there is a planar straight-line point-set embedding of T on P that includes E is NP-complete. This problem was posed as an open problem in E. Di Giacomo et al. (2009) [8].

Alireza Bagheri | Mohammadreza Razzazi | A. Bagheri | M. Razzazi

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

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

[3] Marc Noy,et al. Bipartite Embeddings of Trees in the Plane , 1999, Discret. Appl. Math..

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

[5] János Pach,et al. Layout of Rooted Trees , 1991, Planar Graphs.

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

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

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

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

[10] Micha A. Perles,et al. The rooted tree embedding problem into points in the plane , 1994, Discret. Comput. Geom..

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

[12] János Pach,et al. Embedding Planar Graphs at Fixed Vertex Locations , 1998, GD.

[13] Maurizio Patrignani. On Extending a Partial Straight-line Drawing , 2006, Int. J. Found. Comput. Sci..