Computing Skinning Weights via Convex Duality
Name
Computer Graphics Forum - 2025 - Solomon - Computing Skinning Weights via Convex Duality.pdf
Description
Published version
Size
1.44 MB
Format
Adobe PDF
Checksum (MD5)
700457dc275ba70d93094884324181d8
Author(s)
Solomon, J
Stein, O
Date Issued
September 25, 2025
Journal
Computer Graphics Forum
Publisher
Wiley
Citation
Solomon, J. and Stein, O. (2025), Computing Skinning Weights via Convex Duality. Computer Graphics Forum e70159.
Version
Final published version
Abstract
We study the problem of optimising for skinning weights through the lens of convex duality. In particular, we show that the popular bounded biharmonic weight (BBW) model for skinning is dual to a non-negative least-squares problem, which is amenable to efficient solution via iterative algorithms; the final weights are then recoverable via a closed-form expression. Our formulation maintains convexity and is provably equivalent to the original problem. We also provide theoretical discussion giving intuition for the dual problem in the smooth case. Our final algorithm, which can be implemented in a few lines of code, achieves efficient convergence times relative to generic quadratic programming tools applied to the primal problem, without nonconvex formulations, relaxations or specialised optimisation techniques.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1111/cgf.70159
