{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:02:42Z","timestamp":1709812962032},"reference-count":4,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0167-8655(93)90144-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:46:52Z","timestamp":1056980812000},"page":"733-735","source":"Crossref","is-referenced-by-count":3,"title":["Maximum distance between two sets of points in Ed"],"prefix":"10.1016","volume":"14","author":[{"given":"Jean-Marc","family":"Robert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(93)90144-3_BIB1","first-page":"121","article-title":"Efficient algorithms for computing the maximum distance between two finite planar sets","volume":"4","author":"Bhattacharya","year":"1983","journal-title":"J. Algebra"},{"key":"10.1016\/0167-8655(93)90144-3_BIB2","series-title":"Proc. 8th Annual ACM Symp. on Comp. Geom.","article-title":"Diameter, width, closest line pair and parametric searching","author":"Chazelle","year":"1992"},{"key":"10.1016\/0167-8655(93)90144-3_BIB3","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":"Disc. Comp. Geom."},{"key":"10.1016\/0167-8655(93)90144-3_BIB4","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","article-title":"On computing minimum spanning trees in k-dimensional spaces and related problems","volume":"11","author":"Yao","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865593901443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865593901443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:55:10Z","timestamp":1552902910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167865593901443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":4,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0167865593901443"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(93)90144-3","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}