Vertex Guarding for Dynamic Orthogonal Art Galleries

DOI10.1142/S0218195921500060zbMath1487.68240arXiv2006.16651OpenAlexW4210635977MaRDI QIDQ5072223

Debangshu Banerjee, Rajasekhar Inkulu

Publication date: 26 April 2022

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.16651

zbMATH Keywords

computational geometrydynamic algorithmsart gallery

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining visibility of a polygon with a moving point of view
• An alternative proof of the rectilinear art gallery theorem
• Approximation algorithms for art gallery problems in polygons
• Triangulating a simple polygon in linear time
• A short proof of Chvatal's Watchman Theorem
• An efficient algorithm for guard placement in polygons with holes
• A combinatorial theorem in plane geometry
• Fast vertex guarding for polygons with and without holes
• Visibility polygon queries among dynamic polygonal obstacles in plane
• Maintaining the visibility graph of a dynamic simple polygon
• Approximability of guarding weak visibility polygons
• On guarding the vertices of rectilinear domains
• Incremental Algorithms to Update Visibility Polygons
• Traditional Galleries Require Fewer Watchmen
• Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
• Dynamic Algorithms for Visibility Polygons in Simple Polygons
• Visibility Algorithms in the Plane