Login / Signup

Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete.

Michael B. Dillencourt
Published in: Discret. Appl. Math. (1996)
Keyphrases
  • input image
  • np complete
  • randomly generated
  • np hard
  • computational complexity
  • polynomial time complexity
  • image sequences
  • delaunay triangulation
  • delaunay triangulations