Abstract
We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with \(O(\log {n})\) bits each. An algorithm can read and write O(s) additional words of workspace during its execution, and it writes its output to write-only memory. In a given polygon P and for a given point \(q \in P\), we say that a point p is inside the k-visibility region of q, if and only if the line segment pq intersects the boundary of P at most k times. Given a simple n-vertex polygon P stored in a read-only input array and a point \(q \in P\), we give a time-space trade-off algorithm which reports the k-visibility region of q in P in \(O(cn/s+n\log {s}+ \min \{{\lceil k/s \rceil n,n \log {\log _s{n}}}\})\) expected time using O(s) words of workspace. Here \(c\le n\) is the number of critical vertices for q, i.e., the vertices of P where the visibility region may change. We also show how to generalize this result for polygons with holes and for sets of non-crossing line segments.
This work was partially supported by DFG project MU/3501-2 and by the Natural Sciences and Engineering Research Council of Canada (NSERC).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aichholzer, O., Fabila Monroy, R., Flores Peñaloza, D., Hackl, T., Huemer, C., Urrutia Galicia, J., Vogtenhuber, B.: Modem illumination of monotone polygons. In: Proceedings of 25th EWCG, pp. 167–170 (2009)
Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rote, G., Schulz, A.: Memory-constrained algorithms for simple polygons. CGTA 46(8), 959–969 (2013)
Bajuelos, A.L., Canales, S., Hernández-Peñalver, G., Martins, A.M.: A hybrid metaheuristic strategy for covering with wireless devices. J. UCS 18(14), 1906–1932 (2012)
Ballinger, B., Benbernou, N., Bose, P., et al.: Coverage with k-transmitters in the presence of obstacles. In: Wu, W., Daescu, O. (eds.) COCOA 2010. LNCS, vol. 6509, pp. 1–15. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17461-2_1
Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.I.: Space-time trade-offs for stack-based algorithms. Algorithmica 72(4), 1097–1129 (2015)
Barba, L., Korman, M., Langerman, S., Silveira, R.I.: Computing a visibility polygon using few variables. CGTA 47(9), 918–926 (2014)
Chan, T.M.: Comparison-based time-space lower bounds for selection. TALG 6(2), 26 (2010)
Chan, T.M., Chen, E.Y.: Multi-pass geometric algorithms. DCG 37(1), 79–102 (2007)
Chan, T.M., Munro, J.I., Raman, V.: Selection and sorting in the restore model. In: Proceedings of 25th SODA, pp. 995–1004. SIAM (2014)
Dean, A.M., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar k-visibility graphs: bounds on the number of edges, chromatic number, and thickness. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 73–82. Springer, Heidelberg (2006). doi:10.1007/11618058_7
Dean, J.A., Lingas, A., Sack, J.R.: Recognizing polygons, or how to spy. Vis. Comput. 3(6), 344–355 (1988)
Eppstein, D., Goodrich, M.T., Sitchinava, N.: Guard placement for efficient point in-polygon proofs. In: Proceedings of 23rd SoCG, pp. 27–36. ACM (2007)
Fabila-Monroy, R., Vargas, A.R., Urrutia, J.: On modem illumination problems. In: Proceedings of 13th EGC (2009)
Felsner, S., Massow, M.: Parameters of bar k-visibility graphs. JGAA 12(1), 5–27 (2008)
Fulek, R., Holmsen, A.F., Pach, J.: Intersecting convex sets by rays. DCG 42(3), 343–358 (2009)
Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)
Hartke, S.G., Vandenbussche, J., Wenger, P.: Further results on bar \(k\)-visibility graphs. SIAM J. Discrete Math. 21(2), 523–531 (2007)
Joe, B., Simpson, R.B.: Corrections to Lee’s visibility polygon algorithm. BIT Numer. Math. 27(4), 458–473 (1987)
Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. TCS 165(2), 311–323 (1996)
O’Rourke, J.: Computational geometry column 52. ACM SIGACT News 43(1), 82–85 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bahoo, Y., Banyassady, B., Bose, P., Durocher, S., Mulzer, W. (2017). Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. In: Poon, SH., Rahman, M., Yen, HC. (eds) WALCOM: Algorithms and Computation. WALCOM 2017. Lecture Notes in Computer Science(), vol 10167. Springer, Cham. https://doi.org/10.1007/978-3-319-53925-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-53925-6_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53924-9
Online ISBN: 978-3-319-53925-6
eBook Packages: Computer ScienceComputer Science (R0)