scientific article; zbMATH DE number 177851
From MaRDI portal
Publication:4038729
Recommendations
Cited in
(53)- Edge guards in rectilinear polygons
- On the number of guard edges of a polygon
- An efficient algorithm for guard placement in polygons with holes
- Note on an art gallery problem
- Illuminating labyrinths.
- Illuminating disjoint line segments in the plane
- Art gallery problem with guards whose range of vision is \(180^{\circ}\)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Mobile versus point guards
- Guarding disjoint triangles and claws in the plane
- Generalized guarding and partitioning for rectilinear polygons
- Vertex-to-point conflict-free chromatic guarding is NP-hard
- Clearing an orthogonal polygon to find the evaders
- Perfect graphs and guarding rectilinear art galleries
- Covering orthogonal polygons with sliding \(k\)-transmitters
- A tight bound for point guards in piecewise convex art galleries
- Guarding orthogonal art galleries with sliding cameras
- How to guard orthogonal polygons: diagonal graphs and vertex covers
- Art gallery problem with rook and queen vision
- Orthogonal art galleries, holes, and reflex guards
- Computational complexity of the r-visibility guard set problem for polyominoes
- Universal guard problems
- Cooperative guards in art galleries with one hole
- On Some City Guarding Problems
- Guard placement for efficient point-in-polygon proofs
- A Short Proof of the Rectilinear Art Gallery Theorem
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 59108 (Why is no real title available?)
- COMPUTATIONAL GEOMETRY COLUMN 15
- scientific article; zbMATH DE number 139794 (Why is no real title available?)
- An art gallery theorem for line segments in the plane
- Art Gallery Problems for Convex Nested Polygons
- scientific article; zbMATH DE number 2011842 (Why is no real title available?)
- Irrational guards are sometimes needed
- scientific article; zbMATH DE number 219237 (Why is no real title available?)
- A Novel Efficient Approach for Solving the Art Gallery Problem
- Vertex guarding for dynamic orthogonal art galleries
- A simple proof of the rectilinear art gallery theorem
- Exact Solutions and Bounds for General Art Gallery Problems
- Guarding polyominoes
- scientific article; zbMATH DE number 6729378 (Why is no real title available?)
- The dispersive art gallery problem
- Illumination with orthogonal floodlights
- A note on the contractions for orthogonal polygons
- City guarding with cameras of bounded field of view
- The art gallery theorem for polyominoes
- Facets for art gallery problems
- An alternative proof of the rectilinear art gallery theorem
- Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem
- Guarding galleries and terrains
- Guarding curvilinear art galleries with vertex or point guards
- Note on the paper ``K-vertex guarding simple polygons
- An ``Art Gallery Theorem for pyramids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038729)
