USC Logo Continuous Collision Detection Between Points and
Signed Distance Fields
Workshop on Virtual Reality Interaction and Physical Simulation VRIPHYS (2014)

Distance field traversal

People

Project material

Citation

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.

Comments, questions to Jernej Barbič.

Related projects

Funding

Disclaimer

Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.

Copyright notice

The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Unique accesses:

web analytics