Abstract
A sliding camera in an orthogonal polygon \(P\) is a point guardĀ \(g\) that travels back and forth along an orthogonal line segment \(s\) inside \(P\). A point \(p\) in \(P\) is guarded by \(g\) if and only if there exists a point \(q\) on \(s\) such that line segment \(pq\) is normal to \(s\) and contained inĀ \(P\). In the minimum sliding cameras (MSC) problem, the objective is to guard \(P\) with the minimum number of sliding cameras. We give a linear-time dynamic programming algorithm for the MSC problem on \(x\)-monotone orthogonal polygons, improving the 2-approximation algorithm of Katz and Morgenstern (2011). More generally, our algorithm can be used to solve the MSC problem in linear time on simple orthogonal polygons \(P\) for which the dual graph induced by the vertical decomposition of \(P\) is a path. Our results provide the first polynomial-time exact algorithms for the MSC problem on a non-trivial subclass of orthogonal polygons.
Mark de BergāSupported by the Netherlands Organisation for Scientific Research (NWO) under project 024.002.003.
Stephane DurocherāSupported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC).
Saeed MehrabiāSupported in part by a Manitoba Graduate Scholarship (MGS).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
ChvĆ”tal, V.: A combinatorial theorem in plane geometry. J. Comb. Theor. Ser. B 18, 39ā41 (1975)
Durocher, S., Filtser, O., Fraser, R., Mehrabi, A.D., Mehrabi, S.: A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 294ā305. Springer, Heidelberg (2014)
Durocher, S., Mehrabi, S.: Guarding orthogonal art galleries using sliding cameras: algorithmic and hardness results. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 314ā324. Springer, Heidelberg (2013)
Eidenbenz, S.: Inapproximability results for guarding polygons without holes. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 427ā436. Springer, Heidelberg (1998)
Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Disc. App. Math. 158(6), 718ā722 (2010)
Katz, M.J., Morgenstern, G.: Guarding orthogonal art galleries with sliding cameras. Int. J. Comp. Geom. App. 21(2), 241ā250 (2011)
King, J., Krohn, E.: Terrain guarding is NP-hard. In: SODA, pp. 1580ā1593 (2010)
Krohn, E., Nilsson, B.J.: Approximate guarding of monotone and rectilinear polygons. Algorithmica 66(3), 564ā594 (2013)
Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theor. 32(2), 276ā282 (1986)
OāRourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press Inc, New York (1987)
Schuchardt, D., Hecker, H.-D.: Two NP-hard art-gallery problems for ortho-polygons. Math. Log. Quart. 41(2), 261ā267 (1995)
Seddighin, S.: Guarding polygons with sliding cameras. Masterās thesis, Sharif University of Technology (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
de Berg, M., Durocher, S., Mehrabi, S. (2014). Guarding Monotone Art Galleries with Sliding Cameras in Linear Time. In: Zhang, Z., Wu, L., Xu, W., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science(), vol 8881. Springer, Cham. https://doi.org/10.1007/978-3-319-12691-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-12691-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12690-6
Online ISBN: 978-3-319-12691-3
eBook Packages: Computer ScienceComputer Science (R0)