{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:23:55Z","timestamp":1772832235264,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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,9]]},"DOI":"10.1016\/0196-6774(85)90007-0","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"381-392","source":"Crossref","is-referenced-by-count":143,"title":["A linear algorithm for determining the separation of convex polyhedra"],"prefix":"10.1016","volume":"6","author":[{"given":"David P","family":"Dobkin","sequence":"first","affiliation":[]},{"given":"David G","family":"Kirkpatrick","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90007-0_BIB1","article-title":"Optimal Algorithms for the Intersection and the Minimum Distance Problems between Planar Polygons","author":"Chin","year":"1982"},{"key":"10.1016\/0196-6774(85)90007-0_BIB2","series-title":"Proceedings 12th Annual ACM Symposium on Theory of Computing","first-page":"146","article-title":"Detection is easier than computation","author":"Chazelle","year":"1980"},{"key":"10.1016\/0196-6774(85)90007-0_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","article-title":"Fast detection of polyhedral intersection","volume":"27","author":"Dobkin","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(85)90007-0_BIB4","unstructured":"D. P. Dobkin and D. G. Kirkpatrick, Fast algorithms for preprocessed polyhedral intersection detection, in preparation."},{"key":"10.1016\/0196-6774(85)90007-0_BIB5","unstructured":"M. E. Dyer, A simplified O(n log n) algorithm for the intersection of 3-polyhedra, unpublished manuscript."},{"key":"10.1016\/0196-6774(85)90007-0_BIB6","unstructured":"M. E. Dyer, An O(n) algorithm for locating a point in the intersection of polyhedra, unpublished manuscript."},{"key":"10.1016\/0196-6774(85)90007-0_BIB7","article-title":"On Computing the Extreme Distances between Two Convex Polygons","author":"Edelsbrunner","year":"1982"},{"key":"10.1016\/0196-6774(85)90007-0_BIB8","series-title":"Convex Polytopes","author":"Grunbaum","year":"1967"},{"key":"10.1016\/0196-6774(85)90007-0_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90007-0_BIB10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90007-0_BIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","article-title":"Finding the intersection of two convex polyhedra","volume":"7","author":"Muller","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 2","key":"10.1016\/0196-6774(85)90007-0_BIB12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(85)90007-0_BIB13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(85)90007-0_BIB14","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)90007-0_BIB15","series-title":"Proceedings 7th Annual ACM Symposium Theory of Computing","first-page":"224","article-title":"Geometric complexity","author":"Shamos","year":"1975"},{"key":"10.1016\/0196-6774(85)90007-0_BIB16","series-title":"Proceedings 17th Annual IEEE Found. Comput. Sci. Conference","first-page":"208","article-title":"Geometric intersection problems","author":"Shamos","year":"1976"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900070?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900070?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:05Z","timestamp":1548743165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900070"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90007-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}