Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427)
From MaRDI portal
scientific article; zbMATH DE number 7633536
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a shortest watchman path in a simple polygon in polynomial-time |
scientific article; zbMATH DE number 7633536 |
Statements
Computing a shortest watchman path in a simple polygon in polynomial-time (English)
0 references
16 December 2022
0 references
0 references
