Transcript PowerPoint
Animation CS 551 / 651 Final Review Logistics Exam will be released Friday at 9:00 a.m. • Electronically available (not sure how yet so check your email) – Programming may be required – Open book • You will “check out” the test for 24 hours… you choose when Test-taking materials You can use any materials except your classmates during the exam Be mindful that others may be taking the exam later than you and you shouldn’t be overheard talking about your answers Content Everything during the semester • The class web page is very complete • Programming Assignments The test will give you opportunity to convince me that you understand material from papers this semester Have everything read beforehand General nature of exam Open-ended questions are impossible to grade because there is no one right answer and allocating partial credit is difficult • How would you implement this… • Why is technique A better than technique B Questions will be more focused on details • Explain what effect a has in paper Foo • What is the Lagrangian? • Where have we seen the Strongly Connected Component this semester and what did it accomplish? Major topics Physical Simulation • Hecker articles (Assignment 1) • Numerical integration • Sources of error (class lectures) • Speedup (Mirtich) Major topics Controllers • Optimal (Chenney-00, Gleicher-92, Witkin, Grzeszczuk) • Learning reactive controllers – Offline trial and error (Sims) – User-guided (Metoyer) • Multiagent (Tu, Reynolds, Helbing) • Last assignment Major topics Data-driven Animation • Markov chain (Schodl, Kovar, Lee) • Reusing (Gleicher-98, Metoyer) • Generalizing (Grzeszczuk) • Simulation level of detail (Brogan) • Clean-up (O’Brien) Major topics Inverse Kinematics • Class lectures • Handouts (Parent and Numerical Recipes) • Assignment Major Topics Optimization • Spacetime constraints (Gleicher-92, Witkin, Popovic, Gleicher98) • Neural Networks (Grzeszczuk) • Markov Chain Monte Carlo (Chenney-00) • Least squares (O’Brien) • Lagrangian (Gleicher-92) • Genetic algorithms (Sims) • Simulated Annealing (Hodgins) Major topics Optimization (cont.) • Dynamic Programming (Schodl) • Strongly Connected Components (Kovar, Lee) • Bayesian Classification (Metoyer) • A* (Pinter) Major topics Perception • Using head-mounted displays Major Topics Biomechanics • Swinging (Walker) • Bicycling (Jones) • Walking (articles from Nature)