Divide-and-Conquer 3D Convex Hulls on the GPU
Jeffrey M. White, Kevin A. Wortman

TL;DR
This paper presents a GPU-accelerated divide-and-conquer algorithm for computing 3D convex hulls, achieving significant speedups over CPU methods.
Contribution
It introduces a novel parallel algorithm for 3D convex hulls optimized for GPU hardware, demonstrating improved performance.
Findings
Significant speedup over CPU implementations
Effective parallelization of divide-and-conquer approach
Successful implementation on GPU hardware
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · 3D Shape Modeling and Analysis · Computer Graphics and Visualization Techniques
