Title of article
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete Original Research Article
Author/Authors
Michael B. Dillencourt، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
11
From page
207
To page
217
Abstract
It is shown that it is an NP-complete problem to determine whether a Delaunay triangulation or an inscribable polyhedron has a Hamiltonian cycle. It is also shown that there exist nondegenerate Delaunay triangulations and simplicial, inscribable polyhedra without 2-factors.
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884322
Link To Document