The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal <it>O</it>(log <it>n</it>)-time, <it>n</it>-processor hypercube algorithms for the problems of computing the portions of an <it>n</it>-vertex simple polygonal chain <it>C</it> that are visible from a given source point, computing the convex hull of <it>C</it>, testing an <it>n</it>-vertex simple polygon <it>P</it> for monotonicity, and other related problems as well. Previously it was not known how to achieve these complexity bounds on hypercubes, one of the main difficulties being that there is no known optimal sorting hypercube algorithm that achieves these bounds. In fact these are the first optimal geometric hypercube algorithms that do not assume that the input is given already sorted by <it>x</it> or <it>y</it> coordinates. The hypercube model we use is the standard one, with <it>O</it>(1) local memory per processor, and with one-port communication.</p>
Algorithms, computational geometry, convex hulls, hypercubes, kernel, monotonicity, simple polygons, visibility.

D. Z. Chen and M. J. Atallah, "Optimal Parallel Hypercube Algorithms for Polygon Problems," in IEEE Transactions on Computers, vol. 44, no. , pp. 914-922, 1995.
82 ms
(Ver 3.3 (11022016))