{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:44:41Z","timestamp":1648986281073},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/0925-7721(95)00032-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"149-160","source":"Crossref","is-referenced-by-count":1,"title":["Finding a shortest diagonal of a simple polygon in linear time"],"prefix":"10.1016","volume":"7","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00032-1_BIB1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(92)90133-G","article-title":"Optimal time bounds for some proximity problems in the plane","volume":"42","author":"Aggarwal","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/0925-7721(95)00032-1_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 and Computational Geometry"},{"key":"10.1016\/0925-7721(95)00032-1_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\/0925-7721(95)00032-1_BIB4","series-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","first-page":"485","article-title":"Matrix searching with the shortest path metric","author":"Hershberger","year":"1993"},{"key":"10.1016\/0925-7721(95)00032-1_BIB5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(89)90043-4","article-title":"Voronoi diagrams with barriers and the shortest diagonal problem","volume":"32","author":"Lingas","year":"1989","journal-title":"Information Processing Letters"},{"key":"10.1016\/0925-7721(95)00032-1_BIB6","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\/0925-7721(95)00032-1_BIB7","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(95)00032-1_BIB8","article-title":"Minimum link paths in polygons and related problems","author":"Suri","year":"1987"},{"key":"10.1016\/0925-7721(95)00032-1_BIB9","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/70.88124","article-title":"On some link distance problems in a simple polygon","volume":"6","author":"Suri","year":"1990","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"10.1016\/0925-7721(95)00032-1_BIB10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(92)90227-M","article-title":"Computing the shortest diagonal of a monotone polygon in linear time","volume":"42","author":"Zhu","year":"1992","journal-title":"Information Processing Letters"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:25:11Z","timestamp":1555197911000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["0925772195000321"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00032-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}