Fast vertex guarding for polygons with and without holes
From MaRDI portal
Publication:1931264
DOI10.1016/j.comgeo.2012.07.004zbMath1262.65032OpenAlexW2017822593MaRDI QIDQ1931264
Publication date: 25 January 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.07.004
Related Items (7)
Guarding monotone art galleries with sliding cameras in linear time ⋮ Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ Vertex Guarding for Dynamic Orthogonal Art Galleries ⋮ Constrained Light Deployment for Reducing Energy Consumption in Buildings ⋮ The parameterized complexity of guarding almost convex polygons ⋮ An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries ⋮ How to Keep an Eye on Small Things
This page was built for publication: Fast vertex guarding for polygons with and without holes
