{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:39Z","timestamp":1725544779745},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_44","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"467-478","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for Geometric Diameter Problems"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Fournier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"44_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","volume":"1","author":"P. Agarwal","year":"1992","unstructured":"Agarwal, P., Matou\u0161ek, J., Suri, S.: Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Computational Geometry: Theory and Applications\u00a01(4), 189\u2013201 (1992)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"44_CR2","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":"44_CR3","doi-asserted-by":"publisher","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 and Computational Geometry\u00a025(2), 235\u2013255 (2000)","journal-title":"Discrete and Computational Geometry"},{"key":"44_CR4","doi-asserted-by":"publisher","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, Heidelberg (1997)"},{"issue":"1\u20132","key":"44_CR5","doi-asserted-by":"publisher","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. International Journal of Computational Geometry and Applications\u00a012(1\u20132), 67\u201385 (2002)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"1","key":"44_CR6","doi-asserted-by":"publisher","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\u00a034(1), 39\u201346 (2002)","journal-title":"Algorithmica"},{"issue":"1","key":"44_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(02)00431-0","volume":"296","author":"O. Cheong","year":"2003","unstructured":"Cheong, O., Shin, C., Vigneron, A.: Computing farthest neighbors on a convex polytope. Theoretical Computer Science\u00a0296(1), 47\u201358 (2003)","journal-title":"Theoretical Computer Science"},{"key":"44_CR8","doi-asserted-by":"publisher","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, II. Discrete and Computational Geometry\u00a04, 387\u2013421 (1989)","journal-title":"Discrete and Computational Geometry"},{"key":"44_CR9","doi-asserted-by":"publisher","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":"44_CR10","unstructured":"Erickson, J.: On the relative complexities of some geometric problems. In: Proceedings of the 7th Canadian Conference on Computational Geometry, pp. 85\u201390 (1995)"},{"key":"44_CR11","doi-asserted-by":"publisher","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 and Computational Geometry\u00a016, 389\u2013418 (1996)","journal-title":"Discrete and Computational Geometry"},{"key":"44_CR12","doi-asserted-by":"publisher","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, June 3\u20135, pp. 177\u2013186. ACM Press, New York (2001)"},{"issue":"6","key":"44_CR13","doi-asserted-by":"publisher","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. International Journal of Computational Geometry and Applications\u00a012(6), 489\u2013510 (2002)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"2","key":"44_CR14","doi-asserted-by":"publisher","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 and Computational Geometry\u00a010(2), 157\u2013182 (1993)","journal-title":"Discrete and Computational Geometry"},{"issue":"2","key":"44_CR15","doi-asserted-by":"publisher","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 and Computational Geometry\u00a010(2), 215\u2013232 (1993)","journal-title":"Discrete and Computational Geometry"},{"key":"44_CR16","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","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":"44_CR17","doi-asserted-by":"publisher","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 and Computational Geometry\u00a026, 233\u2013244 (2001)","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T02:59:13Z","timestamp":1552359553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11682462_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}