Coarse Grained Parallel Next Element Search

  title={Coarse Grained Parallel Next Element Search},
  author={Albert Chan and Frank Dehne and Andrew Rau-Chaplin},
We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/ p) log n) local computation, and O((n/p) log n) storage per processor. Our result implies solutions to the point location, trapezoidal decomposition and polygon triangulation problems. A simplified version for axis parallel segments… CONTINUE READING
8 Citations
20 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 20 references

General Purpose Parallel Architectures

  • L. G. Valiant et. al
  • Handbook of Theoretical Computer Science, Edited…
  • 1990
Highly Influential
4 Excerpts

Good Programming Style on Multiprocessors

  • X. Deng, N. Gu
  • Proc. IEEE Symposium on Parallel and Distributed…
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…