Guarding galleries and terrains
From MaRDI portal
Publication:845875
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
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 177851 (Why is no real title available?)
- scientific article; zbMATH DE number 2119696 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- A linear algorithm for computing the visibility polygon from a point
- A randomized art-gallery algorithm for sensor placement
- Algorithms for polytope covering and approximation
- Almost optimal set covers in finite VC-dimension
- An alternative proof of the rectilinear art gallery theorem
- An art gallery theorem for line segments in the plane
- An output sensitive algorithm for discrete convex hulls
- Approximation algorithms for terrain guarding.
- Guarding galleries where no point sees a small area.
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
- On the combinatorial and algebraic complexity of quantifier elimination
- Path Planning in 0/1/∞ Weighted Regions with Applications
- Pick's Theorem Revisited
- Some NP-hard polygon decomposition problems
Cited in
(35)- Guarding a terrain by two watchtowers
- Approximation algorithms for art gallery problems in polygons
- Experimental study on approximation algorithms for guarding sets of line segments
- Towards optimal positioning of surveillance UGVs
- A nearly optimal algorithm for covering the interior of an art gallery
- Finding the \(\Theta \)-guarded region
- GUARDING ART GALLERIES BY GUARDING WITNESSES
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- Parameterized Analysis of Art Gallery and Terrain Guarding
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Guards, Galleries, Fortresses, and the Octoplex
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Multi-agent deployment for visibility coverage in polygonal environments with holes
- Approximate guarding of monotone and rectilinear polygons
- A nearly optimal sensor placement algorithm for boundary coverage
- Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
- Topological art in simple galleries
- Fault Tolerant Guarding of Grids
- Approximability of guarding weak visibility polygons
- On the complexity of half-guarding monotone polygons
- Universal guard problems
- Connecting guards with minimum Steiner points inside simple polygons
- scientific article; zbMATH DE number 2009908 (Why is no real title available?)
- Locating guards for visibility coverage of polygons
- An approximation algorithm for the art gallery problem
- Improved approximation for guarding simple galleries from the perimeter
- The art gallery theorem for polyominoes
- Finding a guard that sees most and a shop that sells most
- A practical algorithm with performance guarantees for the art gallery problem
- Polygon guarding with orientation
- Minimum covering with travel cost
- The VC-dimension of visibility on the boundary of monotone polygons
- Link distance and shortest path problems in the plane
- The parameterized complexity of guarding almost convex polygons
- scientific article; zbMATH DE number 7236415 (Why is no real title available?)
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)
