Fast computation of shortest watchman routes in simple polygons (Q1607078)
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: Fast computation of shortest watchman routes in simple polygons |
scientific article; zbMATH DE number 1771784
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of shortest watchman routes in simple polygons |
scientific article; zbMATH DE number 1771784 |
Statements
Fast computation of shortest watchman routes in simple polygons (English)
0 references
25 July 2002
0 references
watchman route problem
0 references
0.96047044
0 references
0.9503542
0 references
0.9488555
0 references
0.92460006
0 references
0.90878093
0 references
0.9054943
0 references
0.9053186
0 references
0.89312243
0 references
0.89200085
0 references
0.89091665
0 references
