{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:33:50Z","timestamp":1678667630478},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T00:00:00Z","timestamp":1437091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s00453-015-0031-9","type":"journal-article","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T15:04:33Z","timestamp":1437059073000},"page":"910-931","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Diffuse Reflection Radius in a Simple Polygon"],"prefix":"10.1007","volume":"76","author":[{"given":"Eli","family":"Fox-Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,17]]},"reference":[{"key":"31_CR1","unstructured":"Aanjaneya, M., Bishnu, A., Pal, P.S.: Directly visible pairs and illumination by reflections in orthogonal polygons. In: 24th European Workshop on Computational Geometry, pp. 241\u2013244 (2008)"},{"key":"31_CR2","unstructured":"Ahn, H.K., Barba, L., Bose, P., de\u00a0Carufel, J.L., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon (2015). arXiv:1501.0056"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Aronov, B., Davis, A.R., Iacono, J., Yu, A.S.C.: The complexity of diffuse reflections in a simple polygon. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006: Theoretical Informatics, pp. 93\u2013104. Springer (2006)","DOI":"10.1007\/11682462_13"},{"issue":"4","key":"31_CR4","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s00454-001-0089-9","volume":"27","author":"B Aronov","year":"2002","unstructured":"Aronov, B., Guibas, L.J., Teichmann, M., Zhang, L.: Visibility queries and maintenance in simple polygons. Discrete Comput. Geom. 27(4), 461\u2013483 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"31_CR5","unstructured":"Asano, T., Toussaint, G.T.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University (1985)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Korman, M., Okamoto, Y., Wang, H.: Computing the $${L}_1$$ L 1 geodesic diameter and center of a simple polygon in linear time. In: Pardo, A., Viola, A. (eds.) LATIN 2014: Theoretical Informatics, pp. 120\u2013131. Springer (2014)","DOI":"10.1007\/978-3-642-54423-1_11"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.endm.2013.10.054","volume":"44","author":"G Barequet","year":"2013","unstructured":"Barequet, G., Cannon, S.M., Fox-Epstein, E., Hescott, B., Souvaine, D.L., T\u00f3th, C.D., Winslow, A.: Diffuse reflections in simple polygons. Electron. Notes Discrete Math. 44, 345\u2013350 (2013)","journal-title":"Electron. Notes Discrete Math."},{"key":"31_CR8","unstructured":"Bishnu, A., Ghosh, S.K., Goswami, P.P., Pal, S.P., Sarvattomananda, S.: An algorithm for computing constrained reflection paths in simple polygon. arXiv preprint arXiv:1304.4320 (2013)"},{"issue":"3","key":"31_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0925-7721(01)00070-0","volume":"23","author":"P Bose","year":"2002","unstructured":"Bose, P., Lubiw, A., Munro, J.I.: Efficient visibility queries in simple polygons. Comput. Geom. 23(3), 313\u2013335 (2002)","journal-title":"Comput. Geom."},{"issue":"1\u20132","key":"31_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00022-004-1726-2","volume":"81","author":"S Brahma","year":"2004","unstructured":"Brahma, S., Pal, S.P., Sarkar, D.: A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections. J. Geom. 81(1\u20132), 5\u201314 (2004)","journal-title":"J. Geom."},{"issue":"3","key":"31_CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF00147365","volume":"60","author":"M Breen","year":"1996","unstructured":"Breen, M.: A Helly-type theorem for simple polygons. Geom. Dedic. 60(3), 283\u2013288 (1996)","journal-title":"Geom. Dedic."},{"issue":"2","key":"31_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1005003212822","volume":"71","author":"M Breen","year":"1998","unstructured":"Breen, M.: A Helly-type theorem for intersections of compact connected sets in the plane. Geom. Dedic. 71(2), 111\u2013117 (1998)","journal-title":"Geom. Dedic."},{"issue":"5","key":"31_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0020-0190(97)00211-1","volume":"65","author":"DZ Chen","year":"1998","unstructured":"Chen, D.Z., Daescu, O.: Maintaining visibility of a polygon with a moving point of view. Inf. Process. Lett. 65(5), 269\u2013275 (1998)","journal-title":"Inf. Process. Lett."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Wang, H.: Weak visibility queries of line segments in simple polygons. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) Algorithms and Computation, pp. 609\u2013618. Springer (2012)","DOI":"10.1007\/978-3-642-35261-4_63"},{"issue":"04","key":"31_CR15","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1142\/S0218195905001762","volume":"15","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M., Whitesides, S.: Separating point sets in polygonal environments. Int. J. Comput. Geom. Appl. 15(04), 403\u2013419 (2005)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"31_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02293040","volume":"8","author":"HN Djidjev","year":"1992","unstructured":"Djidjev, H.N., Lingas, A., Sack, J.: An $${O}(n \\log n)$$ O ( n log n ) algorithm for computing the link center of a simple polygon. Discrete Comput. Geom. 8(1), 131\u2013152 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"31_CR17","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, Cambridge (2007)"},{"issue":"12","key":"31_CR18","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s00371-011-0670-z","volume":"28","author":"SK Ghosh","year":"2012","unstructured":"Ghosh, S.K., Goswami, P.P., Maheshwari, A., Nandy, S.C., Pal, S.P., Sarvattomananda, S.: Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. 28(12), 1229\u20131237 (2012)","journal-title":"Vis. Comput."},{"issue":"1\u20134","key":"31_CR19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1\u20134), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. In: Proceedings of the Third Annual Symposium on Computational Geometry, pp. 50\u201363. ACM (1987)","DOI":"10.1145\/41958.41964"},{"issue":"3","key":"31_CR21","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms 18(3), 403\u2013431 (1995)","journal-title":"J. Algorithms"},{"issue":"6","key":"31_CR22","doi-asserted-by":"crossref","first-page":"1612","DOI":"10.1137\/S0097539793253577","volume":"26","author":"J Hershberger","year":"1997","unstructured":"Hershberger, J., Suri, S.: Matrix searching with the shortest-path metric. SIAM J. Comput. 26(6), 1612\u20131634 (1997)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"31_CR23","doi-asserted-by":"crossref","first-page":"1496","DOI":"10.1016\/j.dam.2012.12.020","volume":"161","author":"A Khan","year":"2013","unstructured":"Khan, A., Pal, S.P., Aanjaneya, M., Bishnu, A., Nandy, S.C.: Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discrete Appl. Math. 161(10), 1496\u20131505 (2013)","journal-title":"Discrete Appl. Math."},{"key":"31_CR24","doi-asserted-by":"crossref","first-page":"180","DOI":"10.2307\/2317271","volume":"76","author":"V Klee","year":"1969","unstructured":"Klee, V.: Is every polygonal region illuminable from some point? Am. Math. Mon. 76, 180 (1969)","journal-title":"Am. Math. Mon."},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Klee, V.: Some unsolved problems in plane geometry. Math. Mag. 52, 131\u2013145 (1979)","DOI":"10.2307\/2690274"},{"issue":"3","key":"31_CR26","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"D Lee","year":"1979","unstructured":"Lee, D., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. J. ACM (JACM) 26(3), 415\u2013421 (1979)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"31_CR27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02187913","volume":"3","author":"W Lenhart","year":"1988","unstructured":"Lenhart, W., Pollack, R., Sack, J., Seidel, R., Sharir, M., Suri, S., Toussaint, G., Whitesides, S., Yap, C.: Computing the link center of a simple polygon. Discrete Comput. Geom. 3(1), 281\u2013293 (1988)","journal-title":"Discrete Comput. Geom."},{"key":"31_CR28","volume-title":"Handbook of Computational Geometry, Chap. 12","author":"A Maheshwari","year":"1999","unstructured":"Maheshwari, A., Sack, J., Djidjev, H.N.: Link distance problems. In: Sack, J., Urrutia, J. (eds.) Handbook of Computational Geometry, Chap. 12. Elsevier, Amsterdam (1999)"},{"key":"31_CR29","first-page":"108","volume":"8","author":"J Moln\u00e1r","year":"1957","unstructured":"Moln\u00e1r, J.: \u00dcber den zweidimensionalen topologischen Satz von Helly. Mat. Lapok 8, 108\u2013114 (1957)","journal-title":"Mat. Lapok"},{"issue":"1","key":"31_CR30","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BF02187751","volume":"4","author":"R Pollack","year":"1989","unstructured":"Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(1), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"31_CR31","doi-asserted-by":"crossref","unstructured":"Schuierer, S.: Computing the $$l_1$$ l 1 -diameter and center of a simple rectilinear polygon. In: Proceedings of the International Conference on Computing and Information (ICCI), pp. 214\u2013229 (1994)","DOI":"10.1007\/3-540-58218-5_30"},{"issue":"1","key":"31_CR32","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","volume":"35","author":"S Suri","year":"1986","unstructured":"Suri, S.: A linear time algorithm for minimum link paths inside a simple polygon. Comput. Vis. Graph. Image Process. 35(1), 99\u2013110 (1986)","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"1","key":"31_CR33","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/70.88124","volume":"6","author":"S Suri","year":"1990","unstructured":"Suri, S.: On some link distance problems in a simple polygon. IEEE Trans. Robot. Autom. 6(1), 108\u2013113 (1990)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"31_CR34","doi-asserted-by":"crossref","unstructured":"Tokarsky, G.W.: Polygonal rooms not illuminable from every point. Am. Math. Mon. 102, 867\u2013879 (1995)","DOI":"10.2307\/2975263"},{"key":"31_CR35","unstructured":"Toussaint, G.T.: An optimal algorithm for computing the relative convex hull of a set of points in a polygon. Signal Processing III: Theories and Applications (EURASIP-86) pp. 853\u2013856 (1986)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0031-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0031-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0031-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0031-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T09:13:38Z","timestamp":1566983618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0031-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,17]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["31"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0031-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,17]]}}}