Finding Convex Hulls Using Quickhull on the GPU

01/13/2012
by   Stanley Tzeng, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/20/2015

A Novel Implementation of QuickHull Algorithm on the GPU

We present a novel GPU-accelerated implementation of the QuickHull algor...
09/16/2019

Bonsai-SPH: A GPU accelerated astrophysical Smoothed Particle Hydrodynamics code

We present the smoothed-particle hydrodynamics simulation code, Bonsai-S...
12/23/2013

Transparent Checkpoint-Restart for Hardware-Accelerated 3D Graphics

Providing fault-tolerance for long-running GPU-intensive jobs requires a...
12/10/2021

GPU-accelerated image alignment for object detection in industrial applications

This research proposes a practical method for detecting featureless obje...
07/01/2020

On Designing GPU Algorithms with Applications to Mesh Refinement

We present a set of rules to guide the design of GPU algorithms. These r...
06/28/2018

A GPU-enabled finite volume solver for large shallow water simulations

This paper presents the implementation of a HLLC finite volume solver us...
11/30/2020

Automating Artifact Detection in Video Games

In spite of advances in gaming hardware and software, gameplay is often ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.