线性变分空间设计的逼近理论
On the Approximation Theory of Linear Variational Subspace Design
摘要:
解决大规模的优化运行中往往是一个困难的任务,实时计算机图形应用程序。为了应对这一挑战,模型简化是一种广泛采用的技术。尽管模型简化很有用,但它通常需要一个手工制作的子空间,该子空间跨越一个假设包含理想解决方案的域。对于许多应用,逐个情况地获得这样的子空间是不可能的,或者需要大量的人力劳动,因此对于越来越多的任务不容易具有可扩展的解决方案。我们提出了线性变分子空间设计的大规模约束二次规划,它可以自动计算,没有任何人为干预。我们提供了有意义的近似误差界,证实计算子空间的质量,并证明其经验的成功,在交互式变形建模三角形和四面体网格。
英文摘要:
Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted technique. Despite its usefulness, model reduction often requires a handcrafted subspace that spans a domain that hypothetically embodies desirable solutions. For many applications, obtaining such subspaces case-by-case either is impossible or requires extensive human labors, hence does not readily have a scalable solution for growing number of tasks. We propose linear variational subspace design for large-scale constrained quadratic programming, which can be computed automatically without any human interventions. We provide meaningful approximation error bound that substantiates the quality of calculated subspace, and demonstrate its empirical success in interactive deformable modeling for triangular and tetrahedral meshes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。