| AnimationHelper Methods | 
The AnimationHelper type exposes the following members.
| Name | Description | |
|---|---|---|
| Compress | 
            Compresses the specified animation using simple lossy compression algorithm.
              | |
| ComputeAngularVelocity(Matrix33F, Matrix33F, Single) | 
            Computes the angular velocity that rotates an object from the current orientation to a 
            target orientation.
              | |
| ComputeAngularVelocity(QuaternionF, QuaternionF, Single) | 
            Computes the angular velocity that rotates an object from the current orientation to a 
            target orientation.
              | |
| ComputeLinearVelocity | 
            Computes the linear velocity that moves an object from the current position to a 
            target position.
              | |
| GetAncestors | 
            Gets the ancestors of the AnimationInstance in the animation tree.
              | |
| GetDescendants(AnimationInstance) | 
            Gets the descendants of the AnimationInstance in the animation tree using a
            depth-first search.
              | |
| GetDescendants(AnimationInstance, Boolean) | 
            Gets the descendants of the AnimationInstance in the animation tree 
            using either a depth-first or a breadth-first search.
              | |
| GetLeaves | 
            Gets the leaves of the AnimationInstance in the animation tree.
              | |
| GetRoot | 
            Returns the root instance of an animation tree.
              | |
| GetSelfAndAncestors | 
            Gets the AnimationInstance and its ancestors in the animation tree.
              | |
| GetSubtree(AnimationInstance) | 
            Gets the subtree (the given AnimationInstance and all of its descendants in the
            animation tree) using a depth-first search.
              | |
| GetSubtree(AnimationInstance, Boolean) | 
            Gets the subtree (the given AnimationInstance and all of its descendants in the
            animation tree) using either a depth-first or a breadth-first search.
              |