Coarse grained parallel next element search
A. Chan, Fabian Gregor Dehne, Andrew Rau‐Chaplin · 2002
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 requires only O(n/p) storage per processor, and we discuss an implementation of this version. As in a previous paper by Develliers and Fabri[11], our algorithm is based on a distributed implementation of segment trees which are of size O(n log n). This paper