{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:30:25Z","timestamp":1648942225728},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00235-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"113-121","source":"Crossref","is-referenced-by-count":1,"title":["Finding the shortest boundary guard of a simple polygon"],"prefix":"10.1016","volume":"263","author":[{"given":"Bor-Kuan","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Rong","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00235-8_BIB1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01377183","article-title":"Ray shooting in polygons using geodesic triangulations","volume":"12","author":"Chazelle","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00235-8_BIB2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1006\/jagm.1996.0023","article-title":"Optimally computing the shortest weakly visible subedge of a simple polygon","volume":"20","author":"Chen","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00235-8_BIB3","doi-asserted-by":"crossref","unstructured":"G. Das, P.J. Heffernan, Optimal linear-time algorithm for the shortest illuminating line segment in a polygon, Proc. 10th Ann. ACM Symp. on Computational Geometry, 1994, pp. 259\u2013268.","DOI":"10.1145\/177424.177984"},{"issue":"4","key":"10.1016\/S0304-3975(00)00235-8_BIB4","first-page":"433","article-title":"Finding all weakly-visible chords of a polygon in linear time","volume":"1","author":"Das","year":"1994","journal-title":"Nord. J. Comput."},{"key":"10.1016\/S0304-3975(00)00235-8_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jagm.1993.1007","article-title":"An algorithm for determing visibility of a simple polygon from an internal line segment","volume":"14","author":"Doh","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00235-8_BIB6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, P. Mucke, Simulation of simplicity: a technique to cope with degenerte cases in geometric algorithms, Proc. 4th Ann. Symp. Computational Geometry, 1988, pp. 118\u2013133.","DOI":"10.1145\/73393.73406"},{"key":"10.1016\/S0304-3975(00)00235-8_BIB7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1006\/jagm.1995.1017","article-title":"A pedestrian approach to ray shooting: shoot a ray, take a walk","volume":"18","author":"Hershberger","year":"1995","journal-title":"J. Algorithm"},{"key":"10.1016\/S0304-3975(00)00235-8_BIB8","unstructured":"Y. Ke, Detecting the weak visibility of a simple polygon and related problems, Tech. Rep., Department of Computer Science, The Johns Hopkins University, Baltimore, MD, 1987."},{"key":"10.1016\/S0304-3975(00)00235-8_BIB9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","article-title":"An optimal algorithm for finding the kernel of polygon","volume":"26","author":"Lee","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00235-8_BIB10","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"issue":"10","key":"10.1016\/S0304-3975(00)00235-8_BIB11","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/12.59852","article-title":"An optimal algorithm for detecting weak visibility of a polygon","volume":"39","author":"Sack","year":"1990","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0304-3975(00)00235-8_BIB12","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1142\/S021819599500026X","article-title":"Efficient algorithms for solving diagonal visibility problems in a simple polygon","volume":"5","author":"Shin","year":"1995","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"10.1016\/S0304-3975(00)00235-8_BIB13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/70.88040","article-title":"An optimal algorithm for finding all visible edges in a simple polygon","volume":"5","author":"Shin","year":"1989","journal-title":"IEEE Trans. Robotics Automat."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002358?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002358?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T06:21:34Z","timestamp":1556778094000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002358"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00235-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}