{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:32Z","timestamp":1725880592983},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_24","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"308-319","source":"Crossref","is-referenced-by-count":2,"title":["Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon"],"prefix":"10.1007","author":[{"given":"Yeganeh","family":"Bahoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bahareh","family":"Banyassady","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"24_CR1","unstructured":"Aichholzer, O., Fabila Monroy, R., Flores Pe\u00f1aloza, D., Hackl, T., Huemer, C., Urrutia Galicia, J., Vogtenhuber, B.: Modem illumination of monotone polygons. In: Proceedings of 25th EWCG, pp. 167\u2013170 (2009)"},{"issue":"8","key":"24_CR2","first-page":"959","volume":"46","author":"T Asano","year":"2013","unstructured":"Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rote, G., Schulz, A.: Memory-constrained algorithms for simple polygons. CGTA 46(8), 959\u2013969 (2013)","journal-title":"CGTA"},{"issue":"14","key":"24_CR3","first-page":"1906","volume":"18","author":"AL Bajuelos","year":"2012","unstructured":"Bajuelos, A.L., Canales, S., Hern\u00e1ndez-Pe\u00f1alver, G., Martins, A.M.: A hybrid metaheuristic strategy for covering with wireless devices. J. UCS 18(14), 1906\u20131932 (2012)","journal-title":"J. UCS"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17461-2_1","volume-title":"Combinatorial Optimization and Applications","author":"B Ballinger","year":"2010","unstructured":"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\u201315. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-17461-2_1"},{"issue":"4","key":"24_CR5","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1007\/s00453-014-9893-5","volume":"72","author":"L Barba","year":"2015","unstructured":"Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.I.: Space-time trade-offs for stack-based algorithms. Algorithmica 72(4), 1097\u20131129 (2015)","journal-title":"Algorithmica"},{"issue":"9","key":"24_CR6","first-page":"918","volume":"47","author":"L Barba","year":"2014","unstructured":"Barba, L., Korman, M., Langerman, S., Silveira, R.I.: Computing a visibility polygon using few variables. CGTA 47(9), 918\u2013926 (2014)","journal-title":"CGTA"},{"issue":"2","key":"24_CR7","first-page":"26","volume":"6","author":"TM Chan","year":"2010","unstructured":"Chan, T.M.: Comparison-based time-space lower bounds for selection. TALG 6(2), 26 (2010)","journal-title":"TALG"},{"issue":"1","key":"24_CR8","first-page":"79","volume":"37","author":"TM Chan","year":"2007","unstructured":"Chan, T.M., Chen, E.Y.: Multi-pass geometric algorithms. DCG 37(1), 79\u2013102 (2007)","journal-title":"DCG"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Munro, J.I., Raman, V.: Selection and sorting in the restore model. In: Proceedings of 25th SODA, pp. 995\u20131004. SIAM (2014)","DOI":"10.1137\/1.9781611973402.74"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11618058_7","volume-title":"Graph Drawing","author":"AM Dean","year":"2006","unstructured":"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\u201382. Springer, Heidelberg (2006). doi: 10.1007\/11618058_7"},{"issue":"6","key":"24_CR11","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/BF01901192","volume":"3","author":"JA Dean","year":"1988","unstructured":"Dean, J.A., Lingas, A., Sack, J.R.: Recognizing polygons, or how to spy. Vis. Comput. 3(6), 344\u2013355 (1988)","journal-title":"Vis. Comput."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Sitchinava, N.: Guard placement for efficient point in-polygon proofs. In: Proceedings of 23rd SoCG, pp. 27\u201336. ACM (2007)","DOI":"10.1145\/1247069.1247075"},{"key":"24_CR13","unstructured":"Fabila-Monroy, R., Vargas, A.R., Urrutia, J.: On modem illumination problems. In: Proceedings of 13th EGC (2009)"},{"issue":"1","key":"24_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00157","volume":"12","author":"S Felsner","year":"2008","unstructured":"Felsner, S., Massow, M.: Parameters of bar k-visibility graphs. JGAA 12(1), 5\u201327 (2008)","journal-title":"JGAA"},{"issue":"3","key":"24_CR15","first-page":"343","volume":"42","author":"R Fulek","year":"2009","unstructured":"Fulek, R., Holmsen, A.F., Pach, J.: Intersecting convex sets by rays. DCG 42(3), 343\u2013358 (2009)","journal-title":"DCG"},{"key":"24_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"2","key":"24_CR17","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1137\/050644240","volume":"21","author":"SG Hartke","year":"2007","unstructured":"Hartke, S.G., Vandenbussche, J., Wenger, P.: Further results on bar $$k$$ -visibility graphs. SIAM J. Discrete Math. 21(2), 523\u2013531 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"24_CR18","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BF01937271","volume":"27","author":"B Joe","year":"1987","unstructured":"Joe, B., Simpson, R.B.: Corrections to Lee\u2019s visibility polygon algorithm. BIT Numer. Math. 27(4), 458\u2013473 (1987)","journal-title":"BIT Numer. Math."},{"issue":"2","key":"24_CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"JI Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. TCS 165(2), 311\u2013323 (1996)","journal-title":"TCS"},{"issue":"1","key":"24_CR20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/2160649.2160670","volume":"43","author":"J O\u2019Rourke","year":"2012","unstructured":"O\u2019Rourke, J.: Computational geometry column 52. ACM SIGACT News 43(1), 82\u201385 (2012)","journal-title":"ACM SIGACT News"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:54:19Z","timestamp":1498373659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}