A 2-D parallel convex hull algorithm with optimal communication phases-Reference-Cited by-同舟云学术

A 2-D parallel convex hull algorithm with optimal communication phases

Published:2001-02 Issue:3 Volume:27 Page:243-255
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Dymond Patrick,Zhou Jieliang,Deng Xiaotie

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference34 articles.

1. A. Ferreira, A.Rau-Chaplin, S. Ueda, Scalable 2-D convex hull and triangulation algorithm for coarse grained multicomputers, in: Seventh IEEE Symposium on Parallel and Distributed Processing, 1995, pp. 561–568

2. D.G. Kirkpatrick, R. Seidel, The ultimate planar hull algorithm, SIAM Journal of Computation 15 (1) (1986)

3. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985

4. Parallel computational geometry;Aggarwal;Algorithmica,1988

5. A. Aggarwal, A.K. Chandra, M. Snir, On communication latency in PRAM computations, in: Proc. SPAA89, 1989, pp. 11–21

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Convex Hull Formation for Programmable Matter;Proceedings of the 21st International Conference on Distributed Computing and Networking;2020-01-04

2. Fast spherical centroidal Voronoi mesh generation: A Lloyd-preconditioned LBFGS method in parallel;Journal of Computational Physics;2018-08

3. Design and implementation of a massively parallel version of DIRECT;Computational Optimization and Applications;2007-10-24

4. Parallel Convex Hull Computation by Generalised Regular Sampling;Euro-Par 2002 Parallel Processing;2002