Computing the diameter of a point set

International Journal of Computational Geometry and Applications

Volumn 12, Issue 6, 2002, Pages 489-509

  Malandain, Grégoire ^a   Boissonnat, Jean Daniel ^a  

^a INRIA   (France)

Author keywords

Approximation; Diameter; Double normal; Furthest neighbors; Point sets; Width

Indexed keywords

EID: 0036967061     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195902001006     Document Type: Article

References (11)

1. N. M. Amato, M. T. Goodrich, and E. A. Ramos, "Parallel algorithms for higher-dimensional convex hulls," Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci., 1994, pp. 683-694.
2. S. Bespamyatnikh, "An efficient algorithm for the three-dimensional diameter problem," Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, 1998, pp. 137-146.
3. Otfried Cheong, Chan-Su Shin, and Antoine Vigneron, "Computing farthest neighbors on a convex polytope," Proc. 7th. Annu. Int. Comput. and Combinat. Conf., 2001, volume 2108 of LNCS, pp. 159-169.
4. K. L. Clarkson and P. W. Shor, "Applications of random sampling in computational geometry," Discrete Comput. Geom., 4 (1989) 387-421.
5. S. Har-Peled, "A practical approach for computing the diameter of a point-set," Symposium on Computational Geometry (SOCG'2001), 2001, pp. 177-186.
6. Grégoire Malandain and Jean-Daniel Boissonnat, "Computing the diameter of a point set," Research report RR-4233, INRIA, Sophia-Antipolis, 2001, http://www.inria.fr/rrrt/rr-4233.html.
7. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, 3rd edition, (Springer Verlag, October 1990).
8. 3," Comput. Geom. Theory Application, 8 (1997) 57-65.
9. E. Ramos, "Construction of 1-d lower envelopes and applications," Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 57-66.
10. Edgar A. Ramos, "An optimal deterministic algorithm for computing the diameter of a three-dimensional point set," Discrete & Computational Geometry, 26 (2001) 245-265.
11. A. C. Yao, "On constructing minimum spanning trees in k-dimensional spaces and related problems," SIAM J. Comput., 11 (1982) 721-736.