Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Hamiltonian cycles in Delaunay triangulations is NP-complete |
scientific article |
Statements
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (English)
0 references
4 August 1996
0 references
It is shown that it is an NP-complete problem to determine whether a nondegenerate Delaunay triangulation or an inscribable polyhedron has a Hamiltonian cycle. There are also constructed a nondegenerate Delaunay triangulation and a simplicial, inscribable polyhedron, without 2-factors.
0 references
NP-complete problem
0 references
Delaunay triangulation
0 references
inscribable polyhedron
0 references
Hamiltonian cycle
0 references
2-factors
0 references
0 references
