Acrophobic guard watchtower problem

DOI10.1016/J.COMGEO.2022.101918OpenAlexW4290790717WikidataQ114195455 ScholiaQ114195455MaRDI QIDQ2096366FDOQ2096366

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

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

zbMATH Keywords

algorithmscomplexityterrain guardingacrophobic guardwatchtower

Mathematics Subject Classification ID

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

Cites Work

• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Title not available (Why is that?)
• Guarding polyhedral terrains
• Finding the intersection of two convex polyhedra
• The shortest watchtower and related problems for polyhedral terrains
• Guarding polyhedral terrain by \(k\)-watchtowers
• Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
• Parametric search: three new applications
• Guarding a terrain by two watchtowers

Cited In (1)

• Guarding precise and imprecise polyhedral terrains with segments

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)