Guarding precise and imprecise polyhedral terrains with segments
From MaRDI portal
Publication:6606244
Cites Work
- scientific article; zbMATH DE number 1796960 (Why is no real title available?)
- Acrophobic guard watchtower problem
- An Optimal Algorithm for Finding the Kernel of a Polygon
- COMPUTING SHORTEST TRANSVERSALS OF SETS
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- Finding the intersection of n half-spaces in time O(n log n)
- Flow computations on imprecise terrains
- Guarding a terrain by two watchtowers
- Guarding polyhedral terrain by \(k\)-watchtowers
- Guarding polyhedral terrains
- Parametric search: three new applications
- Removing local extrema from imprecise terrains
- SMOOTHING IMPRECISE 1.5D TERRAINS
- The shortest watchtower and related problems for polyhedral terrains
- Three-dimensional weak visibility: Complexity and applications
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)
