Building Collision Simulations - An Introduction to Computer Graphics

Dive into the world of computer graphics with this comprehensive 28-minute video that introduces collision detection systems in video games and simulations. Learn the fundamentals of animation before exploring discrete and continuous collision detection techniques. Discover how to implement these concepts in simple particle simulations and tackle the challenges of scaling up to more complex systems. Explore optimization strategies for efficient collision detection, including the sweep and prune algorithm, uniform grids, K-D trees, and bounding volume hierarchies. Follow along with detailed explanations, visual demonstrations, and practical implementations to gain a solid understanding of building collision simulations. Perfect for aspiring game developers, computer graphics enthusiasts, and anyone interested in the technical aspects of interactive simulations.

Introduction
Intro to Animation
Discrete Collision Detection and Response
Implementation
Discrete Collision Detection Limitations
Continuous Collision Detection
Two Particle Simulations
Scaling Up Simulations
Sweep and Prune Algorithm
Uniform Grid Space Partitioning
KD Trees
Bounding Volume Hierarchies
Recap
Correction: At , the linear interpolation equations should be xt = t * x1 + 1 - t * x0 and yt = t * y1 + 1 - t * y0. All subsequent derivations have the x0 switched with x1. All y0 should also be switched with y1 for the same reason.
Minor correction: p.vel is updated and used in the next line at , p.vel and p.pos should be updated simultaneously