Covering grids and orthogonal polygons with periscope guards

DOI10.1016/0925-7721(93)90013-VzbMath0774.68058OpenAlexW2063312439MaRDI QIDQ2365810

Laxmi P. Gewali, Simeon C. Ntafos

Publication date: 29 June 1993

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90013-v

zbMATH Keywords

visibilityorthogonal polygonsperiscope visibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (8)

On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Cooperative mobile guards in grids ⋮ A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras ⋮ Finding minimum witness sets in orthogonal polygons ⋮ Watchman routes for lines and line segments ⋮ Vertex-edge domination in graphs ⋮ THE MINIMUM GUARDING TREE PROBLEM ⋮ The searchlight problem for road networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering orthogonal polygons with star polygons: The perfect graph approach
• The power of geometric duality
• On gallery watchmen in grids
• Hiding people in polygons
• On covering orthogonal polygons with star-shaped polygons
• Some properties of \(L\) sets in the plane
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Computational complexity of art gallery problems
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Perfect Graphs and Orthogonally Convex Covers
• Some NP-hard polygon decomposition problems
• Covering Polygons Is Hard

This page was built for publication: Covering grids and orthogonal polygons with periscope guards