Polynomial-time algorithms for contiguous art gallery and related problems
From MaRDI portal
Cites work
- A combinatorial theorem in plane geometry
- A linear algorithm for computing the visibility polygon from a point
- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
- A short proof of Chvatal's Watchman Theorem
- Algorithms and Computation
- Altitude terrain guarding and guarding uni-monotone polygons
- An approximation algorithm for the art gallery problem
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Approximability of guarding weak visibility polygons
- Approximate guarding of monotone and rectilinear polygons
- Approximation algorithms for art gallery problems in polygons
- Art galleries and mobile guards: revisiting O'Rourke's proof
- Art galleries with guards of uniform range of vision
- Art gallery problem with guards whose range of vision is \(180^{\circ}\)
- Common tangents of two disjoint polygons in linear time and constant workspace
- Computational complexity of art gallery problems
- Computing and Combinatorics
- Covering orthogonal polygons with star polygons: The perfect graph approach
- CUTTING OUT POLYGONS WITH A CIRCULAR SAW
- Cutting out polygons with a circular saw
- CUTTING OUT POLYGONS WITH LINES AND RAYS
- Finding minimal convex nested polygons
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- Guarding galleries and terrains
- Guarding terrains via local search
- scientific article; zbMATH DE number 4060719 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 742976 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- scientific article; zbMATH DE number 6297811 (Why is no real title available?)
- Illumination of polygons by 45\(^{\circ}\)-floodlights
- Improved approximation for guarding simple galleries from the perimeter
- Inapproximability results for guarding polygons and terrains
- Irrational guards are sometimes needed
- Locating guards for visibility coverage of polygons
- Locating guards for visibility coverage of polygons
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
- On a circle-cover minimization problem
- On guarding the vertices of rectilinear domains
- On Some City Guarding Problems
- On the design of CGAL a computational geometry algorithms library
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Polygons cuttable by a circular saw
- Some NP-hard polygon decomposition problems
- Terrain guarding is NP-hard
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- The art gallery problem is \(\exists \mathbb{R}\)-complete
- The Art Gallery Problem is ∃ℝ-complete
- The point-boundary art gallery problem is \(\exists\mathbb{R}\)-hard
- Traditional Galleries Require Fewer Watchmen
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
This page was built for publication: Polynomial-time algorithms for contiguous art gallery and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312661)
