{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:30Z","timestamp":1760439990754},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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":[[1997,1]]},"DOI":"10.1016\/0925-7721(95)00042-9","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"37-57","source":"Crossref","is-referenced-by-count":32,"title":["LR-visibility in polygons"],"prefix":"10.1016","volume":"7","author":[{"given":"Gautam","family":"Das","sequence":"first","affiliation":[]},{"given":"Paul J.","family":"Heffernan","sequence":"additional","affiliation":[]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00042-9_BIB1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","article-title":"An optimal algorithm for determining the visibility of a polygon from an edge","volume":"30","author":"Avis","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(95)00042-9_BIB2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00042-9_BIB3","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"63","article-title":"An optimal parallel algorithm for detecting weak visibility of a simple polygon","author":"Chen","year":"1992"},{"key":"10.1016\/0925-7721(95)00042-9_BIB16","unstructured":"to appear in Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0925-7721(95)00042-9_BIB4","article-title":"Optimally computing the shortest weakly visible subedge of a simple polygon","author":"Chen","year":"1992"},{"key":"10.1016\/0925-7721(95)00042-9_BIB5","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","article-title":"Visibility and intersection problems in plane geometry","volume":"4","author":"Chazelle","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00042-9_BIB6","series-title":"Finding all weakly-visible chords of a polygon in linear time","author":"Das","year":"1993"},{"key":"10.1016\/0925-7721(95)00042-9_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jagm.1993.1007","article-title":"An algorithm for determining internal line visibility of a simple polygon","volume":"14","author":"Doh","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00042-9_BIB8","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\/0925-7721(95)00042-9_BIB9","series-title":"Proc. 9th ACM Symp. Comput. Geom.","first-page":"348","article-title":"An optimal algorithm for the two-guard problem","author":"Heffernan","year":"1993"},{"key":"10.1016\/0925-7721(95)00042-9_BIB17","unstructured":"to appear in Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0925-7721(95)00042-9_BIB10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1142\/S0218195992000160","article-title":"The two guards problem","volume":"2","author":"Icking","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0925-7721(95)00042-9_BIB11","series-title":"Tech. Report","article-title":"Detecting the weak visibility of a simple polygon and related problems","author":"Ke","year":"1987"},{"key":"10.1016\/0925-7721(95)00042-9_BIB12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","article-title":"An optimal algorithm for finding the kernel of a polygon","volume":"26","author":"Lee","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0925-7721(95)00042-9_BIB13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"CACM"},{"key":"10.1016\/0925-7721(95)00042-9_BIB14","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/12.59852","article-title":"An optimal algorithm for detecting weak visibility","volume":"39","author":"Sack","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(95)00042-9_BIB15","series-title":"Two-guard walkability of simple polygons","author":"Tseng","year":"1993"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000429?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000429?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:03Z","timestamp":1555212303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["0925772195000429"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00042-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}