{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:19:02Z","timestamp":1648851542767},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90033-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"257-261","source":"Crossref","is-referenced-by-count":6,"title":["Computing the full visibility graph of a set of line segments"],"prefix":"10.1016","volume":"42","author":[{"given":"S.K.","family":"Wismath","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90033-R_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","article-title":"Visibility of disjoint polygons","volume":"1","author":"Asano","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(92)90033-R_BIB2","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":"Davis","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(92)90033-R_BIB3","first-page":"323","article-title":"An optimal parallel algorithm for the vertical segment visibility reporting problem","volume":"497","author":"Chan","year":"1991"},{"key":"10.1016\/0020-0190(92)90033-R_BIB4","first-page":"11","article-title":"An output sensitive algorithm for computing visibility graphs","author":"Ghosh","year":"1987","journal-title":"Proc. of the IEEE Foundations of Computer Science"},{"issue":"5","key":"10.1016\/0020-0190(92)90033-R_BIB5","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","article-title":"An output sensitive algorithm for computing visibility graphs","volume":"20","author":"Ghosh","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90033-R_BIB6","author":"O'Rourke","year":"1987"},{"key":"10.1016\/0020-0190(92)90033-R_BIB7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(92)90033-R_BIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-8655(86)90015-2","article-title":"Shortest path solves edge-to-edge visibility in a polygon","volume":"4","author":"Toussaint","year":"1986","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0020-0190(92)90033-R_BIB9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","article-title":"Constructing the visibility graph for n-line segments in O(n2) time","volume":"20","author":"Welzl","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90033-R_BIB10","first-page":"147","article-title":"Characterizing bar line-of-sight graphs","author":"Wismath","year":"1985","journal-title":"Proc. 1st ACM Symp. on Computational Geometry"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290033R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290033R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:43Z","timestamp":1555144063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290033R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290033R"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90033-r","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}