Name
Abstract | ||
|---|---|---|
In spatial subdivision-based collision detection methods on GPUs, uniform subdivision works well for even triangle spatial distributions, whilst for uneven cases non-uniform subdivision works better. Non-uniform subdivision techniques mainly include hierarchical grids and octrees. Hierarchical grids have been adopted for previous GPU-based approaches, due to their suitability for GPUs. However, octrees offer a better adaptation to distributions. One contribution of this paper is the use of an octree grid that takes a middle path between these two structures, and accelerates collision detection by significantly reducing the number of broad-phase tests which, due to their large quantity, are generally the main bottleneck in performance. Another contribution is to achieve further reduction in the number of tests in the broad phase using a two-stage scheme to improve octree subdivision. The octree grid approach is also able to address the issue of uneven triangle sizes, another common difficulty for spatial subdivision techniques. Compared to the virtual subdivision method which reports the fastest results among existing methods, speedups between 1.0 $$\times $$ and 1.5 $$\times $$ are observed for most standard benchmarks where triangle sizes and spatial distributions are uneven. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s00371-014-0954-1 | The Visual Computer: International Journal of Computer Graphics |
Keywords | Field | DocType |
collision detection,deformable objects,gpu-based,octree grid | Sparse voxel octree,Bottleneck,Computer vision,Collision detection,Computer graphics (images),Computer science,Subdivision,Computational science,Artificial intelligence,Grid,Octree | Journal |
Volume | Issue | ISSN |
30 | 6-8 | 1432-2315 |
Citations | PageRank | References |
10 | 0.50 | 28 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsz Ho Wong | 1 | 16 | 1.73 |
| Geoff Leach | 2 | 115 | 13.53 |
| Fabio Zambetta | 3 | 134 | 22.06 |