Computing the Diameter of a Point Set

  • Grégoire Malandain
  • Jean-Daniel Boissonnat
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)

Abstract

Given a finite set of points P in ℝd, the diameter of P is defined as the maximum distance between two points of P. We propose a very simple algorithm to compute the diameter of a finite set of points. Although the algorithm is not worst-case optimal, it appears to be extremely fast for a large variety of point distributions.

Keywords

Convex Hull Hybrid Method Exhaustive Search Point Distribution Deterministic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [AGR94]
    N. M. Amato, M. T. Goodrich, and E. A. Ramos. Parallel algorithms for higher-dimensional convex hulls. In Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci., pages 683–694, 1994.Google Scholar
  2. [Bes98]
    S. Bespamyatnikh. An efficient algorithm for the three-dimensional diameter problem. In Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, pages 137–146, 1998.Google Scholar
  3. [CS89]
    K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry. Discrete Comput. Geom., 4:387–421, 1989.MATHCrossRefMathSciNetGoogle Scholar
  4. [Har01]
    S. Har-Peled. A practical approach for computing the diameter of a pointset. In Symposium on Computational Geometry (SOCG’2001), pages 177–186, 2001.Google Scholar
  5. [MB01]
    Grégoire Malandain and Jean-Daniel Boissonnat. Computing the diameter of a point set. Research report RR-4233, INRIA, Sophia-Antipolis, July 2001. http://www.inria.fr/rrrt/rr-4233.html.Google Scholar
  6. [PS90]
    F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer Verlag, October 1990. 3rd edition.Google Scholar
  7. [Ram97a]
    E. Ramos. Construction of 1-d lower envelopes and applications. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 57–66, 1997.Google Scholar
  8. [Ram97b]
    E. Ramos. Intersection of unit-balls and diameter of a point set in R 3. Comput. Geom. Theory Application, 8:57–65, 1997.MATHGoogle Scholar
  9. [Ram00]
    Edgar A. Ramos. Deterministic algorithms for 3-D diameter and some 2-D lower envelopes. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 290–299, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Grégoire Malandain
    • 1
  • Jean-Daniel Boissonnat
    • 1
  1. 1.INRIASophia-Antipolis CedexFrance

Personalised recommendations