{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T11:50:40Z","timestamp":1673092240889},"reference-count":14,"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(98)00006-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:57:07Z","timestamp":1051127827000},"page":"171-186","source":"Crossref","is-referenced-by-count":1,"title":["Recognizing weakly convex visible polygons"],"prefix":"10.1016","volume":"10","author":[{"given":"Supriya","family":"Biswas","sequence":"first","affiliation":[]},{"given":"D.Chithra","family":"Prasad","sequence":"additional","affiliation":[]},{"given":"Sudebkumar Prasant","family":"Pal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(98)00006-6_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\/S0925-7721(98)00006-6_BIB2","series-title":"Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"181","article-title":"Algorithms for convex visibility problems","volume":"880","author":"Biswas","year":"1994"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB3","series-title":"Proceedings of the ACM Symposium on Computational Geometry","first-page":"259","article-title":"Optimal linear-time algorithm for shortest illuminating line segment in a polygon","author":"Das","year":"1994"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB4","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":"El Gindy","year":"1981","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S0925-7721(98)00006-6_BIB5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0925-7721(93)90010-4","article-title":"Characterizing and recognizing weak visibility polygons","volume":"3","author":"Ghosh","year":"1993","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF01910634","article-title":"An algorithm for recognizing palm polygons","volume":"10","author":"Ghosh","year":"1994","journal-title":"The Visual Computer"},{"key":"10.1016\/S0925-7721(98)00006-6_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(98)00006-6_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01553883","article-title":"An optimal visibility graph algorithm for triangulated simple polygons","volume":"4","author":"Hershberger","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB9","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BF01937271","article-title":"Correction to Lee's visibility algorithm","volume":"27","author":"Joe","year":"1987","journal-title":"BIT"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB10","article-title":"Detecting weak visibility of simple polygons and related problems","author":"Ke","year":"1988"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB11","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(98)00006-6_BIB12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","article-title":"An optimal algorithm for computing the kernel of a polygon","volume":"26","author":"Lee","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB13","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0925-7721(98)00006-6_BIB14","first-page":"1384","article-title":"Recent results in art galleries","volume":"80","author":"Shermer","year":"1992"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772198000066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772198000066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T01:55:48Z","timestamp":1556675748000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772198000066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0925772198000066"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(98)00006-6","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}