SMI 2012: Full GPU accelerated convex hull computation
Citations
72 citations
51 citations
34 citations
Cites background from "SMI 2012: Full GPU accelerated conv..."
...New implementations have been proposed to deal with this problem [27], [28]....
[...]
22 citations
20 citations
Cites background from "SMI 2012: Full GPU accelerated conv..."
...As computing time becomes a crucial constraint, several authors develop improvements of algorithm performance by parallelization [42], [43] and by focusing on a graphics processing unit (GPU) for interior point identification [44], [45]....
[...]
References
6,525 citations
"SMI 2012: Full GPU accelerated conv..." refers background in this paper
...Given a set of points in d-dimensional space, the convex hull is the minimal convex set that contains all the points....
[...]
...In practice, our culling filter can reduce the number of candidate points by two orders of magnitude....
[...]
5,050 citations
"SMI 2012: Full GPU accelerated conv..." refers methods in this paper
...In practice, the GPU-based filtering algorithm can cull up to 85M interior points per second on an NVIDIA GeForce GTX 580 and the hybrid algorithm improves the overall performance of convex hull computation by 10 − 27 times (for static point sets) and 22 − 46 times (for deforming point sets)....
[...]
3,419 citations
747 citations
731 citations
"SMI 2012: Full GPU accelerated conv..." refers background in this paper
...Given a set of points in d-dimensional space, the convex hull is the minimal convex set that contains all the points....
[...]