Fast computation of shortest watchman routes in simple polygons (Q1607078): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q29304368, #quickstatements; #temporary_batch_1705502051474 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29304368 / rank | |||
Normal rank | |||
Revision as of 16:36, 17 January 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
