Fast computation of shortest watchman routes in simple polygons (Q1607078): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29304368, #quickstatements; #temporary_batch_1705502051474 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:58, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of shortest watchman routes in simple polygons |
scientific article |
Statements
Fast computation of shortest watchman routes in simple polygons (English)
0 references
25 July 2002
0 references
watchman route problem
0 references
