Acrophobic guard watchtower problem
From MaRDI portal
Publication:2096366
DOI10.1016/j.comgeo.2022.101918OpenAlexW4290790717WikidataQ114195455 ScholiaQ114195455MaRDI QIDQ2096366
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
Publication date: 16 November 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101918
Algorithms in computer science (68Wxx) Computing methodologies and applications (68Uxx) Polytopes and polyhedra (52Bxx)
Cites Work
- Unnamed Item
- Guarding polyhedral terrains
- Guarding polyhedral terrain by \(k\)-watchtowers
- The shortest watchtower and related problems for polyhedral terrains
- Finding the intersection of two convex polyhedra
- Parametric search: three new applications
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Guarding a terrain by two watchtowers