Asymptotically efficient hypercube algorithms for computational geometry

Hypercube algorithms that solve many fundamental computational geometry problems are presented. The algorithms use decomposition techniques, which enable them to outperform asymptotically the fastest previous algorithms for these problems. Previous algorithms all run in Theta (log/sup 2/n) time, even when using a sorting method that runs in o(log/sup 2/n) time. The new algorithms use a recently discovered o(log/sup 2/n) time sorting method to improve their asymptotic speed to o(log/sup 2/n). If sorting runs in Theta (Sort(n)) time, the algorithms for two-set dominance counting, 3-D maxima, closest pair, and all points nearest neighbors run in Theta (Sort(n)) log(log n) time, and the algorithms for triangulation and visibility from a point run in Theta (Sort(n)) time.<<ETX>>

[1]  Yung H. Tsin,et al.  An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane , 1987, Inf. Process. Lett..

[2]  Silvio Salza,et al.  A Parallel Algorithm for the Visibility Problem from a Point , 1990, J. Parallel Distributed Comput..

[3]  Dan E. Willard,et al.  Quasi-Valid range querying and its implications for nearest neighbor problems , 1988, SCG '88.

[4]  Quentin F. Stout,et al.  Practical hypercube algorithms for computational geometry , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[5]  Russ Miller,et al.  Efficient Parallel Convex Hull Algorithms , 1988, IEEE Trans. Computers.

[6]  C. Greg Plaxton,et al.  Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, STOC '90.

[7]  Russ Miller,et al.  Mesh Computer Algorithms for Computational Geometry , 1989, IEEE Trans. Computers.

[8]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[9]  Richard Cole,et al.  Optimal parallel algorithms for polygon and point-set problems , 1988, SCG '88.

[10]  Mikhail J. Atallah,et al.  Efficient Parallel Solutions to Some Geometric Problems , 1986, J. Parallel Distributed Comput..

[11]  Micha Sharir,et al.  Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, Discret. Comput. Geom..