Coarse-Grained Parallel Geometric Search

Chan, A. (Albert), F. Dehne (Frank) and Rau-Chaplin, A. (Andrew)

1999-05-01

Journal of Parallel and Distributed Computing , Volume 57 - Issue 2 p. 224- 235

Additional Metadata
Keywords	BSP, Coarse-grained multicomputer, Next element search, Planar subdivision search, Scalable parallel algorithms, Segment tree, Simple polygon triangulation, Trapezoidal map
Persistent URL	dx.doi.org/10.1006/jpdc.1998.1527
Journal	Journal of Parallel and Distributed Computing
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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

Publication