2013/06/18 by Antonio Leslie Bajuelos, Antonio L. Bajuelos, Bajuelos, Antonio Leslie +10
Computer Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Optimization and Search Problems #Robotic Path Planning Algorithms #cs.CG
paper · pdf · doi:10.48550/arxiv.1306.4359
13 pages
arxiv created 2013/06/18 · openalex publication_date 2013/06/18 · arxiv updated 2013/06/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper focuses on a variation of the Art Gallery problem that considers open edge guards and open mobile guards. A mobile guard can be placed on edges and diagonals of a polygon, and the "open" prefix means that the endpoints of such edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open edge and open mobile guards. This problem is also considered for planar triangulation graphs using open edge guards.