Guarding monotone art galleries with sliding cameras in linear time
From MaRDI portal
Publication:2363353
DOI10.1016/j.jda.2017.04.005zbMath1370.68307OpenAlexW2618053861MaRDI QIDQ2363353
Stephane Durocher, Saeed Mehrabi, Mark T. 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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximation for guarding simple galleries from the perimeter
- The art gallery theorem for polyominoes
- Approximation algorithms for art gallery problems in polygons
- A combinatorial theorem in plane geometry
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- Almost optimal set covers in finite VC-dimension
- Fast vertex guarding for polygons with and without holes
- Coverage with \(k\)-transmitters in the presence of obstacles
- Approximate guarding of monotone and rectilinear polygons
- Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
- Guarding Monotone Art Galleries with Sliding Cameras in Linear Time
- On Guarding Orthogonal Polygons with Sliding Cameras
- GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
- Terrain Guarding is NP-Hard
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Computational complexity of art gallery problems
- Parameterized Hardness of Art Gallery Problems
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
