{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:27:54Z","timestamp":1767706074715},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6225,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0925-7721(95)00025-9","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T18:53:11Z","timestamp":1051210391000},"page":"253-262","source":"Crossref","is-referenced-by-count":11,"title":["A deterministic algorithm for the three-dimensional diameter problem"],"prefix":"10.1016","volume":"6","author":[{"given":"Ji\u0159\u00ed","family":"Matou\u0161ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otfried","family":"Schwarzkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00025-9_BIB1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02189314","article-title":"Cutting hyperplanes for divide-and-conquer","volume":"9","author":"Chazelle","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00025-9_BIB2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02189314","article-title":"Diameter, width, closest line pair, and parametric searching","volume":"10","author":"Chazelle","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00025-9_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02122778","article-title":"A deterministic view of random sampling and its use in geometry","volume":"10","author":"Chazelle","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/0925-7721(95)00025-9_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\/0925-7721(95)00025-9_BIB5","series-title":"Proc. 8th ACM Symp. Comput. Geom.","first-page":"9","article-title":"A class of convex programs with applications to computational geometry","author":"Dyer","year":"1992"},{"key":"10.1016\/0925-7721(95)00025-9_BIB6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02574697","article-title":"Cutting hyperplane arrangements","volume":"6","author":"Matou\u0161ek","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00025-9_BIB7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/jcss.1995.1018","article-title":"Approximation and geometric divide and conquer","volume":"50","author":"Matou\u0161ek","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0925-7721(95)00025-9_BIB8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02293051","article-title":"Efficient partition trees","volume":"8","author":"Matou\u0161ek","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00025-9_BIB9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02573975","article-title":"On ray shooting in convex polytopes","volume":"10","author":"Matou\u0161ek","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00025-9_BIB10","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0925-7721(95)00025-9_BIB11","first-page":"145","article-title":"On the computational complexity and geometry of the first order theory of the reals","volume":"13","author":"Renegar","year":"1992","journal-title":"J. Symb. Comput."},{"key":"10.1016\/0925-7721(95)00025-9_BIB12","series-title":"Proc. 17th ACM Symp. Theory Comput.","first-page":"163","article-title":"A general approach to geometric queries","author":"Yao","year":"1985"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000259?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000259?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:24:51Z","timestamp":1555197891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0925772195000259"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00025-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}