CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

PDQ: Parallel Distance Queries for Deformable Meshes

Evan Shellshear ; Fadi Bitar ; Ulf Assarsson (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
Graphical Models (1524-0703). Vol. 75 (2013), 2, p. 69-78.
[Artikel, refereegranskad vetenskaplig]

This paper presents a new algorithm to efficiently maintain Bounding-Volume Hierarchies (BVHs) for fast distance queries with deformable polygon meshes using multi-core architectures. The method involves inflating the bounding volumes in an efficient manner to guarantee the enclosure of the deformable model within the BVH at all times. This is done at low additional computation and memory cost without significantly degrading the quality of the BVH and also in a fashion that allows a simple parallel implementation. Additionally, to facilitate fast queries specifically for deforming meshes, we propose a novel algorithm for the bottom-up construction of BVHs that results in much faster distance queries.

Nyckelord: parallelism, distance queries, collision detection



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-04-05. Senast ändrad 2015-02-26.
CPL Pubid: 175418

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)