CoChat

Bounded biharmonic weights for real-time deformation

Jacobson, Alec, Baran, Ilya, Popović, Jovan, Sorkine, Olga · 2011 · ACM SIGGRAPH 2011 papers

The DOI matches its Crossref record; 37 of the 39 references it cites were found in a registry or an index; none of the 4 sources its claims cite is checked for support yet.

Abstract

Object deformation with linear blending dominates practical use as the fastest approach for transforming raster images, vector graphics, geometric models and animated characters. Unfortunately, linear blending schemes for skeletons or cages are not always easy to use because they may require manual weight painting or modeling closed polyhedral envelopes around objects. Our goal is to make the design and control of deformations simpler by allowing the user to work freely with the most convenient combination of handle types. We develop linear blending weights that produce smooth and intuitive deformations for points, bones and cages of arbitrary topology. Our weights, called bounded biharmonic weights, minimize the Laplacian energy subject to bound constraints. Doing so spreads the influences of the controls in a shape-aware and localized manner, even for objects with complex and concave boundaries. The variational weight optimization also makes it possible to customize the weights so that they preserve the shape of specified essential object features. We demonstrate successful use of our blending weights for real-time deformation of 2D and 3D shapes.

Overview

CoChat Summary

## TL;DR

The paper introduces bounded biharmonic weights, a convex variational method for precomputing blending weights that supports points, bones, and cages for real-time deformation. The method is designed to be smooth, non-negative, partition-of-unity-preserving, and local, and the paper shows it can deform 2D and 3D shapes interactively after bind-time computation.

## Key findings

  • The weights are defined by minimizing Laplacian energy subject to constraints: interpolation on handles, linearity on cage faces, partition of unity, and bounds \(0 \le w_j(p) \le 1\). The resulting Euler-Lagrange equations are biharmonic (\(\Delta^2 w_j = 0\)).
  • In experiments, the authors report that the weights were local and had no spurious local maxima in all tested examples, while unconstrained biharmonic weights can be negative or have extraneous local maxima.
  • The method can preserve specified features by adding a region-based gradient penalty; the paper gives an example where painting a region preserved the shape of an eye during deformation.
  • Reported timing/data examples include 2D meshes taking less than a second to triangulate, and 3D examples where TetGen took a few seconds; for the Armadillo, the input mesh had 43,234 vertices and the tet mesh had 46,898 vertices. Table 2 reports bind-time per handle ranging from \(1.3\times10^{-3}\) s to 12.0870 s across examples.

## Methods

  • The paper formulates deformation weights as a constrained optimization problem minimizing \(\sum_j \frac12 \int_\Omega \|\Delta w_j\|^2 dV\), with constraints for handle interpolation, cage-face linearity, partition of unity, and bounds.
  • It discretizes the problem with linear finite elements on a triangle/tetrahedral mesh, then solves the resulting quadratic program with MOSEK; Triangle is used for 2D meshing and TetGen for 3D meshing.
  • For faster precomputation, the authors also test solving each handle independently and normalizing afterward, dropping the partition-of-unity constraint.

## Limitations

  • The paper states that bind-time optimization is a limitation, and that generating bounded biharmonic weights in 3D requires discretizing the volume.
  • The method does not have linear precision, which the paper notes is necessary for some cage-based deformations that rely on interpolating cage vertices; this is an explicit limitation stated in the text.
  • Evident from the text: the method is not always smooth at skeletal joints and cage vertices because the imposed constraints create discontinuities there; the paper says this does not harm the resulting deformations at joints, but it is still a limitation of the weight functions themselves.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1145/1964921.1964973

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 Valid · 2 Not valid · 2 Not checked · 21 Own results and interpretations

6 more claims

Create a free account to see all 25 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 8
  • It may state two separate claims as one. 8

Create a free account to see these claims.

Citations

Cites

Show all 37 references

Research works printed but not linked: 7

  1. 10.5555/1281957.1281959 · doi:10.5555/1281957.1281959
  2. 10.1016/S0167-8396(02)00002-5 · doi:10.1016/s0167-8396(02)00002-5
  3. 10.5555/1731309.1731339 · doi:10.5555/1731309.1731339
  4. 10.5555/1281991.1282007 · doi:10.5555/1281991.1282007
  5. 10.5555/645908.673287 · doi:10.5555/645908.673287
  6. Sibson, R. 1981. Interpolating multivariate data. John Wiley & Sons, ch. A brief description of natural neighbor interpolation, 21--36.
  7. 10.5555/1281991.1282006 · doi:10.5555/1281991.1282006

Cited by

See all 265

Metadata

Authors
Jacobson, A., Baran, I., Popović, J., & Sorkine, O.
Affiliations
  • New York University (US)
  • Walt Disney (Switzerland) (CH)
  • Adobe Systems (United States) (US)
  • New York University and ETH Zurich
Venue
ACM SIGGRAPH 2011 papers
Publisher
ACM
Published
2011-07-25
Pages
1-8
OpenAlex
W2008535862
Cited by
258
References
39
Citations by year
2026: 1 · 2025: 2 · 2023: 1 · 2022: 4 · 2021: 16 · 2020: 20 · 2019: 16 · 2018: 23 · 2017: 20 · 2016: 39 · 2015: 31 · 2014: 23 · 2013: 35 · 2012: 22
FWCI
49.87
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGGRAPH Conference (SIGGRAPH) (publishedVersion)
Funders
Division of Information and Intelligent Systems (IIS-0905502)
Topics
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › 3D Shape Modeling and Analysis
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Human Motion and Animation
Keywords
linear blending, real-time deformation, bound constraints, shape preservation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Bounded biharmonic weights for real-time deformation. https://app.cochat.ai/papers/10.1145/1964921.1964973
The paper
Jacobson, A., Baran, I., Popović, J., & Sorkine, O. (2011). Bounded biharmonic weights for real-time deformation. ACM SIGGRAPH 2011 papers. https://doi.org/10.1145/1964921.1964973

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.