On the planar two-watchtower problem
From MaRDI portal
Recommendations
Cited in
(12)- Computing all large sums-of-pairs in R^n and the discrete planar two-watchtower problem
- The shortest watchtower and related problems for polyhedral terrains
- Acrophobic guard watchtower problem
- Parametric search: three new applications
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- The two-guard problem revisited and its generalization
- Guarding a terrain by two watchtowers
- Guarding precise and imprecise polyhedral terrains with segments
- Guarding points on a terrain by watchtowers
- Guarding terrains with guards on a line
- On the discrete and semi-continuous versions of the two-watchtower problem in the plane
- Guarding polyhedral terrain by k-watchtowers
This page was built for publication: On the planar two-watchtower problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551354)