{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T20:27:38Z","timestamp":1674073658310},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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,4]]},"DOI":"10.1016\/0020-0190(92)90133-g","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"55-60","source":"Crossref","is-referenced-by-count":14,"title":["Optimal time bounds for some proximity problems in the plane"],"prefix":"10.1016","volume":"42","author":[{"given":"Alok","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Edelsbrunner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prahakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasoon","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90133-G_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(92)90133-G_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix searching algorithm","volume":"2","author":"Aggarwal","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(92)90133-G_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-51542-9_11","article-title":"computing the minimum visible vertex distance between two polygons","author":"Aggarwal","year":"1989","journal-title":"Proc. Workshop on Algorithms and Data Structures"},{"key":"10.1016\/0020-0190(92)90133-G_BIB4","first-page":"80","article-title":"Lower bounds for algebraic decision trees","author":"Ben-Or","year":"1983","journal-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90133-G_BIB5","first-page":"220","article-title":"Divide-and-conquer in multidimensional space","author":"Bentley","year":"1976","journal-title":"Proc. 8th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90133-G_BIB6","first-page":"215","article-title":"Constrained Delaunay Triangulations","author":"Chew","year":"1987","journal-title":"Proc. 3rd Ann. ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(92)90133-G_BIB7","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0020-0190(92)90133-G_BIB8","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","article-title":"Finding the convex hull of a simple polygon","volume":"4","author":"Graham","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(92)90133-G_BIB9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","article-title":"Generalized Delaunay triangulations of planar graphs","volume":"1","author":"Lee","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(92)90133-G_BIB10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(78)90066-2","article-title":"The all nearest-neighbor problem for convex polygons","volume":"7","author":"Lee","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90133-G_BIB11","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","article-title":"Computational geometry - a survey","volume":"33","author":"Lee","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(92)90133-G_BIB12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(79)90069-3","article-title":"A linear algorithm for finding the convex hull of a simple polygon","volume":"9","author":"McCallum","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90133-G_BIB13","series-title":"Computational Geometry \u2014 An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(92)90133-G_BIB14","first-page":"319","article-title":"A method for proving lower bounds for certain geometry problems","author":"Seidel","year":"1985"},{"key":"10.1016\/0020-0190(92)90133-G_BIB15","series-title":"Ph.D. Thesis","article-title":"Computational Geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0020-0190(92)90133-G_BIB16","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1989.63495","article-title":"Lower bounds for algebraic computation trees with integer inputs","author":"Yao","year":"1989","journal-title":"Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290133G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290133G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:59Z","timestamp":1555129619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290133G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002001909290133G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90133-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}