Guarding precise and imprecise polyhedral terrains with segments
From MaRDI portal
Publication:6606244
DOI10.1007/978-3-031-49614-1_24MaRDI QIDQ6606244FDOQ6606244
Authors: Bradley McCoy, Binhai Zhu, Aakash Dutt 
Publication date: 16 September 2024
Cites Work
- Guarding polyhedral terrains
- Removing local extrema from imprecise terrains
- SMOOTHING IMPRECISE 1.5D TERRAINS
- An Optimal Algorithm for Finding the Kernel of a Polygon
- COMPUTING SHORTEST TRANSVERSALS OF SETS
- Finding the intersection of n half-spaces in time O(n log n)
- The shortest watchtower and related problems for polyhedral terrains
- Guarding polyhedral terrain by \(k\)-watchtowers
- Title not available (Why is that?)
- Flow computations on imprecise terrains
- Three-dimensional weak visibility: Complexity and applications
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- Acrophobic guard watchtower problem
- Parametric search: three new applications
- Guarding a terrain by two watchtowers
This page was built for publication: Guarding precise and imprecise polyhedral terrains with segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606244)
