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

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.

11 pages, 9 figures

Cited by in corpus (3)

• CudaChain: A Practical GPU-accelerated 2D Convex Hull Algorithm
• A Novel Implementation of QuickHull Algorithm on the GPU
• gScan: Accelerating Graham Scan on the GPU