Fast and exact continuous collision detection with Bernstein sign classification
Abstract
We present fast algorithms to perform accurate CCD queries between triangulated models. Our formulation uses properties of the Bernstein basis and Bézier curves and reduces the problem to evaluating signs of polynomials. We present a geometrically exact CCD algorithm based on the exact geometric computation paradigm to perform reliable Boolean collision queries. Our algorithm is more than an order of magnitude faster than prior exact algorithms. We evaluate its performance for cloth and FEM simulations on CPUs and GPUs, and highlight the benefits.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Nov 19, 2014
- Source ID
- 10.1145/2661229.2661237
Entities
People
- Dinesh Manocha
- Min Tang
- Ruofeng Tong
- Zhendong Wang
Organizations
- Army Research Office
- Chinese Academy of Sciences
- Intel Corporation
- Ministry of Education of the People's Republic of China
- Ministry of Science and Technology of the People's Republic of China
- National Institutes of Health
- National Natural Science Foundation of China
- Nvidia
- University of North Carolina at Chapel Hill
- Zhejiang University