loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computer Animation 2002
Spacetime Sweeping: An Interactive Dynamic Constraints Solver
Geneva, Switzerland
June 19-June 21
ISBN: 0-7695-1594-0
Seyoon Tak, Seoul National University
Oh-young Song, Seoul National University
Hyeong-Seok Ko, Seoul National University
This paper presents a new method for editing an existing motion to satisfy a set of user-specified constraints, and in doing so guaranteeing the kinematic and dynamic soundness of the transformed motion. We cast the motion editing problem as a constrained state estimation problem based on the per-frame Kalman filter framework. To handle various kinds of kinematic and dynamic constraints in a scalable fashion, we develop a new algorithm called spacetime sweeping, which sweeps through the frames with two consecutive filters. The unscented Kalman (UK) filter estimates an optimal pose for the current frame that conforms to the given constraints, and feeds the result to the least-squares (LS) filter. Then, the LS filter resolves the inter-frame inconsistencies introduced by the UK filter due to the independent handling of the position, velocity, and acceleration. The per-frame approach of the spacetime sweeping provides a surprising performance gain. It is remarkable that now editing of motion that involves dynamic constraints such as dynamic balancing can be done interactively.
Citation:
Seyoon Tak, Oh-young Song, Hyeong-Seok Ko, "Spacetime Sweeping: An Interactive Dynamic Constraints Solver," ca, pp.261, Computer Animation 2002, 2002
Usage of this product signifies your acceptance of the Terms of Use.