Open Guard Edges and Edge Guards in Simple Polygons

An open edge of a simple polygon is the set of points in the relative interior of an edge. We revisit several art gallery problems, previously considered for closed edge guards, using open edge guards. A guard edge of a polygon is an edge that sees every point inside the polygon. We show that every simple non-starshaped polygon admits at most one open guard edge, and give a simple new proof that it admits at most three closed guard edges. We also characterize open guard edges using a special type of kernel. Finally, we present lower bound constructions for simple polygons with n vertices that require \(\lfloor n/3 \rfloor\) open edge guards, and conjecture that this bound is tight.

[1]  D. T. Lee,et al.  An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.

[2]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

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

[4]  Godfried T. Toussaint,et al.  Visibility between two edges of a simple polygon , 1986, The Visual Computer.

[5]  Asish Mukhopadhyay,et al.  Optimally computing a shortest weakly visible line segment inside a simple polygon , 2002, Comput. Geom..

[6]  Xuehou Tan,et al.  Fast computation of shortest watchman routes in simple polygons , 2001, Inf. Process. Lett..

[7]  T. Shermer Recent Results in Art Galleries , 1992 .

[8]  Sung Yong Shin,et al.  On the number of guard edges of a polygon , 1993, Discret. Comput. Geom..

[9]  Danny Ziyi Chen Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon , 1993, ISAAC.

[10]  Joseph O'Rourke,et al.  Galleries need fewer mobile guards: A variation on Chvátal's theorem , 1983 .

[11]  Sung Yong Shin,et al.  An optimal algorithm for finding all visible edges in a simple polygon , 1989, IEEE Trans. Robotics Autom..

[12]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[13]  Fang-Rong Hsu,et al.  Finding the shortest boundary guard of a simple polygon , 2001, Theor. Comput. Sci..

[14]  Giovanni Viglietta Searching Polyhedra by Rotating Planes , 2011, ArXiv.