Fast algorithms for computing the diameter of a finite planar set

Three algorithms for computing the diameter of a finite planar set are proposed. Although all three algorithms have (O(n2) worst-case running time, an expected-complexity analysis shows that, under reasonable probabilistic assumptions, all three algorithms have linear expected running time. Experimental results indicate that two of these algorithms perform very well for some distributions, and are competitive with an existing method. Finally, we exhibit situations where these exact algorithms out-perform a published approximate algorithm.

[1]  Godfried T. Toussaint,et al.  A historical note on convex hull finding algorithms , 1985, Pattern Recognit. Lett..

[2]  Wesley E. Snyder,et al.  Finding the Extrema of a Region , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Godfried T. Toussaint,et al.  A note on linear expected time algorithms for finding convex hulls , 2005, Computing.

[4]  Godfried T. Toussaint,et al.  A Counterexample to a Diameter Algorithm for Convex Polygons , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  David P. Dobkin,et al.  On a general method for maximizing and minimizing among certain geometric problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6]  Godfried T. Toussaint,et al.  Computational Geometry and Morphology , 1986 .

[7]  T. Cacoullos,et al.  On the Distribution of the Bivariate Range , 1967 .

[8]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[9]  Godfried T. Toussaint,et al.  Time- and storage-efficient implementation of an optimal planar convex hull algorithm , 1983, Image Vis. Comput..

[10]  Michael Ian Shamos,et al.  Divide and Conquer for Linear Expected Time , 1978, Information Processing Letters.

[11]  Godfried T. Toussaint,et al.  On the multimodality of distances in convex polygons , 1982 .

[12]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[13]  Selim G. Akl,et al.  A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..

[14]  Luc Devroye.  A Note on Finding Convex Hulls Via Maximal Vectors , 1980, Inf. Process. Lett..

[15]  Martin A. Fischler.  Fast algorithms for two maximal distance problems with applications to image analysis , 1980, Pattern Recognit..

[16]  G. Toussaint,et al.  On Geometric Algorithms that use the Furthest-Point Voronoi Diagram , 1985 .

[17]  Kevin Q. Brown.  Geometric transforms for fast geometric algorithms , 1979 .

[18]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.