7554

Divide-and-Conquer 3D Convex Hulls on the GPU

Jeffrey M. White, Kevin A. Wortman
Department of Computer Science, California State University, Fullerton
arXiv:1205.1171v1 [cs.DC] (6 May 2012)

@article{2012arXiv1205.1171W,

   author={White}, J.~M. and {Wortman}, K.~A.},

   title={"{Divide-and-Conquer 3D Convex Hulls on the GPU}"},

   journal={ArXiv e-prints},

   archivePrefix={"arXiv"},

   eprint={1205.1171},

   primaryClass={"cs.DC"},

   keywords={Computer Science – Distributed, Parallel, and Cluster Computing, Computer Science – Computational Geometry, I.3.5, D.1.3},

   year={2012},

   month={may},

   adsurl={http://adsabs.harvard.edu/abs/2012arXiv1205.1171W},

   adsnote={Provided by the SAO/NASA Astrophysics Data System}

}

Download Download (PDF)   View View   Source Source   

1053

views

We describe a pure divide-and-conquer parallel algorithm for computing 3D convex hulls. We implement that algorithm on GPU hardware, and find a significant speedup over comparable CPU implementations.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: