Guarding orthogonal art galleries with sliding cameras
From MaRDI portal
Publication:2401332
DOI10.1016/j.comgeo.2017.04.001zbMath1377.65025MaRDI QIDQ2401332
Stephane Durocher, Ali D. Mehrabi, Omrit Filtser, Robert Fraser, Saeed Mehrabi
Publication date: 8 September 2017
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2017.04.001
numerical example; approximation algorithms; orthogonal polygon; sliding cameras; minimum-cardinality sliding cameras problem; minimum-length sliding cameras problem; orthogonal art galleries
62H35: Image analysis in multivariate analysis
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
65D19: Computational issues in computer and robotic vision
Related Items
Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation, On orthogonally guarding orthogonal polygons with bounded treewidth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The art gallery theorem for polyominoes
- Approximation algorithms for hitting objects with straight lines
- A combinatorial theorem in plane geometry
- On guarding the vertices of rectilinear domains
- Visibility and Ray Shooting Queries in Polygonal Domains
- Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
- GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
- Traditional Galleries Require Fewer Watchmen
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Computational complexity of art gallery problems
- An Optimal Algorithm for Finding the Kernel of a Polygon
- TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- Reducibility among Combinatorial Problems
- Multiplying matrices faster than coppersmith-winograd
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
