Acrophobic guard watchtower problem

DOI10.1016/J.COMGEO.2022.101918MaRDI QIDQ2096366zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

algorithmscomplexityterrain guardingacrophobic guardwatchtower

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Polytopes and polyhedra (52Bxx) Computing methodologies and applications (68Uxx)

Recommendations

• Guarding polyhedral terrain by k-watchtowers
• Guarding a terrain by two watchtowers
• Guarding a terrain by two watchtowers
• scientific article; zbMATH DE number 1796960
• The shortest watchtower and related problems for polyhedral terrains

Cites work

• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
• Finding the intersection of two convex polyhedra
• Guarding a terrain by two watchtowers
• Guarding polyhedral terrain by k-watchtowers
• Guarding polyhedral terrains
• Parametric search: three new applications
• The shortest watchtower and related problems for polyhedral terrains

Cited in

(4)

• Guarding precise and imprecise polyhedral terrains with segments
• Guarding terrains with guards on a line
• Guarding a 1.5D terrain with imprecise viewpoints
• On the discrete and semi-continuous versions of the two-watchtower problem in the plane

This page was built for publication: Acrophobic guard watchtower problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096366)