{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:53:23Z","timestamp":1649195603692},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0020-0190(94)00220-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"359-365","source":"Crossref","is-referenced-by-count":2,"title":["An optimal algorithm for finding the edge visibility polygon under limited visibility"],"prefix":"10.1016","volume":"53","author":[{"given":"Sung-Ho","family":"Kim","sequence":"first","affiliation":[]},{"given":"Jung-Heum","family":"Park","sequence":"additional","affiliation":[]},{"given":"Seung-Hak","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Sung Yong","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00220-S_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\/0020-0190(94)00220-S_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\/0020-0190(94)00220-S_BIB3","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\/0020-0190(94)00220-S_BIB4","series-title":"Algorithms and correctness proofs for visibility polygon computations","author":"Joe","year":"1987"},{"key":"10.1016\/0020-0190(94)00220-S_BIB5","article-title":"Visibility algorithms under distance constraint","author":"Kim","year":"1994"},{"key":"10.1016\/0020-0190(94)00220-S_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0925-7721(92)90014-J","article-title":"Watchman routes under limited visibility","volume":"1","author":"Ntafos","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0020-0190(94)00220-S_BIB7","article-title":"Computational Geometry","author":"Shin","year":"1987"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400220S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400220S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:18Z","timestamp":1555297098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400220S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["002001909400220S"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00220-s","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}