A fast numerical solver for local barycentric coordinates

Computer Aided Geometric Design(2019)

引用 13|浏览332
暂无评分
摘要
The local barycentric coordinates (LBC), proposed in Zhang et al. (2014), demonstrate good locality and can be used for local control on function value interpolation and shape deformation. However, it has no closed-form expression and must be computed by solving an optimization problem, which can be time-consuming especially for high-resolution models. In this paper, we propose a new technique to compute LBC efficiently. The new solver is developed based on two key insights. First, we prove that the non-negativity constraints in the original LBC formulation is not necessary, and can be removed without affecting the solution of the optimization problem. Furthermore, the removal of this constraint allows us to reformulate the computation of LBC as a convex constrained optimization for its gradients, followed by a fast integration to recover the coordinate values. The reformulated gradient optimization problem can be solved using ADMM, where each step is trivially parallelizable and does not involve global linear system solving, making it much more scalable and efficient than the original LBC solver. Numerical experiments verify the effectiveness of our technique on a large variety of models.
更多
查看译文
关键词
Barycentric coordinates,Locality,Local extrema,Integrability,Parallel
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要