Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (Q2482906)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. |
scientific article |
Statements
Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (English)
0 references
25 April 2008
0 references
