next up previous contents
Next: 5.4 Constraining the Weights Up: 5 Forces and Constraints Previous: 5.2 Linear Constraints

5.3 Nonlinear Constraints

It is possible to impose nonlinear geometric (equality) constraints

  equation379

on D-NURBS through Lagrange multiplier techniques [32]. This approach increases the number of degrees of freedom, hence the computational cost, by adding unknowns tex2html_wrap_inline2133 --also known as Lagrange multipliers--which determine the magnitudes of the constraint forces. The method is applied to the B-spline model in [6, 42]. The augmented Lagrangian method [18] combines the Lagrange multipliers with the simpler penalty method [26].

One of the best known techniques for applying constraints to dynamic models is the Baumgarte stabilization method [1] which solves constrained equations of motion through linear feedback control (see also [17, 25]). We augment (17) as follows:

equation389

where tex2html_wrap_inline2135 are generalized forces stemming from the holonomic constraint equations. The term tex2html_wrap_inline2137 is the transpose of the constraint Jacobian matrix and tex2html_wrap_inline2139 is a vector of Lagrange multipliers that must be determined. We can obtain the same number of equations as unknowns, by differentiating (24) twice with respect to time: tex2html_wrap_inline2141 . Baumgart's method replaces these additional equations with equations that have similar solutions, but which are asymptotically stable; e.g., the damped second-order differential equations tex2html_wrap_inline2143 , where a and b are stabilization factors. For a given value of a, we can choose b = a to obtain the critically damped solution tex2html_wrap_inline2153 which has the quickest asymptotic decay towards constraint satisfaction (24). Taking the second time derivative of (24) and rearranging terms yields

equation395

We arrive at the following system of equations for the unknown constrained generalized accelerations and Lagrange multipliers:

  equation399

This system can be solved for tex2html_wrap_inline2155 and tex2html_wrap_inline2157 using standard direct or iterative techniques (or in the least squares sense when it is overdetermined by conflicting constraints).



Demetri Terzopoulos | Source Reference