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

2012/05/06 by Jeffrey M. White, White, Jeffrey M., Kevin Wortman +1
Computer Science · Engineering · #3D Shape Modeling and Analysis #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #D.1.3 #Distributed #FOS: Computer and information sciences #I.3.5 #Parallel #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.1205.1171

openalex publication_date 2012/05/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Convex hulls of finite sets of points in two and three dimensions
• The quickhull algorithm for convex hulls

Related

• Finding Convex Hulls Using Quickhull on the GPU
• Accelerating the Convex Hull Computation with a Parallel GPU Algorithm
• A Straightforward Preprocessing Approach for Accelerating Convex Hull Computations on the GPU
• An Evaluation of GPU Filters for Accelerating the 2D Convex Hull
• CuClarabel: GPU Acceleration for a Conic Optimization Solver