{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:51Z","timestamp":1725796611069},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_21","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"239-250","source":"Crossref","is-referenced-by-count":0,"title":["Diffuse Reflection Radius in a Simple Polygon"],"prefix":"10.1007","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","reference":[{"key":"21_CR1","unstructured":"Aanjaneya, M., Bishnu, A., Pal, S.P.: Directly visible pairs and illumination by reflections in orthogonal polygons. In: Abstracts of 24th European Workshop on Comput. Geom., pp. 241\u2013244 (2008)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/11682462_13","volume-title":"LATIN 2006: Theoretical Informatics","author":"B. Aronov","year":"2006","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. LNCS, vol.\u00a03887, pp. 93\u2013104. Springer, Heidelberg (2006)"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","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.\u00a027(4), 461\u2013483 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","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. Geometry Theory Appl.\u00a023(3), 313\u2013335 (2002)","journal-title":"Comput. Geometry Theory Appl."},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/978-3-642-54423-1_11","volume-title":"LATIN 2014: Theoretical Informatics","author":"S.W. Bae","year":"2014","unstructured":"Bae, S.W., Korman, M., Okamoto, Y., Wang, H.: Computing the L\n                  1 Geodesic diameter and center of a simple polygon in linear time. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol.\u00a08392, pp. 120\u2013131. Springer, Heidelberg (2014)"},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","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. Electronic Notes in Discrete Math.\u00a044(5), 345\u2013350 (2013)","journal-title":"Electronic Notes in Discrete Math."},{"issue":"1-2","key":"21_CR7","doi-asserted-by":"publisher","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 in regions visible due to multiple diffuse reflections. J.\u00a0of Geometry\u00a081(1-2), 5\u201314 (2004)","journal-title":"J.\u00a0of Geometry"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00147365","volume":"60","author":"M. Breen","year":"1996","unstructured":"Breen, M.: A Helly-type theorem for simple polygons. Geometriae Dedicata\u00a060(3), 283\u2013288 (1996)","journal-title":"Geometriae Dedicata"},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0020-0190(97)00211-1","volume":"65","author":"D.Z. Chen","year":"1998","unstructured":"Chen, D.Z., Daescu, O.: Maintaining visibility of a polygon with a moving point of view. Information Processing Letters\u00a065(5), 269\u2013275 (1998)","journal-title":"Information Processing Letters"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-35261-4_63","volume-title":"Algorithms and Computation","author":"D.Z. Chen","year":"2012","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.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 609\u2013618. Springer, Heidelberg (2012)"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1142\/S0218195905001762","volume":"15","author":"E.D. 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. Intl. J. Comput. Geom. Appl.\u00a015(4), 403\u2013419 (2005)","journal-title":"Intl. J. Comput. Geom. Appl."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02293040","volume":"8","author":"H.N. Djidjev","year":"1992","unstructured":"Djidjev, H.N., Lingas, A., Sack, J.-R.: An O(n logn) algorithm for computing the link center of a simple polygon. Discrete. Comput. Geom.\u00a08, 131\u2013152 (1992)","journal-title":"Discrete. Comput. Geom."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility algorithms in the plane, ch. 7. Cambridge Univ. Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"issue":"1-4","key":"21_CR14","doi-asserted-by":"publisher","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\u00a02(1-4), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"6","key":"21_CR15","doi-asserted-by":"publisher","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.\u00a026(6), 1612\u20131634 (1997)","journal-title":"SIAM J. Comput."},{"key":"21_CR16","first-page":"415","volume":"26","author":"D.T. Lee","year":"1979","unstructured":"Lee, D.T., Preparata, F.: An optimal algorithm for finding the kernel of a polygon. J.\u00a0ACM\u00a026, 415\u2013421 (1979)","journal-title":"J.\u00a0ACM"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Sack, J., Djidjev, H.N.: Link distance problems. In: Handbook of Computational Geometry, ch.12. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50013-9"},{"key":"21_CR18","doi-asserted-by":"publisher","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.\u00a04, 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Schuierer, S.: Computing the L\n                  1-diameter and center of a simple rectilinear polygon. In: Proc. Intl. Conf. on Computing and Information (ICCI), pp. 214\u2013229 (1994)","DOI":"10.1007\/3-540-58218-5_30"},{"key":"21_CR20","doi-asserted-by":"publisher","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. Vision. Graph. Image Process.\u00a035, 99\u2013110 (1986)","journal-title":"Comput. Vision. Graph. Image Process."},{"key":"21_CR21","doi-asserted-by":"publisher","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.\u00a06, 108\u2013113 (1990)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"21_CR22","unstructured":"Toussaint, G.T.: An optimal algorithm for computing the relative convex hull of a set of points in a polygon. In: Signal Processing III: Theories and Applications (EURASIP 1986), Part 2, pp. 853\u2013856 (1986)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:45:01Z","timestamp":1558939501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}