{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:02Z","timestamp":1725525362410},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_5","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"47-58","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Computing Diffuse Reflection Paths in Polygons"],"prefix":"10.1007","author":[{"given":"Subir Kumar","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Partha Pratim","family":"Goswami","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Subhas Chandra","family":"Nandy","sequence":"additional","affiliation":[]},{"given":"Sudebkumar Prasant","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Swami","family":"Sarvattomananda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/PL00009378","volume":"20","author":"B. Aronov","year":"1998","unstructured":"Aronov, B., Davis, A., Dey, T., Pal, S.P., Prasad, D.: Visibility with multiple reflections. Discrete & Computational Geometry\u00a020, 61\u201378 (1998)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/PL00009368","volume":"19","author":"B. Aronov","year":"1998","unstructured":"Aronov, B., Davis, A., Dey, T., Pal, S.P., Prasad, D.: Visibility with one reflection. Discrete & Computational Geometry\u00a019, 553\u2013574 (1998)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR3","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)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete & Computational Geometry\u00a06, 485\u2013524 (1991)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B. Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L.J., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica\u00a012, 54\u201368 (1994)","journal-title":"Algorithmica"},{"key":"5_CR6","volume-title":"Introduction to Computer Graphics","author":"J. Foley","year":"1994","unstructured":"Foley, J., van Dam, A., Feiner, S., Hughes, J., Phillips, R.: Introduction to Computer Graphics. Addison-Wesley, Reading (1994)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","volume":"12","author":"S.K. Ghosh","year":"1991","unstructured":"Ghosh, S.K.: Computing visibility polygon from a convex set and related problems. Journal of Algorithms\u00a012, 75\u201395 (1991)","journal-title":"Journal of Algorithms"},{"key":"5_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility algorithms in the plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility algorithms in the plane. Cambridge University Press, Cambridge (2007)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"S.K. Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility graphs. SIAM Journal on Computing\u00a020, 888\u2013910 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. Journal of Computer and System Science\u00a039, 126\u2013152 (1989)","journal-title":"Journal of Computer and System Science"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01553883","volume":"4","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the visibility graph of a polygon in time proportional to its size. Algorithmica\u00a04, 141\u2013155 (1989)","journal-title":"Algorithmica"},{"key":"5_CR12","doi-asserted-by":"publisher","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? American Mathematical Monthly\u00a076, 180 (1969)","journal-title":"American Mathematical Monthly"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D.T. Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks\u00a014, 393\u2013415 (1984)","journal-title":"Networks"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/BF01758855","volume":"8","author":"J.S.B. Mitchell","year":"1992","unstructured":"Mitchell, J.S.B., Rote, G., Woeginger, G.: Minimum-link paths among obstacles in the plane. Algorithmica\u00a08, 431\u2013459 (1992)","journal-title":"Algorithmica"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0925-7721(97)00011-4","volume":"10","author":"J. O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke, J., Streinu, I.: The vertex edge visibility graph of a polygon. Computational Geometry: Theory and Applications\u00a010, 105\u2013120 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00022-004-1726-2","volume":"81","author":"S.P. Pal","year":"2004","unstructured":"Pal, S.P., Brahma, S., Sarkar, D.: A linear worst-case lower bound on the number of holes in regions visible due to multiple diffuse reflections. Journal of Geometry\u00a081, 5\u201314 (2004)","journal-title":"Journal of Geometry"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0925-7721(97)00021-7","volume":"10","author":"D. Prasad","year":"1998","unstructured":"Prasad, D., Pal, S.P., Dey, T.: Visibility with multiple diffuse reflections. Computational Geometry: Theory and Applications\u00a010, 187\u2013196 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"867","DOI":"10.2307\/2975263","volume":"102","author":"G.T. Tokarsky","year":"1995","unstructured":"Tokarsky, G.T.: Polygonal rooms not illuminable from every point. American Mathematical Monthly\u00a0102, 867\u2013879 (1995)","journal-title":"American Mathematical Monthly"}],"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-642-00202-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T08:28:22Z","timestamp":1551774502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}