Publication

Fast Iterative Refinement of Articulated Solid Dynamics

IEEE Trans. Vis. Comput. Graph., 5 (3), 268–276, 1999.
Download the publication :
A new dynamics algorithm for articulated solid animation is presented. It provides enhancements of computational efficiency and accuracy control with respect to previous solutions. Iterative refinement allows us to perform interactive animations which could be only computed off-line using previous methods. The efficiency results from managing two sets of constraints associated with the kinematic graph, and proceeding in two steps. First, the acyclic constraints are solved in linear time. An iterative process then reduces the closed loop errors while maintaining the acyclic constraints. This allows the user to efficiently trade off accuracy for computation time. We analyze the complexity and investigate practical efficiency compared with other approaches. In contrast with previous research, we present a single method which is computationally efficient for acyclic bodies as well as for mesh-like bodies. The accuracy control is provided by the iterative improvement performed by the algorithm and also from the existence of two constraint priority levels induced by the method. Used in conjunction with a robust integration scheme, this new algorithm allows the interactive animation of scenes containing a few thousand geometric constraints, including closed loops. It has been successfully applied to real- time simulations.

Images and Movies

 

BibTex References

@article{Fau99,
author = {Fran\c{c}ois Faure},
title = {Fast Iterative Refinement of Articulated Solid Dynamics},
journal = {IEEE Trans. Vis. Comput. Graph.},
volume = 5,
number = {3},
pages = {268--276},
month = jul,
year = 1999
}

Other Publications

 

Publication Management (Restricted Area)

 
Modify this publication
 
Add a new publication:
Article
Livre
Conférence
Chapitre de livre
Acte de congrès
Rapport de thèse (de master, de stage...)
Logiciel
Rapport technique (de recherche, de contrat...)
Séminaire
 
For any questions, contact Brigitte Bidegaray.