Journal ArticleDOI
Applications of Geometry Processing: CudaHull: Fast parallel 3D convex hull on the GPU
Reads0
Chats0
TLDR
A novel parallel algorithm for computing the convex hull of a set of points in 3D using the CUDA programming model based on the QuickHull approach and starts by constructing an initial tetrahedron using four extreme points, discards the internal points, and distributes the external points to the four faces.About:
This article is published in Computers & Graphics.The article was published on 2012-06-01. It has received 52 citations till now. The article focuses on the topics: Quickhull & Convex hull.read more
Citations
More filters
Journal ArticleDOI
SMI 2012: Full GPU accelerated convex hull computation
TL;DR: A hybrid algorithm to compute the convex hull of points in three or higher dimensional spaces using a GPU-based interior point filter to cull away many of the points that do not lie on the boundary and a pseudo-hull that is contained inside the conveX hull of the original points is computed.
Proceedings ArticleDOI
Randomized Incremental Convex Hull is Highly Parallel
TL;DR: A strong theoretical analysis is provided showing that for n points in any constant dimension, the standard incremental algorithm is inherently parallel, and it is shown that for problems where the size of the support set can be bounded by a constant, the depth of the configuration dependence graph is shallow.
Journal ArticleDOI
gHull: A GPU algorithm for 3D convex hull
TL;DR: The works demonstrate that the GPU can be used to solve nontrivial computational geometry problems with significant performance benefit and up to an order of magnitude faster than other sequential convex hull implementations running on the CPU for inputs of millions of points.
Journal ArticleDOI
An algorithm for the grain-level modelling of a dry sand particulate system
TL;DR: In this paper, the grain-level responses of grains, i.e. deformation, fracture and damage of sand grains, impose significant effects on the mechanical behavior of dry sand under static and dynamic loadings.
Proceedings ArticleDOI
Flip-flop: convex hull construction via star-shaped polyhedron in 3D
TL;DR: The novel Flip-Flop algorithm is a variant of the flip algorithm that overcomes the deficiency of the traditional one to always compute the convex hull of a given star-shaped polyhedron with provable correctness.
References
More filters
Journal ArticleDOI
The quickhull algorithm for convex hulls
TL;DR: This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm, and provides empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it used less memory.
Journal ArticleDOI
Voronoi diagrams—a survey of a fundamental geometric data structure
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
Journal ArticleDOI
Coverage for robotics – A survey of recent results
TL;DR: This paper surveys recent results in coverage path planning, a new path planning approach that determines a path for a robot to pass over all points in its free space, and organizes the coverage algorithms into heuristic, approximate, partial-approximate and exact cellular decompositions.
Proceedings ArticleDOI
Applications of random sampling in computational geometry, II
TL;DR: Asymptotically tight bounds for a combinatorial quantity of interest in discrete and computational geometry, related to halfspace partitions of point sets, are given.
Journal ArticleDOI
Convex hulls of finite sets of points in two and three dimensions
Franco P. Preparata,S. J. Hong +1 more
TL;DR: The presented algorithms use the “divide and conquer” technique and recursively apply a merge procedure for two nonintersecting convex hulls to ensure optimal time complexity within a multiplicative constant.
Related Papers (5)
SMI 2012: Full GPU accelerated convex hull computation
Convex hulls of finite sets of points in two and three dimensions
Franco P. Preparata,S. J. Hong +1 more