Finding the shortest watchman route in a simple polygon (Q1807612)
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 1367684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the shortest watchman route in a simple polygon |
scientific article; zbMATH DE number 1367684 |
Statements
Finding the shortest watchman route in a simple polygon (English)
0 references
23 November 1999
0 references
shortest watchman route
0 references
0.953389286994934
0 references
0.9386236667633056
0 references
0.928207516670227
0 references
0.9198090434074402
0 references
