{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:50:09Z","timestamp":1761058209446},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0196-6774(85)90039-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"213-224","source":"Crossref","is-referenced-by-count":72,"title":["Computing the extreme distances between two convex polygons"],"prefix":"10.1016","volume":"6","author":[{"given":"H","family":"Edelsbrunner","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90039-2_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0196-6774(83)90040-8","article-title":"Efficient algorithms for computing the maximum distance between two finite planar sets","volume":"4","author":"Bhattacharya","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90039-2_BIB2","series-title":"Proc. 12th Annual ACM Sympos. on Theory of Comput.","first-page":"146","article-title":"Detection is easier than computation","author":"Chazelle","year":"1980"},{"year":"1982","author":"Chin","series-title":"Optimal algorithms for the intersection and the minimum distance problems between planar polygons","key":"10.1016\/0196-6774(85)90039-2_BIB3"},{"key":"10.1016\/0196-6774(85)90039-2_BIB4","series-title":"Proc. 9th Int. Colloq. on Automata, Lang., and Programming","first-page":"154","article-title":"Fast detection of polyhedral intersections","author":"Dobkin","year":"1982"},{"key":"10.1016\/0196-6774(85)90039-2_BIB5","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."},{"year":"1983","author":"McKenna","article-title":"Finding the minimum vertex distance between two disjoint convex polygons in linear time","key":"10.1016\/0196-6774(85)90039-2_BIB6"},{"key":"10.1016\/0196-6774(85)90039-2_BIB7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(81)90051-X","article-title":"Finding the minimum distance between two convex polygons","volume":"13","author":"Schwartz","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90039-2_BIB8","series-title":"Proc. 7th Annual ACM Sympos. on Theory of Comput.","first-page":"224","article-title":"Geometric complexity","author":"Shamos","year":"1975"},{"unstructured":"G. T. Toussaint and J. A. McAlear, A simple O(nlogn) alogirthm for finding the maximum distance between two finite planar sets, Patte Recognition Lett., in press.","key":"10.1016\/0196-6774(85)90039-2_BIB9"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900392?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:26:22Z","timestamp":1548725182000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0196677485900392"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90039-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}