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.

中文翻译：

---

使用 Bernstein 标志分类进行快速、准确的连续碰撞检测


我们提出了快速算法来在三角模型之间执行准确的 CCD 查询。我们的公式使用伯恩斯坦基和贝塞尔曲线的属性，并将问题简化为评估多项式的​​符号。我们提出了一种基于精确几何计算范式的几何精确 CCD 算法，以执行可靠的布尔碰撞查询。我们的算法比之前的精确算法快一个数量级以上。我们评估了其在 CPU 和 GPU 上进行布料和 FEM 模拟的性能，并强调了其优势。