Practical hypercube algorithms for computational geometry

The use of the cross-stitching technique to solve problems in computational geometry on the hypercube is discussed. Given n inputs distributed one per processor on a hypercube with n processors. The cross-stitching paradigm runs in Theta (log/sup 2/n) time with very low constants. This form of 2-D divide-and-conquer is illustrated, some of its applications are considered, and its practicality is shown by the computation of exact communication constants for the authors' algorithms.<
>