{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T12:49:39Z","timestamp":1676638179359},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00431-0","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T12:35:20Z","timestamp":1045053320000},"page":"47-58","source":"Crossref","is-referenced-by-count":12,"title":["Computing farthest neighbors on a convex polytope"],"prefix":"10.1016","volume":"296","author":[{"given":"Otfried","family":"Cheong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(02)00431-0_BIB1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","article-title":"Farthest neighbors, maximum spanning trees and related problems in higher dimensions","volume":"1","author":"Agarwal","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"10.1016\/S0304-3975(02)00431-0_BIB2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(89)90103-8","article-title":"A linear time algorithm for finding all farthest neighbors in a convex polygon","volume":"31","author":"Aggarwal","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00431-0_BIB3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s004540010086","article-title":"An efficient algorithm for the three-dimensional diameter problem","volume":"25","author":"Bespamyatnikh","year":"2001","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(02)00431-0_BIB4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(02)00431-0_BIB5","series-title":"Computational Geometry: An Introduction Through Randomized Algorithms","author":"Mulmuley","year":"1994"},{"key":"10.1016\/S0304-3975(02)00431-0_BIB6","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/S0304-3975(02)00431-0_BIB7","doi-asserted-by":"crossref","unstructured":"E. Ramos, Construction of 1-d lower envelopes and applications, in: Proc. 13th Annu. ACM Symp. on Computational Geometry, Nice, France, 1997, pp. 57\u201366.","DOI":"10.1145\/262839.262864"},{"key":"10.1016\/S0304-3975(02)00431-0_BIB8","doi-asserted-by":"crossref","unstructured":"E. Ramos, Deterministic algorithms for 3-D diameter and some 2-D lower envelopes, in: Proc. 16th Annu. ACM Symp. on Computational Geometry, Hong Kong, 2000, pp. 290\u2013299.","DOI":"10.1145\/336154.336215"},{"key":"10.1016\/S0304-3975(02)00431-0_BIB9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","article-title":"An O(nlogn) algorithm for the all-nearest-neighbors problem","volume":"4","author":"Vaidya","year":"1989","journal-title":"Discrete Comput. Geom."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T04:50:48Z","timestamp":1553921448000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502004310"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00431-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}