Pages that link to "Item:Q2482906"
From MaRDI portal
The following pages link to Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (Q2482906):
Displayed 7 items.
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- Approximation algorithms for terrain guarding. (Q1603553) (← links)
- Routing in a polygonal terrain with the shortest beacon watchtower (Q1699277) (← links)
- Acrophobic guard watchtower problem (Q2096366) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Inapproximability of finding maximum hidden sets on polygons and terrains (Q5959557) (← links)
- Guarding a terrain by two watchtowers (Q5961974) (← links)