gHull, a GPU algorithm for 3D convex hull

DOI10.1145/2513109.2513112MaRDI QIDQ3189696zbMATH OpenOpenAlexWikidataFDO

Authors Mingcen Gao, Thanh-Tung Cao, Ashwin Nanjappa, Tiow Seng Tan, Zhiyong Huang

Publication date 12 September 2014

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2513109.2513112

zbMATH Keywords

GPGPUstar splayingVoronoi diagram

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical algorithms for specific classes of architectures (65Y10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• GScan: a parallel Graham scan algorithm for calculating two-dimensional convex hulls on graphic processing units
• Fast computing of three-dimensional convex hulls using graphics hardware
• A time-optimal parallel algorithm for three-dimensional convex hulls
• The quickhull algorithm for convex hulls
• Parallel implementation of 3D convex-hull algorithm

Cited in

(6)

• A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)
• QuickhullDisk: a faster convex hull algorithm for disks
• Fast computing of three-dimensional convex hulls using graphics hardware
• Shell: a spatial decomposition data structure for 3D curve traversal on many-core architectures
• GScan: a parallel Graham scan algorithm for calculating two-dimensional convex hulls on graphic processing units
• GPU computation of the Euler characteristic curve for imaging data

Describes a project that uses

Uses Software

• CUDA
• Stanford 3D Scanning Repository
• CUDPP
• Qhull
• CGAL

This page was built for publication: gHull, a GPU algorithm for 3D convex hull

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189696)