An efficient algorithm for the three-dimensional diameter problem

We explore a new approach for computing the diameter of n points in ℝ3 that is based on the restriction of the furthest-point Voronoi diagram to the convex hull. We show that the restricted Voronoi diagram has linear complexity. We present a deterministic algorithm with O(n log2n) running time. The algorithm is quite simple and is a good candidate to be implemented in practice. Using our approach the chromatic diameter and all-furthest neighbors in ℝ3 can be found in the same running time.

[1]  H. Davenport,et al.  A Combinatorial Problem Connected with Differential Equations , 1965 .

[2]  H. Davenport.  A combinatorial problem connected with differential equations II , 1971 .

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

[4]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[5]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[6]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[7]  D. T. Lee,et al.  Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.

[8]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[10]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11]  Godfried T. Toussaint.  The symmetric all-furthest- neighbor problem , 1983 .

[12]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[13]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[14]  Hiroshi Imai,et al.  Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..

[15]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[16]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[17]  Franz Aurenhammer,et al.  A criterion for the affine equivalence of cell complexes inRd and convex polyhedra inRd+1 , 1987, Discret. Comput. Geom..

[18]  Franz Aurenhammer,et al.  Improved Algorithms for Discs and Balls Using Power Diagrams , 1988, J. Algorithms.

[19]  F. Aurenhammer.  Linear combinations from power domains , 1988 .

[20]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[21]  Alok Aggarwal,et al.  A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon , 1989, Inf. Process. Lett..

[22]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[23]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[24]  Otfried Cheong.  Ray Shooting in Convex Polytopes , 1992, Symposium on Computational Geometry.

[25]  Leonidas J. Guibas,et al.  Diameter, width, closest line pair, and parametric searching , 1992, SCG '92.

[26]  Jirí Matousek,et al.  A deterministic algorithm for the three-dimensional diameter problem , 1993, STOC '93.

[27]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[28]  Leonidas J. Guibas,et al.  Diameter, width, closest line pair, and parametric searching , 1993, Discret. Comput. Geom..

[29]  Otfried Cheong,et al.  On ray shooting in convex polytopes , 1993, Discret. Comput. Geom..

[30]  Nancy M. Amato,et al.  Parallel algorithms for higher-dimensional convex hulls , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[31]  Jirí Matousek,et al.  A Deterministic Algorithm for the Three-dimensional Diameter Problem , 1996, Comput. Geom..

[32]  Edgar A. Ramos.  Construction of 1-d lower envelopes and applications , 1997, SCG '97.

[33]  Edgar A. Ramos,et al.  Intersection of Unit-balls and Diameter of a Point Set in 3 , 1997, Comput. Geom..

[34]  Bernard Chazelle,et al.  Product range spaces, sensitive sampling, and derandomization , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[35]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[36]  Edgar A. Ramos.  Deterministic algorithms for 3-D diameter and some 2-D lower envelopes , 2000, SCG '00.