{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T02:18:13Z","timestamp":1770776293752,"version":"3.50.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,9,22]],"date-time":"2007-09-22T00:00:00Z","timestamp":1190419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2007,10,15]]},"DOI":"10.1007\/s00453-007-9010-0","type":"journal-article","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T19:26:06Z","timestamp":1190402766000},"page":"245-257","source":"Crossref","is-referenced-by-count":3,"title":["A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope"],"prefix":"10.1007","volume":"49","author":[{"given":"Herv\u00e9","family":"Fournier","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,22]]},"reference":[{"key":"9010_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 80\u201386 (1983)","DOI":"10.1145\/800061.808735"},{"issue":"2","key":"9010_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s004540010086","volume":"25","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S.: An efficient algorithm for the three-dimensional diameter problem. Discrete Comput. Geom. 25(2), 235\u2013255 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"9010_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.: Algebraic Complexity Theory. Springer, Berlin (1997)"},{"issue":"2","key":"9010_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/jcom.1993.1016","volume":"9","author":"P. B\u00fcrgisser","year":"1993","unstructured":"B\u00fcrgisser, P., Karpinski, M., Lickteig, T.: On randomized semi-algebraic test complexity. J. Complex. 9(2), 231\u2013251 (1993)","journal-title":"J. Complex."},{"issue":"1\u20132","key":"9010_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1142\/S0218195902000748","volume":"12","author":"T. Chan","year":"2002","unstructured":"Chan, T.: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Int. J. Comput. Geom. Appl. 12(1\u20132), 67\u201385 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"9010_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s00453-002-0939-8","volume":"34","author":"B. Chazelle","year":"2002","unstructured":"Chazelle, B., Devillers, O., Hurtado, F., Mora, M., Sacrist\u00e1n, V., Teillaud, M.: Splitting a Delaunay triangulation in linear time. Algorithmica 34(1), 39\u201346 (2002)","journal-title":"Algorithmica"},{"key":"9010_CR7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K. Clarkson","year":"1989","unstructured":"Clarkson, K., Shor, P.: Applications of random sampling in computational geometry,\u00a0II. Discrete Comput. Geom. 4, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9010_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"9010_CR9","unstructured":"Erickson, J.: On the relative complexities of some geometric problems. In: Proceedings of the 7th Canadian Conference on Computational Geometry, pp.\u00a085\u201390 (1995)"},{"key":"9010_CR10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02712875","volume":"16","author":"J. Erickson","year":"1996","unstructured":"Erickson, J.: New lower bounds for Hopcroft\u2019s problem. Discrete Comput. Geom. 16, 389\u2013418 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"9010_CR11","doi-asserted-by":"crossref","unstructured":"Grigoriev, D.: Randomized complexity lower bounds. In: Proceedings of the 30th ACM Symposium on Theory of Computing, pp.\u00a0219\u2013223 (1998)","DOI":"10.1145\/276698.276745"},{"key":"9010_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/378583.378662","volume-title":"Proceedings of the Seventeenth Annual Symposium on Computational Geometry","author":"S. Har-Peled","year":"2001","unstructured":"Har-Peled, S.: A practical approach for computing the diameter of a point set. In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, New York, 3\u20135 June 2001, pp.\u00a0177\u2013186. ACM, New York (2001)"},{"issue":"6","key":"9010_CR13","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1142\/S0218195902001006","volume":"12","author":"G. Malandain","year":"2002","unstructured":"Malandain, G., Boissonnat, J.-D.: Computing the diameter of a point set. Int. J. Comput. Geom. Appl. 12(6), 489\u2013510 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"9010_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cuttings. Discrete Comput. Geom. 10(2), 157\u2013182 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9010_CR15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02573975","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J., Schwarzkopf, O.: On ray shooting in convex polytopes. Discrete Comput. Geom. 10(2), 215\u2013232 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"9010_CR16","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, I.: Computational Geometry: An Introduction, 2nd edn. Texts and Monographs in Computer Science. Springer, New York (1985)","edition":"2"},{"key":"9010_CR17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00454-001-0029-8","volume":"26","author":"E. Ramos","year":"2001","unstructured":"Ramos, E.: An optimal deterministic algorithm for computing the diameter of a three-dimensional point set. Discrete Comput. Geom. 26, 233\u2013244 (2001)","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9010-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9010-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9010-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:59Z","timestamp":1559137499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9010-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,22]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,10,15]]}},"alternative-id":["9010"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9010-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,22]]}}}