Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon |
scientific article |
Statements
Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (English)
0 references
5 August 2013
0 references
Monge array
0 references
Hamiltonian path
0 references
simple polygon
0 references
dynamic programming
0 references
computational complexity
0 references
computational geometry
0 references
0 references
0 references
0 references
