Vertex guarding for dynamic orthogonal art galleries

We devise an algorithm for surveying a dynamic orthogonal polygonal domain by placing one guard at each vertex in a subset of its vertices, i.e., whenever an orthogonal polygonal domain [Formula: see text] is modified to result in another orthogonal polygonal domain [Formula: see text], our algorithm updates the set of vertex guards surveying [Formula: see text] so that the updated guard set surveys [Formula: see text]. Our algorithm modifies the guard placement in [Formula: see text] amortized time, while ensuring the updated orthogonal polygonal domain with [Formula: see text] holes and [Formula: see text] vertices is guarded using at most [Formula: see text] vertex guards. For the special case of the initial orthogonal polygon being hole-free and each update resulting in a hole-free orthogonal polygon, our guard update algorithm takes [Formula: see text] worst-case time. Here, [Formula: see text] and [Formula: see text] are the number of vertices of the orthogonal polygon before and after the update, respectively; and, [Formula: see text] is the sum of [Formula: see text] and the number of updates to a few structures maintained by our algorithm. Further, by giving a construction, we show it suffices for the algorithm to consider only the case in which the parity of the number of reflex vertices of both [Formula: see text] and [Formula: see text] are equal.

[1]  R. Inkulu,et al.  Maintaining the Visibility Graph of a Dynamic Simple Polygon , 2019, CALDAM.

[2]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[3]  R. Inkulu,et al.  Incremental Algorithms to Update Visibility Polygons , 2017, CALDAM.

[4]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[5]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[6]  Anna Lubiw,et al.  Decomposing polygonal regions into convex quadrilaterals , 1985, SCG '85.

[7]  Diane L. Souvaine,et al.  An efficient algorithm for guard placement in polygons with holes , 1995, Discret. Comput. Geom..

[8]  Subir Kumar Ghosh,et al.  Approximability of guarding weak visibility polygons , 2014, Discret. Appl. Math..

[9]  Christian Worm Mortensen,et al.  Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time , 2003, SODA '03.

[10]  A. Aggarwal.  The art gallery theorem: its variations, applications and algorithmic aspects , 1984 .

[11]  Godfried T. Toussaint,et al.  Guard Placement in Rectilinear Polygons , 1988 .

[12]  Mohammad Ghodsi,et al.  Visibility maintenance of a moving segment observer inside polygons with holes , 2010, CCCG.

[13]  Haim Kaplan,et al.  Optimal dynamic vertical ray shooting in rectilinear planar subdivisions , 2007, SODA '07.

[14]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[15]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[16]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[17]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[18]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

[19]  D. T. Lee,et al.  Computational Complexity of Art Gallery Problems , 1990, Autonomous Robot Vehicles.

[20]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[21]  Matthew J. Katz,et al.  On guarding the vertices of rectilinear domains , 2008, Comput. Geom..

[22]  Frank Hoffmann,et al.  The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[23]  David Avis.  Review: Joseph O'Rourke, Art gallery theorems and algorithms , 1990 .

[24]  Frank Hoffmann,et al.  On the Rectilinear Art Gallery Problem (Extended Abstract) , 1990, ICALP.

[25]  K. Sowmya,et al.  Dynamic Algorithms for Visibility Polygons in Simple Polygons , 2020, Int. J. Comput. Geom. Appl..

[26]  Ovidiu Daescu,et al.  Maintaining Visibility of a Polygon with a Moving Point of View , 1996, Inf. Process. Lett..

[27]  J. O'Rourke.  An alternate proof of the rectilinear art gallery theorem , 1983 .

[28]  R. Inkulu,et al.  Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane , 2020, COCOON.

[29]  Subir Kumar Ghosh,et al.  Approximation algorithms for art gallery problems in polygons , 2010, Discret. Appl. Math..

[30]  J. O'Rourke,et al.  Stationing guards in rectilinear art galleries , 1984 .

[31]  James King.  Fast vertex guarding for polygons with and without holes , 2013, Comput. Geom..

[32]  Hans-Dietrich Hecker,et al.  Two NP-Hard Art-Gallery Problems for Ortho-Polygons , 1995, Math. Log. Q..