A practical approach for computing the diameter of a point set

Authors:
Sariel Har-Peled
Affiliations:
Department of Computer Science, University of Illinois, Urbana, IL
Venue:
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Year:
2001

Citing 8
Cited 12

An O(n log n) algorithm for the all-nearest-neighbors problem

Discrete & Computational Geometry
Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Farthest neighbors, maximum spanning trees and related problems in higher dimensions

Computational Geometry: Theory and Applications
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes

Proceedings of the sixteenth annual symposium on Computational geometry
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

Proceedings of the sixteenth annual symposium on Computational geometry

Computing the Diameter of a Point Set

DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Faster core-set constructions and data stream algorithms in fixed dimensions

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces

IEEE Transactions on Knowledge and Data Engineering
Faster core-set constructions and data-stream algorithms in fixed dimensions

Computational Geometry: Theory and Applications
A practical approximation algorithm for the LMS line estimator

Computational Statistics & Data Analysis
Optimal location of transportation devices

Computational Geometry: Theory and Applications
Faster core-set constructions and data-stream algorithms in fixed dimensions

Computational Geometry: Theory and Applications
New constructions of SSPDs and their applications

Proceedings of the twenty-sixth annual symposium on Computational geometry
Distributed antipole clustering for efficient data search and management in Euclidean and metric spaces

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
New constructions of SSPDs and their applications

Computational Geometry: Theory and Applications
Lower bounds for geometric diameter problems

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Two-Dimensional range diameter queries

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approximation algorithm for computing the diameter of a point-set in $d$-dimensions. The new algorithm is sensitive to the “hardness” of computing the diameter of the given input, and for most inputs it is able to compute the {\em exact} diameter extremely fast. The new algorithm is simple, robust, has good empirical performance, and can be implemented quickly. As such, it seems to be the algorithm of choice in practice for computing/approximating the diameter.