Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (Q2482906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the shortest watchtower of a polyhedral terrain in O(n n) time. |
scientific article; zbMATH DE number 5268006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. |
scientific article; zbMATH DE number 5268006 |
Statements
Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (English)
0 references
25 April 2008
0 references
0.9335336685180664
0 references
0.850526750087738
0 references
0.8480740785598755
0 references
0.8306814432144165
0 references
