{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:18:49Z","timestamp":1648700329815},"reference-count":8,"publisher":"Elsevier BV","issue":"6","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)90227-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"303-307","source":"Crossref","is-referenced-by-count":1,"title":["Computing the shortest diagonal of a monotone polygon in linear time"],"prefix":"10.1016","volume":"42","author":[{"given":"Binhai","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90227-M_BIB1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02187749","article-title":"A linear-time algorithm for computing the Voronoi Diagram of a convex polygon","volume":"4","author":"Aggarwal","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(92)90227-M_BIB2","first-page":"285","article-title":"Geometric application of a matrix searching algorithm","author":"Aggarwal","year":"1986","journal-title":"Proc. 2nd ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(92)90227-M_BIB3","series-title":"Proc. 1st Workshop on Algorithms and Data Structure","first-page":"115","article-title":"Computing the minimum visible vertex distance between two polygons","author":"Aggarwal","year":"1989"},{"key":"10.1016\/0020-0190(92)90227-M_BIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/357337.357341","article-title":"Triangulating simple polygons and equivalent problems","author":"Fournier","year":"1984","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0020-0190(92)90227-M_BIB5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/58395.58397","article-title":"Computational geometry column 4","volume":"19","author":"O'Rourke","year":"1988","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(92)90227-M_BIB6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/70640.70641","article-title":"Computational geometry column 6","volume":"20","author":"O'Rourke","year":"1989","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(92)90227-M_BIB7","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/74074.74081","article-title":"Computational geometry column 8","volume":"20","author":"O'Rourke","year":"1989","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(92)90227-M_BIB8","series-title":"Tech. Rept. CS-90-8","article-title":"A linear time algorithm to find the shortest diagonal of a unimonotone polygon","author":"Zhu","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290227M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290227M?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:56Z","timestamp":1555144076000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290227M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290227M"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90227-m","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}