Home    General Programming    Artificial Intelligence    Math    Physics    Graphics    Networking    Audio Programming    
Audio/Visual Design    Game Design    Production    Business of Games    Game Studies    Conferences    Schools    Contact   
Optimizations
Quaternions
Geometry
Randomness
Floating-Point
Splines
Inverse Kinematics
Euler Integration
Collision Detection
All Articles
Game Programming Gems
Game Programming Gems 2
Game Programming Gems 3
Game Programming Gems 4
Game Programming Gems 5
Game Programming Gems 6
Game Programming Gems 7
AI Game Programming Wisdom
AI Game Programming Wisdom 2
AI Game Programming Wisdom 3
AI Game Programming Wisdom 4
GPU Gems
GPU Gems 2
GPU Gems 3
ShaderX
ShaderX2
ShaderX3
ShaderX4
ShaderX5
Massively Multiplayer Game Development
Massively Multiplayer Game Development 2
Secrets of the Game Business
Introduction to Game Development
GDC Proceedings
Game Developer Magazine
Gamasutra


Game Programming Math: Collision Detection


Collision Detection Shader Using Cube-Maps

Rahul Sathe
ShaderX5

Sphere Trees for Speedy BSPs

Dominic Filion (Artificial Mind & Movement)
Game Programming Gems 5

Using the Covariance Matrix for Better-Fitting Bounding Objects

Jim Van Verth (Red Storm Entertainment)
Game Programming Gems 4

Fast Contact Reduction for Dynamics Simulation

Adam Moravanszky, Pierre Terdiman (NovodeX AG)
Game Programming Gems 4

Fast Collision Detection for 3D Bones-Based Articulated Characters

Oliver Heim, Carl S. Marshall, Adam Lake (Intel Corporation)
Game Programming Gems 4

Considerations for Movement and Physics in MMP Games

Jay Lee (NCsoft Corporation)
Massively Multiplayer Game Development

Collision Detection of Deformable Volumetric Meshes

Kenny Erleben and Jon Sporring (University of Copenhagen)
Graphics Programming Methods

Collision Shaders

Takashi Imagire
ShaderX2

Recursive Dimensional Clustering: A Fast Algorithm for Collison Detection

Steve Rabin (Nintendo of America)
Game Programming Gems 2

Sphere Trees for Fast Visibility Culling, Ray Tracing, and Range Searching

John W. Ratcliff (Sony Online Entertainment)
Game Programming Gems 2
Abstract: The article presents an algorithm and demonstration application that manages thousands of objects in motion that are continuously maintained as a collection of hierarchical bounding spheres in a SphereTree. The design goal for this algorithm has been to make the 99-percentile case spend almost no CPU time updating an object in motion within the tree structure. Queries against the SphereTree perform more tests than other data structures, but this is mitigated by the fact that the tree can be maintained using very little CPU time. This data structure is ideally suited for gross culling of massive numbers of moving objects in a large world space. It doesn't matter if the objects are moving at widely disparate speeds, or even if many of them are not in motion at all. It also has a very low cost when objects are inserted and removed from the tree with great frequency.

Compressed Axis-Aligned Bounding Box Trees

Miguel Gomez (Lithtech)
Game Programming Gems 2
Abstract: The axis-aligned bounding box (AABB) tree structure has proven to be very useful for accelerating intersection queries on sets of geometry. The data structure is easy to implement, the built structure is numerically well conditioned, and like all binary trees, they have O(log n) search time. This article explains several techniques that can be used to lower the overall memory footprint of an AABB tree to 11 bytes per triangle.

Direct Access Quadtree Lookup

Matt Pritchard (Ensemble Studios)
Game Programming Gems 2
Abstract: This article presents a general-purpose optimization for quadtree access that improves performance in three ways over the traditional implementations: 1) by eliminating node traversal and the unnecessary cache-misses it causes, 2) by requiring fewer instructions and CPU cycles overall vs. a best case traditional approach, and 3) by doing so in a compact amount of time and with minimal memory accesses regardless of what depth in the tree the target node resides in.

3D Collision Detection

Kevin Kaiser
Game Programming Gems
Abstract: This article will help lay the groundwork for building an accurate physics simulation by starting with one of the most crucial parts of a real-time physics engine: 3D collision detection. The two basic algorithms this article covers are: Bounding Sphere Collision Detection and Triangle-to-Triangle Collision Detection.

Multi-Resolution Maps for Interaction Detection (Collision Detection)

Jan Svarovsky (Mucky Foot Productions)
Game Programming Gems
Abstract: This article describes a method for reducing the number of proximity tests that must be performed for games with large numbers of game objects of varying sizes.

Octree Construction

Dan Ginsburg (ATI Research)
Game Programming Gems

Loose Octrees

Thatcher Ulrich (Slingshot Game Technology)
Game Programming Gems

34% off discount
"Latest from a must have series"
Game
Programming
Gems 7



"Cutting-edge graphics techniques"
GPU Gems 3


"Newest AI techniques from commercial games"
AI Game
Programming
Wisdom 4






Home