Intersection of Unit-balls and Diameter of a Point Set in 3

Abstract We describe an algorithm for computing the intersection of n balls of equal radius in R 3 which runs in time O(nlg2 n). The algorithm can be parallelized so that the comparisons that involve the radius of the balls are performed in O(lg3 n) batches. Using parametric search, these algorithms are used to obtain an algorithm for computing the diameter of a set of n points in R 3 (the maximum distance between any pair) which runs in time O(n lg5 n). The algorithms are deterministic and elementary; this is in contrast with the running time O(nlgn) in both cases that can be achieved using randomization (Clarkson and Shor, 1989), and the running times O(nlg n) and O(nlg3 n) using deterministic geometric sampling (Bronnimann et al., 1993; Amato et al., 1994).

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

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

[3]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[4]  A. Heppes.  Beweis einer Vermutung von A. Vázsonyi , 1956 .

[5]  Joseph O'Rourke,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

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

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

[8]  JOSEPH O’ROURKE,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[9]  Richard Cokt.  Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms , 1984 .

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

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

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

[13]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[14]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[15]  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).