A practical approach for computing the diameter of a point set

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 177-185

  Har Peled, S ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA MINING; DATA STRUCTURES; HIERARCHICAL SYSTEMS; SET THEORY;

POINT SETS;

COMPUTATION THEORY;

EID: 0034836609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378662     Document Type: Conference Paper

References (11)

1. Farthest neighbors, maximum spanning trees and related problems in higher dimensions
2. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
3. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
4. Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus
5. Applications of random sampling in computational geometry, II
6. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
7. Deterministic algorithms for 3-d dimaeter and some 2-d lower envelopes
8. Solving geometric problems with the rotating calipers
9. An O(n log n) algorithm for the all-nearest-neighbors problem