Time complexity of two disjoint simple paths

Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Je Erickson. This problem has various applications in computational geometry, e.g. robot motion planning, generating polygon, etc. We willm present a reduction from planar Hamiltonian path to this problem, and prove that it is NPcomplete. To the best of our knowledge, no study has considered its complexity up until now. We also present a reduction from planar Hamiltonian path problem to the problem of nding a path on given points in the presence of arbitrary obstacles" and prove that it is also NP-complete. Also, we present a heuristic algorithm with time complexity of O(n4) to solve this problem. The proposed algorithm rst calculates the convex hull for each of the entry points and then produces two simple paths on the two entry point sets.

[1]  Cheng-Kuan Lin,et al.  An efficient algorithm to construct disjoint path covers of DCell networks , 2016, Theor. Comput. Sci..

[2]  D. T. Lee,et al.  Minimal Link Visibility Paths Inside a Simple Polygon , 1993, Comput. Geom..

[3]  Hyeong-Seok Lim,et al.  Algorithms for finding disjoint path covers in unit interval graphs , 2016, Discret. Appl. Math..

[4]  E. Cheney.  Analysis for Applied Mathematics , 2001 .

[5]  Kurt Mehlhorn,et al.  On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm , 2005, Algorithmica.

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

[7]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

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

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

[10]  Marek Chrobak,et al.  Computing simple paths among obstacles , 2000, Comput. Geom..

[11]  Bo Jiang,et al.  Finding Simple Paths on Given Points in a Polygonal Region , 2014, FAW.

[12]  Steven M. LaValle,et al.  A Simple, but NP-Hard, Motion Planning Problem , 2013, AAAI.

[13]  Wei-Kuan Shih,et al.  A New Planarity Test , 1999, Theor. Comput. Sci..

[14]  David Coudert,et al.  Finding disjoint paths in networks with star shared risk link groups , 2015, Theor. Comput. Sci..

[15]  Marek Chrobak,et al.  A Linear-Time Algorithm for Drawing a Planar Graph on a Grid , 1995, Inf. Process. Lett..