Optimization-based animation

Victor Milenkovic, H. Schmidl

Research output: Chapter in Book/Report/Conference proceedingConference contribution

48 Citations (Scopus)

Abstract

Current techniques for rigid body simulation run slowly on scenes with many bodies in close proximity. Each time two bodies collide or make or break a static contact, the simulator must interrupt the numerical integration of velocities and accelerations. Even for simple scenes, the number of discontinuities per frame time can rise to the millions. An efficient optimization-based animation (OBA) algorithm is presented which can simulate scenes with many convex three-dimensional bodies settling into stacks and other "crowded" arrangements. This algorithm simulates Newtonian (second order) physics and Coulomb friction, and it uses quadratic programming (QP) to calculate new positions, momenta and accelerations strictly at frame times. Contact points are synchronized at the end of each frame. The extremely small integration steps inherent to traditional simulation techniques are avoided. Non-convex bodies are simulated as unions of convex bodies. Links and joints are simulated successfully with bi-directional constraints. A hybrid of OBA and retroactive detection (RD) has been implemented as well. A review of existing work finds no other packages that can simulate similarly complex scenes in a practical amount of time.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGGRAPH Conference on Computer Graphics
Pages37-46
Number of pages10
StatePublished - 2001
EventComputer Graphics Annual Conference (SIGGRAPH 2001) - Los Angeles, CA, United States
Duration: Aug 12 2001Aug 17 2001

Other

OtherComputer Graphics Annual Conference (SIGGRAPH 2001)
CountryUnited States
CityLos Angeles, CA
Period8/12/018/17/01

Fingerprint

Animation
Quadratic programming
Point contacts
Momentum
Physics
Simulators
Friction

Keywords

  • Animation
  • Animation w/Constraints
  • Physically Based Animation
  • Physically Based Modeling
  • Scientific Visualization
  • Solid Modeling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Milenkovic, V., & Schmidl, H. (2001). Optimization-based animation. In Proceedings of the ACM SIGGRAPH Conference on Computer Graphics (pp. 37-46)

Optimization-based animation. / Milenkovic, Victor; Schmidl, H.

Proceedings of the ACM SIGGRAPH Conference on Computer Graphics. 2001. p. 37-46.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Milenkovic, V & Schmidl, H 2001, Optimization-based animation. in Proceedings of the ACM SIGGRAPH Conference on Computer Graphics. pp. 37-46, Computer Graphics Annual Conference (SIGGRAPH 2001), Los Angeles, CA, United States, 8/12/01.
Milenkovic V, Schmidl H. Optimization-based animation. In Proceedings of the ACM SIGGRAPH Conference on Computer Graphics. 2001. p. 37-46
Milenkovic, Victor ; Schmidl, H. / Optimization-based animation. Proceedings of the ACM SIGGRAPH Conference on Computer Graphics. 2001. pp. 37-46
@inproceedings{4764e6ac068840a788c14a5899251019,
title = "Optimization-based animation",
abstract = "Current techniques for rigid body simulation run slowly on scenes with many bodies in close proximity. Each time two bodies collide or make or break a static contact, the simulator must interrupt the numerical integration of velocities and accelerations. Even for simple scenes, the number of discontinuities per frame time can rise to the millions. An efficient optimization-based animation (OBA) algorithm is presented which can simulate scenes with many convex three-dimensional bodies settling into stacks and other {"}crowded{"} arrangements. This algorithm simulates Newtonian (second order) physics and Coulomb friction, and it uses quadratic programming (QP) to calculate new positions, momenta and accelerations strictly at frame times. Contact points are synchronized at the end of each frame. The extremely small integration steps inherent to traditional simulation techniques are avoided. Non-convex bodies are simulated as unions of convex bodies. Links and joints are simulated successfully with bi-directional constraints. A hybrid of OBA and retroactive detection (RD) has been implemented as well. A review of existing work finds no other packages that can simulate similarly complex scenes in a practical amount of time.",
keywords = "Animation, Animation w/Constraints, Physically Based Animation, Physically Based Modeling, Scientific Visualization, Solid Modeling",
author = "Victor Milenkovic and H. Schmidl",
year = "2001",
language = "English (US)",
pages = "37--46",
booktitle = "Proceedings of the ACM SIGGRAPH Conference on Computer Graphics",

}

TY - GEN

T1 - Optimization-based animation

AU - Milenkovic, Victor

AU - Schmidl, H.

PY - 2001

Y1 - 2001

N2 - Current techniques for rigid body simulation run slowly on scenes with many bodies in close proximity. Each time two bodies collide or make or break a static contact, the simulator must interrupt the numerical integration of velocities and accelerations. Even for simple scenes, the number of discontinuities per frame time can rise to the millions. An efficient optimization-based animation (OBA) algorithm is presented which can simulate scenes with many convex three-dimensional bodies settling into stacks and other "crowded" arrangements. This algorithm simulates Newtonian (second order) physics and Coulomb friction, and it uses quadratic programming (QP) to calculate new positions, momenta and accelerations strictly at frame times. Contact points are synchronized at the end of each frame. The extremely small integration steps inherent to traditional simulation techniques are avoided. Non-convex bodies are simulated as unions of convex bodies. Links and joints are simulated successfully with bi-directional constraints. A hybrid of OBA and retroactive detection (RD) has been implemented as well. A review of existing work finds no other packages that can simulate similarly complex scenes in a practical amount of time.

AB - Current techniques for rigid body simulation run slowly on scenes with many bodies in close proximity. Each time two bodies collide or make or break a static contact, the simulator must interrupt the numerical integration of velocities and accelerations. Even for simple scenes, the number of discontinuities per frame time can rise to the millions. An efficient optimization-based animation (OBA) algorithm is presented which can simulate scenes with many convex three-dimensional bodies settling into stacks and other "crowded" arrangements. This algorithm simulates Newtonian (second order) physics and Coulomb friction, and it uses quadratic programming (QP) to calculate new positions, momenta and accelerations strictly at frame times. Contact points are synchronized at the end of each frame. The extremely small integration steps inherent to traditional simulation techniques are avoided. Non-convex bodies are simulated as unions of convex bodies. Links and joints are simulated successfully with bi-directional constraints. A hybrid of OBA and retroactive detection (RD) has been implemented as well. A review of existing work finds no other packages that can simulate similarly complex scenes in a practical amount of time.

KW - Animation

KW - Animation w/Constraints

KW - Physically Based Animation

KW - Physically Based Modeling

KW - Scientific Visualization

KW - Solid Modeling

UR - http://www.scopus.com/inward/record.url?scp=0035148846&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035148846&partnerID=8YFLogxK

M3 - Conference contribution

SP - 37

EP - 46

BT - Proceedings of the ACM SIGGRAPH Conference on Computer Graphics

ER -