Authors: R. Mukundan
Addresses: Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand
Abstract: The cyclic coordinate descent (CCD) is a well-known algorithm used for inverse kinematics solutions in applications involving joint chains and moving targets. Even though a CCD algorithm can be easily implemented, it can take a series of iterations before converging to a solution and also generate undesirable joint rotations. This paper presents a novel single-pass algorithm that is fast and eliminates problems associated with improper and large angle rotations. Experimental results are presented to show the performance benefits of the proposed algorithm over CCD and the |triangulation| methods, using different types of cost functions.
Keywords: character animation; cyclic coordinate descent; CCD; goal-directed motion; inverse kinematics; joint chains; moving targets.
International Journal of Computer Applications in Technology, 2009 Vol.34 No.4, pp.303 - 308
Published online: 25 Mar 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article