Spacetime constraints revisited
- 1 September 1993
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 4 (5) , 343-350
- https://doi.org/10.1145/166117.166160
Abstract
The Spacetime Constraints (SC) paradigm, whereby the animator specifies what an animated figure should do but not how to do it,is a very appealing approach to animation. However, the algorithms available for realizing the SC approach are limited. Curren t tech- niques are local in nature: they all use some kind of perturba tional analysis to refine an initial trajectory. We propose a global search algorithm that is capable of generating multiple novel traj ectories for SC problems from scratch. The key elements of our search strategy are a method for encoding trajectories as behavior s, and a genetic search algorithm for choosing behavior parameters that is currently implemented on a massively parallel computer. We de- scribe the algorithm and show computed solutions to SC problems for 2D articulated figures.Keywords
This publication has 6 references indexed in Scilit:
- Interactive spacetime control for animationACM SIGGRAPH Computer Graphics, 1992
- Coping with friction for non-penetrating rigid body simulationACM SIGGRAPH Computer Graphics, 1991
- A 'Notion' for interactive behavioral animation controlIEEE Computer Graphics and Applications, 1990
- Motion interpolation by optimal controlACM SIGGRAPH Computer Graphics, 1988
- Realistic animation of rigid bodiesACM SIGGRAPH Computer Graphics, 1988
- Spacetime constraintsACM SIGGRAPH Computer Graphics, 1988