Article ID Journal Published Year Pages File Type
442455 Graphical Models 2013 10 Pages PDF
Abstract

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.

Graphical abstractFigure optionsDownload full-size imageDownload as PowerPoint slide

Related Topics
Physical Sciences and Engineering Computer Science Computer Graphics and Computer-Aided Design
Authors
, , ,