Computer animation algorithms and techniques
Download
1 / 17

Computer Animation Algorithms and Techniques - PowerPoint PPT Presentation


  • 101 Views
  • Uploaded on

Computer Animation Algorithms and Techniques. Integration. Integration. Given acceleration, compute velocity & position by integrating over time. Projectile. given initial velocity under gravity. Euler integration. For arbitrary function, f(t). Integration – derivative field.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Computer Animation Algorithms and Techniques' - habib


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Computer animation algorithms and techniques
Computer AnimationAlgorithms and Techniques

Integration


Integration

Given acceleration, compute velocity & position by integrating over time


Projectile

given initial velocity under gravity


Euler integration

For arbitrary function, f(t)


Integration – derivative field

For arbitrary function, f(t)



Numeric Integration Methods

(explicit or forward) Euler Integration

2nd order Runga Kutta Integration (Midpoint Method)

4th order Runga Kutta Integration

Implicit (backward) Euler Integration

Semi-implicit Euler Integration


Runge Kutta Integration: 2nd order

Aka Midpoint Method

For unknown function, f(t); known f ’(t)


Step size

Euler Integration

Midpoint Method


Runge Kutta Integration: 4th order

For unknown function, f(t); known f ’(t)


Implicit Euler Integration

For arbitrary function, f(t), find next point whose derivative updates last value to this value: required numeric method (e.g. Newton-Raphson)

Search for point such that negative of tangent points back at original point


Differential equation, initial boundary problem

(implicit/backward)

Euler method

(explicit/forward)

Euler method

e.g. linearize f’ and use Newton-Raphson



Methods specific to update position from acceleration

Heun Method

Verlet Method

Leapfrog Method





ad