Continuous Collision Detection Between Points and Signed Distance Fields

Xu, Hongyi; Barbic, Jernej

Continuous Collision Detection Between Points and Signed Distance Fields

Files

001-007.pdf (1.35 MB)

xubarbicvriphys2014.mp4 (9.43 MB)

Date

2014

Authors

Xu, Hongyi
Barbic, Jernej

Publisher

The Eurographics Association

Abstract

We present an algorithm for fast continuous collision detection between points and signed distance fields. Such robust queries are often needed in computer animation, haptics and virtual reality applications, but have so far only been investigated for polygon (triangular) geometry representations. We demonstrate how to use an octree subdivision of the distance field for fast traversal of distance field cells. We also give a method to combine octree subdivision with points organized into a tree hierarchy, for efficient culling of continuous collision detection tests. We apply our method to multibody rigid simulations, and demonstrate that our method accelerates continuous collision detection between points and distance fields by an order of magnitude.

        @inproceedings{10.2312:vriphys.20141218
,
booktitle = {Workshop on Virtual Reality Interaction and Physical Simulation
},
editor = {Jan Bender and Christian Duriez and Fabrice Jaillet and Gabriel Zachmann
},
title = {{Continuous Collision Detection Between Points and Signed Distance Fields
}},
author = {Xu, Hongyi and 
Barbic, Jernej
},
year = {2014
},
publisher = {The Eurographics Association
},
ISBN = {978-3-905674-71-2
},
DOI = {10.2312/vriphys.20141218
}
}