{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:53Z","timestamp":1725664733197},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_139","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:15Z","timestamp":1330292235000},"page":"284-295","source":"Crossref","is-referenced-by-count":1,"title":["Visibility with multiple reflections"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[]},{"given":"Alan R.","family":"Davis","sequence":"additional","affiliation":[]},{"given":"Tamal K.","family":"Dey","sequence":"additional","affiliation":[]},{"given":"Sudebkumar P.","family":"Pal","sequence":"additional","affiliation":[]},{"given":"D. Chithra","family":"Prasad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"B. Aronov, A. R. Davis, T. K. Dey, S. P. Pal, and D. C. Prasad. Visibility with reflection. Proc. 11th ACM Symp. Comput. Geom., 1995, pp. 316\u2013325.","key":"25_CR1","DOI":"10.1145\/220279.220313"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28:643\u2013647, 1979.","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"25_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02293040","volume":"8","author":"H. N. Djidjev","year":"1992","unstructured":"H. N. Djidjev, A. Lingas, and J. Sack. An O(n log n) algorithm for computing the link center of a simple polygon. Discr. Comput. Geom., 8(2):131\u2013152, 1992.","journal-title":"Discr. Comput. Geom."},{"key":"25_CR4","volume-title":"Introduction to Computer Graphics","author":"J. Foley","year":"1994","unstructured":"J. Foley, A. van Dam, S. Feiner, J. Hughes, and R. Phillips. Introduction to Computer Graphics. Addison-Wesley, Reading, MA 1994."},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02187784","volume":"5","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner, L. J. Guibas, and M. Sharir. The complexity and construction of many faces in arrangements of lines and of segments. Discr. Comput. Geom., 5:161\u2013196, 1990.","journal-title":"Discr. Comput. Geom."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H. ElGindy","year":"1981","unstructured":"H. ElGindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. J. Algorithms, 2:186\u2013197, 1981.","journal-title":"J. Algorithms"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0167-2789(86)90062-X","volume":"19","author":"E. Gutkin","year":"1986","unstructured":"E. Gutkin. Billiards in polygons. Physica D, 19:311\u2013333, 1986.","journal-title":"Physica D"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. J. Guibas","year":"1987","unstructured":"L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209\u2013233, 1987.","journal-title":"Algorithmica"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1215\/S0012-7094-49-01613-0","volume":"16","author":"A. Horn","year":"1949","unstructured":"A. Horn and F. Valentine. Some properties of l-sets in the plane. Duke Math. J., 16:131\u2013140, 1949.","journal-title":"Duke Math. J."},{"doi-asserted-by":"crossref","unstructured":"Y. Ke. An efficient algorithm for link-distance problems. Proc. 5th Annu. ACM Sympos. Comput. Geom., 1989, pp. 69\u201378.","key":"25_CR10","DOI":"10.1145\/73833.73841"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1080\/00029890.1969.12000169","volume":"76","author":"V. Klee","year":"1969","unstructured":"V. Klee. Is every polygonal region illuminable from some point? Amer. Math. Monthly, 76:180, 1969.","journal-title":"Amer. Math. Monthly"},{"doi-asserted-by":"crossref","unstructured":"V. Klee and S. Wagon. Old and new unsolved problems in plane geometry and number theory. Mathematical Association of America, 1991.","key":"25_CR12","DOI":"10.1090\/dol\/011"},{"key":"25_CR13","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O'Rourke","year":"1987","unstructured":"J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY 1987."},{"unstructured":"J. O'Rourke. Visibility. In The CRC Handbook of Discrete & Computational Geometry, Eds., J. E. Goodman and J. O'Rourke, CRC Press, to appear, 1997.","key":"25_CR14"},{"unstructured":"M. Pellegrini. Ray shooting and lines in space. In The CRC Handbook of Discrete & Computational Geometry, Eds., J. E. Goodman and J. O'Rourke, CRC Press, to appear, 1997.","key":"25_CR15"},{"issue":"9","key":"25_CR16","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T. C. Shermer","year":"1992","unstructured":"T. C. Shermer. Recent results in art galleries. Proc. IEEE, 80(9):1384\u20131399, 1992.","journal-title":"Proc. IEEE"},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/70.88124","volume":"6","author":"S. Suri","year":"1990","unstructured":"S. Suri. On some link distance problems in a simple polygon. IEEE Trans. Robot. Autom., 6:108\u2013113, 1990.","journal-title":"IEEE Trans. Robot. Autom"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1080\/00029890.1995.12004679","volume":"102","author":"G. W. Tokarsky","year":"1995","unstructured":"G. W. Tokarsky. Polygonal rooms not illuminable from every point. Amer. Math. Monthly, 102:867\u2013879, 1995.","journal-title":"Amer. Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_139.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T10:34:26Z","timestamp":1640946866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_139","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}