Finding the shortest watchman route in a simple polygon (Q1807612): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/pl00009467 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986642089 / rank | |||
Normal rank | |||
Latest revision as of 11:56, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the shortest watchman route in a simple polygon |
scientific article |
Statements
Finding the shortest watchman route in a simple polygon (English)
0 references
23 November 1999
0 references
shortest watchman route
0 references
