Abstract
We consider the problem of computing the diameter of a set of n points in d-dimensional Euclidean space under Euclidean distance function.We describe an algorithm that in time O(dn log n+n 2) finds with high probability an arbitrarily close approximation of the diameter. For large values of d the complexity bound of our algorithm is a substantial improvement over the complexity bounds of previously known exact algorithms. Computing and approximating the diameter are fundamental primitives in high dimensional computational geometry and find practical application, for example, in clustering operations for image databases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992.
S. N. Bespamyatnikh. An efficient algorithm for the three-dimensional diameter problem. In Proc. 9th ACM-SIAM SODA, pages 137–146, 1998.
A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. J. ACM, 4(36):929–965, 1989.
A. Borodin, R. Ostrovsky, and Y. Rabani. Subquadratic approximation algorithms for clustering problems in high dimensional space. To appear in Proc. STOC, 1999.
B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. Diameter, width, closest line pair, and parametric searching. Discrete Comput. Geom., 10:183–196, 1993.
K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387–421, 1989.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. In Proc. 19th ACM STOC, pages 1–6, 1987.
R. M. Dudley. Central limit theorems for empirical measures. Annals of Probability, 6:899–929, 1978.
R. M. Dudley. A Course on Empirical Processes. In Lecture Notes in Mathematics, No. 1097, pages 1–142, 1984.
Ö. Egecioglu and B. Kalantari. Approximating the diameter of a set of points in the Euclidean space. Information Processing Letters, 32:205–211, 1989.
P. Erdös. On sets of distances of n points. Amer. Math. Monthly, 53:248–250, 1946.
P. Erdös. On sets of distances of points in Euclidean spaces. Magyar Tud. Akad. Mat. Kutató Int. Közl., 5:165–169, 1960.
M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker. Query by image and video content: The QBIC system. Computer, 28(9):23–32, 1995.
P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory, Series B 44:355–362, 1988.
P. Gritzmann and V. Klee. Inner and outer j-radii of convex bodies in finite dimensional normed spaces. Discrete Computat. Geom., 7:255–280, 1992.
P. Gritzmann and V. Klee. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Mathematical programming, 59:163–213, 1993.
P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity: I. Containment problems. Discrete Math., 136:129–174, 1994.
V. N. Gudivada and V. V. Raghavan. Guest editors’ introduction: Content-based image retrieval systems. Computer, 28(9):18–22, 1995.
C. E. Jacobs, A. Finkelstein, and D. H. Salesin. Fast multiresolution image querying. In Robert Cook, editor, SIGGRAPH 95 Conference Proceedings, pages 277–286. AddisonWesley, August 1995.
W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in Modern Analysis and Probability, volume 26 of Contemporary Mathematics, pages 189–206, 1984.
J. M. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In 29th ACM STOC, pages 599–608, 1997.
D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 2nd edition, 1981.
J. Matoušek and O. Schwarzkopf. A deterministic algorithm for the three-dimensional diameter problem. In Proc. 25th STOC, pages 478–484, 1993.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
K. Mulmuley. Computational Geometry. An Introduction Through Randomized Algorithms. Prentice Hall, 1994.
F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. SpringerVerlag, 1985.
E. A. Ramos. Construction of 1-d lower envelopes and applications. In Proc. 13th Annual Symp. on Computational Geometry, pages 57–66, 1997.
S. Straszewicz. Sur un probléme géometrique de P. Erdös. Bull. Acad. Polon. Sci. Cl. III, 5:39–40, 1957.
V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Prob. Appl., 16:264–280, 1971.
M. Vidyasagar. Learning and generalization with applications to neural networks. Preliminary version of [31], November 1995.
M. Vidyasagar. A Theory of Learning and Generalization: with Applications to Neural Networks and Control System. Springer-Verlag, London, 1997.
A. C. Yao. Personal communication. Also in “On computing the distance matrix of n points in k dimensions”, TR IBM San Jose Research Center, about 1982.
A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal of Computing, 11(4):721–736, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finocchiaro, D.V., Pellegrini, M. (1999). On Computing the Diameter of a Point Set in High Dimensional Euclidean Space. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_32
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive