# Hamiltonian non intersecting path in plane

$$N$$ points are located in 2D plane. Some of the pair of the points are connected by line segments. What is the complexity of the problem of existence of Hamiltonian non intersecting path? What if we consider it in special cases of graphs.

• Does, e.g., this answer your question? – dkaeae Aug 6 at 15:29
• Thanks for your comment. Yes it shows finding Hamiltonian path in planar graph is NP-Complete. Next question would be what if the points are inside a polygon, two points are connected to each other which the connecting line between them is completely inside the polygon? – inaderi Aug 7 at 6:05