Guarding galleries and terrains
From MaRDI portal
Publication:845875
DOI10.1016/J.IPL.2006.05.014zbMATH Open1185.68776OpenAlexW2110033738MaRDI QIDQ845875FDOQ845875
Authors: Alon Efrat, Sariel Har-Peled 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.014
Recommendations
- Guarding rectangular art galleries
- Guarding galleries where every point sees a large area
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- Guarding galleries where no point sees a small area.
- Reflective guarding a gallery
- Art galleries with guards of uniform range of vision
- Watched guards in art galleries
- Cooperative guards in art galleries
- scientific article; zbMATH DE number 1728322
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Almost optimal set covers in finite VC-dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- An alternative proof of the rectilinear art gallery theorem
- Title not available (Why is that?)
- On the combinatorial and algebraic complexity of quantifier elimination
- Title not available (Why is that?)
- Algorithms for polytope covering and approximation
- Some NP-hard polygon decomposition problems
- Guarding galleries where no point sees a small area.
- Path Planning in 0/1/∞ Weighted Regions with Applications
- An art gallery theorem for line segments in the plane
- A linear algorithm for computing the visibility polygon from a point
- Pick's Theorem Revisited
- An output sensitive algorithm for discrete convex hulls
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
- Approximation algorithms for terrain guarding.
- Title not available (Why is that?)
- A randomized art-gallery algorithm for sensor placement
Cited In (33)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
- Guards, Galleries, Fortresses, and the Octoplex
- Improved approximation for guarding simple galleries from the perimeter
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Multi-agent deployment for visibility coverage in polygonal environments with holes
- On the complexity of half-guarding monotone polygons
- Approximation algorithms for art gallery problems in polygons
- Approximability of guarding weak visibility polygons
- The VC-dimension of visibility on the boundary of monotone polygons
- A practical algorithm with performance guarantees for the art gallery problem
- Title not available (Why is that?)
- Finding a guard that sees most and a shop that sells most
- Minimum covering with travel cost
- Towards optimal positioning of surveillance UGVs
- Approximate guarding of monotone and rectilinear polygons
- The parameterized complexity of guarding almost convex polygons
- Experimental study on approximation algorithms for guarding sets of line segments
- The art gallery theorem for polyominoes
- A nearly optimal algorithm for covering the interior of an art gallery
- Finding the \(\Theta \)-guarded region
- Topological art in simple galleries
- Polygon guarding with orientation
- Link distance and shortest path problems in the plane
- A nearly optimal sensor placement algorithm for boundary coverage
- Locating guards for visibility coverage of polygons
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Universal Guard Problems
- Title not available (Why is that?)
- Fault Tolerant Guarding of Grids
- Guarding a terrain by two watchtowers
This page was built for publication: Guarding galleries and terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845875)
