Abstract
The problem of finding the minimum r-star cover of orthogonal polygons had been open for many years, until 2004 when Ch. Worman and J. M. Keil proved it to be polynomial tractable (Polygon decomposition and the orthogonal art gallery problem, IJCGA 17(2) (2007), 105-138). However, their algorithm is not practical as it has \(\tilde{O}(n^{17})\) time complexity, where \(\tilde{O}()\) hides a polylogarithmic factor. Herein, we present a linear-time 3-approximation algorithm based upon the novel partition of a polygon into so-called [w]-star-shaped orthogonal polygons.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aggarwal, A.: The Art Gallery Theorem: Its Variations, Applications, and Algorithmic Aspects, Ph.D. Thesis, Johns Hopkins University (1984)
Carlsson, S., Nilsson, B.J., Ntafos, S.C.: Optimum guard covers and m-watchmen routes for restricted polygons. Int. J. Comput. Geometry Appl. 3(1), 85–105 (1993)
Chazelle, B.M., Dobkin, D.: Decomposing a polygon into convex parts. In: Proc. 11th ACM Symp. on Theory of Comput., pp. 38–48 (1979)
Culberson, J.C., Reckhow, R.A.: A unified approach to orthogonal polygon covering problems via dent diagrams, Technical Report TR 89-06, University of Alberta (1989)
Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms 17(1), 2–44 (1994)
Edelsbrunner, H., O’Rourke, J., Welzl, E.: Stationing guards in rectilinear art galleries. Computer Vision, Graphics and Image Processing 27, 167–176 (1984)
Franzblau, D.S., Kleitman, D.J.: An algorithm for constructing regions with rectangles: Independence and minimum generating sets for sollections of intervals. In: Proc. 16th ACM Symp. on Theory of Comput., pp. 167–174 (1984)
Gewali, L., Keil, J.M., Ntafos, S.C.: On covering orthogonal polygons with star-shaped polygons. Information Sciences 65, 45–63 (1992)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)
Keil, J.M.: Decomposing a polygon into simpler components. SIAM J. Computing 14, 799–817 (1985)
Keil, J.M.: Minimally covering a horizontally convex orthogonal polygon. In: Proc. 2nd Annual Symp. on Comput. Geometry, pp. 43–51 (1986)
Keil, J.M.: Polygon decomposition. In: Handbook of Computational Geometry, pp. 491–518. North-Holland Publishing, Amsterdam (2000)
Keil, J.M., Sack, J.-R.: Minimum decomposition of polygonal objects. In: Computational Geometry, pp. 197–216. North-Holland Publishing, Amsterdam (1985)
Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Handbook on Discrete Optimization, pp. 393–514. Elsevier Science, Amsterdam (2005)
Levcopoulos, C.: Heuristics for Minimum Decompositions of Polygons, Ph.D. Thesis, Linköping University (1987)
Lingas, A., Wasylewicz, A., Żyliński, P.: Note on covering orthogonal polygons with star-shaped polygons. Inform. Process. Lett. 104(6), 220–227 (2007)
Lu, H.-I.: Efficient Approximation Algorithms for Some Semidefinite Programs Ph.D. Thesis, Brown Univeristy (1996)
Lubiw, A.: Orderings and Some Combinatorial Optimization Problems with Geometric Applications, Ph.D. thesis, University of Toronto (1986)
Motwani, R., Raghunathan, A., Saran, H.: Perfect graphs and orthogonally convex covers. SIAM J. Discrete Math. 2, 371–392 (1989)
Motwani, R., Raghunathan, A., Saran, H.: Covering orthogonal polygons with star polygons: the perfect graph approach. J. Comput. Syst. Sci. 40, 19–48 (1990)
Raghunathan, A.: Polygon Decomposition and Perfect Graphs, Ph.D. Thesis, University of California (1988)
Reckhow, R.A.: Covering orthogonally convex polygons with three orientations of dents, Technical Report TR 87-17, University of Alberta (1987)
O’Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Transactions on Information Theory 29(2), 181–189 (1983)
Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, New York (1985)
Worman, Ch.: Decomposing Polygons into r-stars or α-boundable Subpolygons, Ms.C. Thesis, University of Saskachewan (2004)
Worman, C., Keil, J.M.: Polygon decomposition and the orthogonal art gallery problem. Int. J. Comput. Geometry and Appl. 17(2), 105–138 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lingas, A., Wasylewicz, A., Żyliński, P. (2008). Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-77891-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77890-5
Online ISBN: 978-3-540-77891-2
eBook Packages: Computer ScienceComputer Science (R0)