Finding Convex Hulls Using Quickhull on the GPU

Details Finding Convex Hulls Using Quickhull on the GPU Finding Convex Hulls Using Quickhull on the GPU

2012-01-13

arxiv.org/abs/1201.2936v1

Computer Science

Computational Geometry

11 pages

Scientific paper

We present a convex hull algorithm that is accelerated on commodity graphics hardware. We analyze and identify the hurdles of writing a recursive divide and conquer algorithm on the GPU and divise a framework for representing this class of problems. Our framework transforms the recursive splitting step into a permutation step that is well-suited for graphics hardware. Our convex hull algorithm of choice is Quickhull. Our parallel Quickhull implementation (for both 2D and 3D cases) achieves an order of magnitude speedup over standard computational geometry libraries.

Affiliated with

Also associated with

No associations

Rating

Finding Convex Hulls Using Quickhull on the GPU does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding Convex Hulls Using Quickhull on the GPU, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Convex Hulls Using Quickhull on the GPU will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472355