Note on covering monotone orthogonal polygons with star-shaped polygons

In 1986, Keil provided an O(n2) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm-we show that with a little modification, the first step Sweep1 of the discussed algorithm-which computes the top ceilings of horizontal grid segments-can be omitted. In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution-the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space.

[1]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

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

[3]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

[5]  Chris Worman,et al.  Decomposing Polygons into r-stars or -boundable Subpolygons , 2004 .

[6]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[7]  Rajeev Motwani,et al.  Covering orthogonal polygons with star polygons: the perfect graph approach , 1988, SCG '88.

[8]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[9]  Daniel J. Kleitman,et al.  An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals , 1984, STOC '84.

[10]  J. Mark Keil,et al.  Polygon Decomposition and the Orthogonal Art Gallery Problem , 2007, Int. J. Comput. Geom. Appl..

[11]  Joseph C. Culberson,et al.  Covering Polygons Is Hard , 1994, J. Algorithms.

[12]  A. Lubiw.  Orderings and some combinatorial optimization problems with geometric applications , 1986 .

[13]  Rajeev Motwani,et al.  Perfect Graphs and Orthogonally Convex Covers , 1989, SIAM J. Discret. Math..

[14]  J. Mark Keil.  Minimally covering a horizontally convex orthogonal polygon , 1986, SCG '86.

[15]  Mark Keil,et al.  On covering orthogonal polygons with star-shaped polygons , 1992, Inf. Sci..

[16]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[17]  Eugene L. Lawler,et al.  Polygon decomposition and perfect graphs , 1988 .