Guarding monotone art galleries with sliding cameras in linear time
DOI10.1016/J.JDA.2017.04.005zbMATH Open1370.68307OpenAlexW2618053861MaRDI QIDQ2363353FDOQ2363353
Authors: Stephane Durocher, Saeed Mehrabi, Mark de Berg 
Publication date: 13 July 2017
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2017.04.005
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Introduction to algorithms.
- Almost optimal set covers in finite VC-dimension
- Terrain guarding is NP-hard
- Title not available (Why is that?)
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- Approximation algorithms for art gallery problems in polygons
- A combinatorial theorem in plane geometry
- Title not available (Why is that?)
- The art gallery theorem for polyominoes
- Improved approximation for guarding simple galleries from the perimeter
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Computational complexity of art gallery problems
- Approximate guarding of monotone and rectilinear polygons
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- Coverage with \(k\)-transmitters in the presence of obstacles
- Guarding orthogonal art galleries using sliding cameras: algorithmic and hardness results
- On guarding orthogonal polygons with sliding cameras
- Guarding orthogonal art galleries with sliding cameras
- Fast vertex guarding for polygons with and without holes
- Guarding monotone art galleries with sliding cameras in linear time
- Parameterized hardness of art gallery problems
Cited In (4)
This page was built for publication: Guarding monotone art galleries with sliding cameras in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363353)
