Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete

Michael B. Dillencourt. Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. Discrete Applied Mathematics, 64(3):207-217, 1996. [doi]

Abstract

Abstract is missing.