Patent US6608631B1 successfully refreshed from Google Patents.
← Back to Patent Explorer
US6608631B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Method, apparatus, and computer program product for geometric warps and deformations

Assignee: Pixar Animation Studios
•
Filing: 2000-05-02
•
Granted: 2003-08-19
•
Expires: 2020-05-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Techniques for geometric deformations in computer graphics are described, including a flexible and general modular methodology for constructing, analyzing, and evaluating geometric warps and deformations. Described techniques include establishing a set of source/target features (and related information) or parameter set for controlling deformation of a graphical model; a set of strength fields are established for controlling how strongly the transformation caused by the mapping of source feature to target feature will be applied to model points. A set of weighting fields modulates the influence of multiple source/target feature mappings on model points. Also described are variations on this technique that allow achieving results similar to conventional methods and additional functionality.

Inventors

  • 👤 Timothy S. Milliron

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 23:29
CPC Classifications
G; G06; G06T; G06T13/00; G06T17/00; G06T17/20; G06T17/30; G06T2210/00; G06T2210/16; G06T2210/21; G06T2210/44

Claims Analysis

Total Claims: 21
Claim 1
Independent Claim 178 words
A computer-implemented method for generating graphical warps or deformations through transformation of an undeformed model to a deformed model, said computer-implemented method comprising: receiving said undeformed model and a set of feature specifications each of said set of feature specifications comprising a source feature, a target feature, and related deformation parameters; receiving a set of transformations corresponding to said set of feature specifications and for mapping said source feature to said target feature in each of said set of feature specifications; receiving a set of strength fields corresponding to said set of feature specifications and defined over said undeformed model for scaling the magnitude of each of said set of transformations, establishing a set of scaled transformations; receiving a set of weighting fields corresponding to said set of feature specifications and defined over said undeformed model for determining the relative influence of said set of scaled transformations; computing a sum of said set of scaled transformations weighted by said set of weighting fields, for deforming said undeformed model to generate said deformed model; and returning said deformed model.
Claim 2
Dependent Claim 178 words
A computer-implemented method for generating graphical warps or deformations through transformation of an undeformed model to a deformed model, said computer-implemented method comprising: receiving said undeformed model and a set of feature specifications each of said set of feature specifications comprising a source feature, a target feature, and related deformation parameters; receiving a set of transformations corresponding to said set of feature specifications and for mapping said source feature to said target feature in each of said set of feature specifications; receiving a set of strength fields corresponding to said set of feature specifications and defined over said undeformed model for scaling the magnitude of each of said set of transformations, establishing a set of scaled transformations; receiving a set of weighting fields corresponding to said set of feature specifications and defined over said undeformed model for determining the relative influence of said set of scaled transformations; computing a sum of said set of scaled transformations weighted by said set of weighting fields, for deforming said undeformed model to generate said deformed model; and returning said deformed model.
Claim 3
Dependent Claim 94 words
The computer-implemented method according to claim 1 wherein at least one of said set of feature specifications is continuous and has corresponding parameterized strength field, transformation, and weighting field, and further comprising: receiving a sampling function for discretizing said parameterized transformation and sampling said strength field and said weighting field; computing a discretized transformation, a sampled strength field, and a sampled weighting field with said sampling function; and wherein said step of computing a sum of said set of scaled transformations employs said discretized transformation, said sampled strength field, and said sampled weighting field.
Claim 4
Dependent Claim 51 words
The computer-implemented method according to claim 2 wherein said set of feature specifications, said set of transformations, said set of strength fields, said set of weighting fields, and said sampling function are received by a combined function that computes said discretized transformation, said sampled strength field, and said sampled weighting field.
Claim 5
Dependent Claim 57 words
The computer-implemented method according to claim 1 wherein: said set of feature specifications comprises a plurality of line segment features; said set of transformations corresponding to said plurality of line segment features map source coordinate frames to target coordinate frames; and said set of weighting fields corresponding said plurality of line segment features fall off with distance.
Claim 6
Dependent Claim 31 words
The computer-implemented method according to claim 4 wherein: said set of weighting fields give influence to line segment features in said plurality of line segment features in relation to their length.
Claim 7
Dependent Claim 51 words
The computer-implemented method according to claim 4 wherein: said source coordinate frames comprise a constrained basis vector and an unconstrained basis vector and wherein said unconstrained basis vector is selected responsive to a weighted sum of the vectors perpendicular to the constrained basis vector for each of said target coordinate frames.
Claim 8
Dependent Claim 62 words
The computer-implemented method according to claim 1 wherein: said set of feature specifications comprises control points in an at least two dimensional lattice; said at least two dimensional lattice having an associated local coordinate system; said set of weighting fields corresponding to said control points comprise Bernstein polynomials with arguments comprising points of said undeformed model represented in said local coordinate system.
Claim 9
Dependent Claim 84 words
The computer-implemented method according to claim 1 wherein: said set of feature specifications comprises an oriented point in an least two dimensional lattice; said at least two dimensional lattice having an associated local coordinate system; the transformation in said set of transformations corresponding to said oriented maps a source coordinate frame to a target coordinate frames; and said set of weighting fields corresponding to said oriented points comprise Bernstein polynomials with arguments comprising points of said undeformed model represented in said local coordinate system.
Claim 10
Dependent Claim 17 words
The computer-implemented method according to claim 1 wherein: said set of transformations comprises a geometrically parameterized transformation.
Claim 11
Dependent Claim 29 words
The computer-implemented method according to claim 9 wherein: said set of transformations comprises plural geometrically parameterized transformations; and said set of strength fields modulate said plural geometrically parameterized transformations.
Claim 12
Dependent Claim 19 words
The computer-implemented method according to claim 10 wherein: said set of weighting fields blend said plural geometrically parameterized transformations.
Claim 13
Dependent Claim 198 words
The computer-implemented method according to claim 1 wherein: at least one of said set of feature specifications comprises a source curve and a target curve; corresponding members of said set of transformations comprise a composition of a translation from points along said source curve to points along said target curve, a rotation taking the tangent at said points along said source curve to the tangent at said points along said target curve, and a scale centered at said points along said source curve; corresponding members of said set of strength fields comprise a falloff function having a domain and a range and monotonically decreasing over said range, and wherein over at least a portion of said domain arguments of said falloff function comprise a distance between points of said undeformed model and point along said source curve and a rate of falloff for said distance; corresponding members of said set of weighting fields comprise a scaled displacement function having a domain and a range, wherein for at least a portion of said domain said scaled displacement function comprises a power of the displacement of elements of said undeformed model by said corresponding members of said set of transformations.
Claim 14
Dependent Claim 39 words
The computer-implemented method according to claim 12 wherein said scaled displacement function comprises a power of the displacement of elements of said undeformed model by said corresponding members of said set of transformations for the entirety of said domain.
Claim 15
Dependent Claim 67 words
The computer-implemented method according to claim 1 wherein: said undeformed model comprises control vertices of a fine surface model; and at least one of said set of feature specifications comprise: a source position and a target position of one or more vertices of a coarse deformation mesh configured for deformation of said fine surface model, and a set of edges incident on said one or more vertices.
Claim 16
Dependent Claim 50 words
The computer-implemented method according to claim 14 wherein: corresponding members of said set of transformations comprise a composition of: a translation mapping said source position to said target position, and at least an approximation of a mapping of said set of edges in said undeformed model to said deformed model.
Claim 17
Dependent Claim 62 words
The computer-implemented method according to claim 15 wherein: corresponding members of said set of weighting fields comprise a falloff function, said falloff function substantially zero at a distal end of each of said set edges incident on said one or more vertices, and said falloff function substantially at its maximum value for arguments proximate to said source positions of said control vertices.
Claim 18
Dependent Claim 113 words
The computer-implemented method according to claim 1 wherein: said undeformed model comprises control vertices of a surface for deformation, wherein source and target features are parameterized as a function that returns a tuple comprising a point and a vector normal to said point; at least one of said set of feature specifications comprises a source region and a target region; corresponding members of said set of transformations comprise a composition of: a translation mapping points on said source region to points on said target region, and a rotation taking said vector normal to said points on said source region to said vector normal to said points on said target region of said surface.
Claim 19
Dependent Claim 29 words
The computer-implemented method according to claim 17 wherein corresponding members of said set of strength fields localize the effect of said set of transformations around said source surface region.
Claim 20
Dependent Claim 77 words
The computer-implemented method according to claim 18 wherein: corresponding members of said set of weighting fields decrease monotonically with corresponding members of said set of strength fields and wherein said set of weighting fields decrease responsive to: a distance between control vertices of said surface for deformation and said point on said surface, and a range for limiting the region of said weighting field, and a rate for controlling the rate of decrease of said weighting field.
Claim 21
Dependent Claim 46 words
The computer-implemented method according to claim 1 wherein: one of said set of feature specifications act with substantially full strength across said undeformed model and corresponding the member of said set of weighting fields dominates weighting contributions of other members of said set of weighting fields.

References Cited (Backward Citations)

US5175808A Cited
US5995110A Cited
US6064393A Cited
US5796400A Cited
US5818452A Cited
US5892691A Cited
US6236403B1 Cited
US6072496A Cited
US6271847B1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2006-08-18 2007-02-17 2007-08-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2010-08-18 2011-02-17 2011-08-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2014-08-18 2015-02-17 2015-08-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag