Computing the shortest watchtower of a polyhedral terrain in O(n n) time.
From MaRDI portal
Publication:2482906
DOI10.1016/S0925-7721(96)00009-0zbMATH Open1133.68467OpenAlexW2074915405MaRDI QIDQ2482906FDOQ2482906
Authors: Binhai Zhu 
Publication date: 25 April 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(96)00009-0
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Convex Analysis
- A linear algorithm for determining the separation of convex polyhedra
- Optimal Search in Planar Subdivisions
- Fractional cascading. I: A data structuring technique
- Title not available (Why is that?)
- An algorithm for generalized point location and its applications
- Title not available (Why is that?)
- Finding the intersection of n half-spaces in time O(n log n)
- Title not available (Why is that?)
- The shortest watchtower and related problems for polyhedral terrains
- Searching and storing similar lists
Cited In (11)
- Parametric search: three new applications
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Approximation algorithms for terrain guarding.
- Guarding precise and imprecise polyhedral terrains with segments
- Title not available (Why is that?)
- Routing in a polygonal terrain with the shortest beacon watchtower
- Guarding a terrain by two watchtowers
- The shortest watchtower and related problems for polyhedral terrains
- Guarding polyhedral terrain by \(k\)-watchtowers
- Three-dimensional weak visibility: Complexity and applications
- Acrophobic guard watchtower problem
This page was built for publication: Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482906)
