{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:33Z","timestamp":1759063653484},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0925-7721(97)00021-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:57:07Z","timestamp":1051127827000},"page":"187-196","source":"Crossref","is-referenced-by-count":9,"title":["Visibility with multiple diffuse reflections"],"prefix":"10.1016","volume":"10","author":[{"given":"D.Chithra","family":"Prasad","sequence":"first","affiliation":[]},{"given":"Sudebkumar P.","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Tamal K.","family":"Dey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00021-7_BIB1","series-title":"Proceedings of the Eleventh Annual ACM Symposium on Computational Geometry","first-page":"316","article-title":"Visibility with reflection","author":"Aronov","year":"1995"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB2","series-title":"Proceedings of the Scandinavian Workshop on Algorithm Theory","first-page":"284","article-title":"Visibility with multiple reflections","volume":"1097","author":"Aronov","year":"1996"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for counting and reporting geometric intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0925-7721(97)00021-7_BIB4","series-title":"Proceedings of Sixth Symposium on Theoretical Aspects of Computer Science","first-page":"96","article-title":"An o(nlogn) algorithm for computing a link center in a simple polygon","volume":"349","author":"Djidjev","year":"1989"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","article-title":"A linear algorithm for computing the visibility polygon from a point","volume":"2","author":"ElGindy","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","article-title":"Computing the visibility polygon from a convex set and related problems","volume":"12","author":"Ghosh","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB8","series-title":"Proceedings of the Fifth Annual ACM Symposium on Computational Geometry","first-page":"69","article-title":"An efficient algorithm for link distance problems","author":"Ke","year":"1989"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","article-title":"Visibility of a simple polygon","volume":"22","author":"Lee","year":"1983","journal-title":"Comput. Vision Graphics Image Processing"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(86)90044-7","article-title":"Computing the visibility polygon from an edge","volume":"34","author":"Lee","year":"1986","journal-title":"Comput. Vision Graphics Image Processing"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02187913","article-title":"Computing the link center of a simple polygon","volume":"3","author":"Lenhart","year":"1988","journal-title":"Discrete Comput. Geom."},{"year":"1987","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","key":"10.1016\/S0925-7721(97)00021-7_BIB12"},{"article-title":"New visibility problems: Combinatorial and computational complexities","year":"1996","author":"Prasad","key":"10.1016\/S0925-7721(97)00021-7_BIB13"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB14","first-page":"1384","article-title":"Recent results in art galleries","volume":"80","author":"Shermer","year":"1992"},{"key":"10.1016\/S0925-7721(97)00021-7_BIB15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","article-title":"A linear time algorithm for minimum link paths inside a simple polygon","volume":"35","author":"Suri","year":"1986","journal-title":"Comput. Vision Graphics Image Processing"},{"article-title":"Minimum link paths in polygons and related problems","year":"1987","author":"Suri","key":"10.1016\/S0925-7721(97)00021-7_BIB16"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:25:51Z","timestamp":1555212351000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0925772197000217"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00021-7","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}