Finding a shortest Hamiltonian path inside a simple polygon (Q671605)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 983398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a shortest Hamiltonian path inside a simple polygon |
scientific article; zbMATH DE number 983398 |
Statements
Finding a shortest Hamiltonian path inside a simple polygon (English)
0 references
27 February 1997
0 references
computational geometry
0 references
simple polygon
0 references
Hamiltonian path
0 references
watchman route
0 references
0.9453063
0 references
0.8907567
0 references
0.8879465
0 references
0.8860791
0 references
0.8820908
0 references
0.8820908
0 references
0.8807323
0 references
0.87481415
0 references
0.8737548
0 references
