{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:26:07Z","timestamp":1780370767754,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"vor","delay-in-days":5540,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0022-0000(89)90044-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"205-219","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":163,"title":["There are planar graphs almost as good as the complete graph"],"prefix":"10.1016","volume":"39","author":[{"given":"L.","family":"Paul Chew","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90044-5_BIB1","series-title":"Proceedings, 26th IEEE Symposium on Foundations of Computer Science","first-page":"155","article-title":"Visibility-polygon search and Euclidean shortest paths","author":"Asano","year":"1985"},{"key":"10.1016\/0022-0000(89)90044-5_BIB2","series-title":"Proceedings, Ist Symposium on Computational Geometry","first-page":"235","article-title":"Voronoi diagrams based on convex distance functions","author":"Chew","year":"1985"},{"key":"10.1016\/0022-0000(89)90044-5_BIB3","series-title":"Proceedings, Second Annual Symposium on Computational Geometry","first-page":"169","article-title":"There is a planar graph almost as good as the complete graph","author":"Chew","year":"1986"},{"key":"10.1016\/0022-0000(89)90044-5_BIB4_1","series-title":"Proceedings, Third Annual Symposium on Computational Geometry","first-page":"215","article-title":"Constrained Delaunay triangulations","author":"Chew","year":"1987"},{"key":"10.1016\/0022-0000(89)90044-5_BIB4_2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"Chew","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(89)90044-5_BIB5","unstructured":"L. P. CHEW, Planar graphs and sparse graphs for efficient motion planning in the plane, manuscript."},{"key":"10.1016\/0022-0000(89)90044-5_BIB6","series-title":"Proceedings, 28th IEEE Symposium on Foundations of Computer Science","first-page":"20","article-title":"Delaunay graphs are almost as good as complete graphs","author":"Dobkin","year":"1987"},{"key":"10.1016\/0022-0000(89)90044-5_BIB7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(89)90044-5_BIB8","article-title":"Proximity and Reachibility in the Plane","author":"Lee","year":"1978"},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90044-5_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","article-title":"Two algorithms for constructing Delaunay triangulations","volume":"9","author":"Lee","year":"1980","journal-title":"Internal. J. Comput. Inform. Sci."},{"key":"10.1016\/0022-0000(89)90044-5_BIB10","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0022-0000(89)90044-5_BIB11","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."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900445?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900445?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:55Z","timestamp":1757095855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0022000089900445"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90044-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"There are planar graphs almost as good as the complete graph","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(89)90044-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}