BSP, Coarse-grained multicomputer, Next element search, Planar subdivision search, Scalable parallel algorithms, Segment tree, Simple polygon triangulation, Trapezoidal map
dx.doi.org/10.1006/jpdc.1998.1527
Journal of Parallel and Distributed Computing
School of Computer Science

Chan, A. (Albert), Dehne, F, & Rau-Chaplin, A. (Andrew). (1999). Coarse-Grained Parallel Geometric Search. Journal of Parallel and Distributed Computing, 57(2), 224–235. doi:10.1006/jpdc.1998.1527