Divide-and-Conquer 3D Convex Hulls on the GPU
classification
💻 cs.DC
cs.CG
keywords
algorithmconvexdivide-and-conquerhullscomparablecomputingdescribefind
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.