As-rigid-as-possible shape manipulation
Abstract
We present an interactive system that lets a user move and deform a two-dimensional shape without manually establishing a skeleton or freeform deformation (FFD) domain beforehand. The shape is represented by a triangle mesh and the user moves several vertices of the mesh as constrained handles. The system then computes the positions of the remaining free vertices by minimizing the distortion of each triangle. While physically based simulation or iterative refinement can also be used for this purpose, they tend to be slow. We present a two-step closed-form algorithm that achieves real-time interaction. The first step finds an appropriate rotation for each triangle and the second step adjusts its scale. The key idea is to use quadratic error metrics so that each minimization problem becomes a system of linear equations. After solving the simultaneous equations at the beginning of interaction, we can quickly find the positions of free vertices during interactive manipulation. Our approach successfully conveys a sense of rigidity of the shape, which is difficult in space-warp approaches. With a multiple-point input device, even beginners can easily move, rotate, and deform shapes at will.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In contrast to previous techniques [Igarashi et al. 2005; Joshi et al. 2007], our approach deforms shapes smoothly even when the handle transformations are large.
“In contrast to previous techniques [Igarashi et al. 2005; Joshi et al. 2007], our approach deforms shapes smoothly even when the handle transformations are large.”
From Bounded biharmonic weights for real-time deformation (2011) · cites this paper as Igarashi et al. 2005
Cited by
Sorted by citations
Automatic rigging and animation of 3D characters
Baran, I., & Popović, J. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276467 · Cited by 495 · see citing works
Automatic rigging and animation of 3D characters
Baran, I., & Popović, J. (2007) · ACM Transactions on Graphics · doi:10.1145/1276377.1276467 · Cited by 455 · see citing works
Learning Depth with Convolutional Spatial Propagation Network
Cheng, X., Wang, P., & Yang, R. (2018) · arXiv · doi:10.48550/arxiv.1810.02695 · Cited by 345 · see citing works
Bounded biharmonic weights for real-time deformation
Jacobson, A., Baran, I., Popović, J., & Sorkine, O. (2011) · ACM SIGGRAPH 2011 papers · doi:10.1145/1964921.1964973 · Cited by 258 · see citing works
The Tangible Desktop: A Multimodal Approach to Nonvisual Computing
Baldwin, M. S., Hayes, G. R., Haimson, O. L., Mankoff, J., & Hudson, S. E. (2017) · ACM Transactions on Accessible Computing · doi:10.1145/3075222 · Cited by 37 · see citing works
- Authors
- Igarashi, T., Moscovich, T., & Hughes, J. F.
- Affiliations
- The University of Tokyo (JP)
- Brown University (US)
- ORCID
- Igarashi, Takeo
- Venue
- ACM Transactions on Graphics
- Published
- 2005-07
- Volume
- 24
- Issue
- 3
- Pages
- 1134-1141
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2059017188
- Cited by
- 675
- References
- 0
- Citations by year
- 2026: 10 · 2025: 16 · 2024: 21 · 2023: 22 · 2022: 22 · 2021: 31 · 2020: 19 · 2019: 18 · 2018: 31 · 2017: 33 · 2016: 45 · 2015: 35 · 2014: 41 · 2013: 45 · 2012: 54
- FWCI
- 47.23
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM Transactions on Graphics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Physical Sciences › Engineering › Computational Mechanics › 3D Shape Modeling and Analysis
- Physical Sciences › Computer Science › Human-Computer Interaction › Interactive and Immersive Displays
- Keywords
- as-rigid-as-possible deformation, closed-form algorithm, real-time interaction, systems of linear equations
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.
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