Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon |
scientific article; zbMATH DE number 6194531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon |
scientific article; zbMATH DE number 6194531 |
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
0.8682569265365601
0 references
0.7610858082771301
0 references
0.7601954936981201
0 references
0.7516233325004578
0 references
0.7516233325004578
0 references
