神经隐式曲面用于物理模拟中的高效和精确碰撞
Neural Implicit Surfaces for Efficient and Accurate Collisions in Physically Based Simulations
摘要:
计算机图形学领域的当前趋势提出利用GPU的大规模并行计算能力来加速基于物理的模拟。碰撞检测和解决是这个过程的基本部分。它也是基于物理的模拟中最重要的瓶颈,随着场景中顶点数量的增加,它很容易变得棘手。蛮力方法在计算时间和内存占用方面都有二次增长。虽然它们的并行化在GPU中是微不足道的,但它们的复杂性阻碍了使用这种方法。加速结构(如BVH)通常用于提高性能,实现单个点查询的对数计算时间。尽管如此,它们的内存占用也迅速增长,并且由于它们的分支性质,它们在GPU中的并行化是有问题的。我们建议在基于物理的模拟中使用通过深度学习学习的隐式表面表示进行碰撞处理。我们提出的体系结构的复杂度为O(n)--或者对于单点查询为O(1)--并且没有并行化问题。我们将展示如何在基于物理的模拟中准确有效地处理碰撞,更具体地说,是针对布料。在我们的实验中,我们在300毫秒内查询多达1 M个点。
英文摘要:
Current trends in the computer graphics community propose leveraging the massive parallel computational power of GPUs to accelerate physically based simulations. Collision detection and solving is a fundamental part of this process. It is also the most significant bottleneck on physically based simulations and it easily becomes intractable as the number of vertices in the scene increases. Brute force approaches carry a quadratic growth in both computational time and memory footprint. While their parallelization is trivial in GPUs, their complexity discourages from using such approaches. Acceleration structures -- such as BVH -- are often applied to increase performance, achieving logarithmic computational times for individual point queries. Nonetheless, their memory footprint also grows rapidly and their parallelization in a GPU is problematic due to their branching nature. We propose using implicit surface representations learnt through deep learning for collision handling in physically based simulations. Our proposed architecture has a complexity of O(n) -- or O(1) for a single point query -- and has no parallelization issues. We will show how this permits accurate and efficient collision handling in physically based simulations, more specifically, for cloth. In our experiments, we query up to 1M points in 300 milliseconds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。