An Art Gallery Approach to Ensuring that Landmarks are Distinguishable

How many different classes of partially distinguishable landmarks are needed to ensure that a robot can always see a landmark without simultaneously seeing two of the same class? To study this, we introduce the chromatic art gallery problem. A guard set S ⊂ P is a set of points in a polygon P such that for all p ∈ P , there exists an s ∈ S such that s and p are mutually visible. Suppose that two members of a finite guard set S ⊂ P must be given different colors if their visible regions overlap. What is the minimum number of colors required to color any guard set (not necessarily a minimal guard set) of a polygon P? We call this number, χG(P ), the chromatic guard number of P . We believe this problem has never been examined before, and it has potential applications to robotics, surveillance, sensor networks, and other areas. We show that for any spiral polygon Pspi, χG(Pspi) ≤ 2, and for any staircase polygon (strictly monotone orthogonal polygon) Psta, χG(Psta) ≤ 3. For lower bounds, we construct a polygon with 4k vertices that requires k colors. We also show that for any positive integer k, there exists a monotone polygon Mk with 3k vertices such that χG(Mk) ≥ k, and for any odd integer k, there exists an orthogonal polygon Rk with 4k + 10k + 10 vertices such that χG(Rk) ≥ k.

[1]  David J. Kriegman,et al.  Selecting promising landmarks , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[2]  Sebastian Thrun.  Finding landmarks for mobile robot navigation , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[3]  Subir Kumar Ghosh.  On Recognizing and Characterizing Visibility Graphs of Simple Polygons , 1988, SWAT.

[4]  Godfried T. Toussaint,et al.  Efficient triangulation of simple polygons , 1991, The Visual Computer.

[5]  Zoltán Füredi,et al.  The prison yard problem , 1994, Comb..

[6]  Thomas C. Shermer,et al.  Isomorphism of spiral polygons , 1996, Discret. Comput. Geom..

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

[8]  Bernadette Dorizzi,et al.  Color-Based Iris Verification , 2007, ICB.

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

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

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

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

[13]  J. Mark Keil,et al.  Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..

[14]  Bengt J. Nilssony,et al.  Optimum Watchmen Routes in Spiral Polygons , 2007 .

[15]  Val Pinciu,et al.  Art gallery theorems for guarded guards , 2003, Comput. Geom..

[16]  Hazel Everett,et al.  Recognizing Visibility Graphs of Spiral Polygons , 1990, J. Algorithms.

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

[18]  Bengt J. Nilsson,et al.  Approximate Guarding of Monotone and Rectilinear Polygons , 2012, Algorithmica.

[19]  Clark F. Olson.  Selecting Landmarks for Localization in Natural Terrain , 2002, Auton. Robots.

[20]  Richard C. T. Lee,et al.  An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons , 1994, Inf. Process. Lett..

[21]  Val Pinciu,et al.  A Coloring Algorithm for Finding Connected Guards in Art Galleries , 2003, DMTCS.

[22]  Frank Hoffmann,et al.  A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems , 1996, SIAM J. Discret. Math..

[23]  Csaba D. Tóth,et al.  Guarding curvilinear art galleries with vertex or point guards , 2009, Comput. Geom..

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