Fast computation of shortest watchman routes in simple polygons (Q1607078): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00146-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974433908 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 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
