Watchman routes in the presence of a pair of convex polygons (Q1291565)
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: Watchman routes in the presence of a pair of convex polygons |
scientific article; zbMATH DE number 1299797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Watchman routes in the presence of a pair of convex polygons |
scientific article; zbMATH DE number 1299797 |
Statements
Watchman routes in the presence of a pair of convex polygons (English)
0 references
10 June 1999
0 references
shortest watchman route problem
0 references
0.9144981
0 references
0.90328795
0 references
0.8981513
0 references
0.89091665
0 references
0.88123846
0 references
0.8742789
0 references
0 references
