Optimizing the Collision Detection Pipeline
You can download the
PDF version (270 kB) ...
It is optimized for on-screen viewing (color plots, hyperlinks, lores images).
You can also download the
Postscript version (590 kB).
It is optimized for printing (no color plots, no hyperlinks, but hires images).
A general framework for collision detection is presented.
Then, we look at each stage and compare different approaches by extensive
benchmarks. The results suggest a way to optimize the performance of the
A benchmarking procedure for comparing algorithms checking a pair of
objects is presented and applied to three different hierarchical
algorithms. A new convex algorithm is evaluated and compared with other
approaches to the neighbor-finding problem.
Convex hulls, incremental collision detection,
hierarchical data structures, grid, octree.
Proc. of the First International Game Technology Conference (GTEC),
Hong Kong, 18-21 January 2001.
In case of problems
In case of problems, please don't hesitate to
(For instance, if your host is not registered by the world-wide Domain
Name Service (DNS), then you will not be able to ftp ...)
Sat Sep 10 15:56:08 MDT 2005