可列斯基分解
撕裂
计算机科学
架空(工程)
计算
最小度算法
基质(化学分析)
不完全Cholesky因式分解
刮擦
因子(编程语言)
多边形网格
因式分解
拓扑(电路)
算法
计算科学
并行计算
数学优化
数学
计算机图形学(图像)
工程类
机械工程
物理
程序设计语言
特征向量
复合材料
组合数学
材料科学
量子力学
作者
Jing Li,Tiantian Liu,Ladislav Kavan,Baoquan Chen
标识
DOI:10.1145/3478513.3480505
摘要
We propose a new algorithm for updating a Cholesky factorization which speeds up Projective Dynamics simulations with topological changes. Our approach addresses an important limitation of the original Projective Dynamics, i.e., that topological changes such as cutting, fracturing, or tearing require full refactorization which compromises computation speed, especially in real-time applications. Our method progressively modifies the Cholesky factor of the system matrix in the global step instead of computing it from scratch. Only a small amount of overhead is added since most of the topological changes in typical simulations are continuous and gradual. Our method is based on the update and downdate routine in CHOLMOD, but unlike recent related work, supports dynamic sizes of the system matrix and the addition of new vertices. Our approach allows us to introduce clean cuts and perform interactive remeshing. Our experiments show that our method works particularly well in simulation scenarios involving cutting, tearing, and local remeshing operations.
科研通智能强力驱动
Strongly Powered by AbleSci AI