Game Development Reference
In-Depth Information
the first ten weeks. 9 Special thanks goes to the hardworking Naughty Dogs who
let me realize the dream of writing the physics engine for Uncharted .
Bibliography
[Choi et al. 05] Yi-King Choi, Xueqing Li, Wenping Wang, and Stephen
Cameron. “Collision Detection of Convex Polyhedra Based on Duality
Transformation.” Technical Report TR-2005-01, Hong Kong University
Computer Science Department, 2005. Available at http://www.cs.hku.hk/
research/techreps/document/TR-2005-01.pdf.
[Dobkin and Kirkpatrick 90] David P. Dobkin and David G. Kirkpatrick. “Deter-
mining the Separation of Preprocessed Polyhedra—AUnified Approach.” In
ICALP '90: Proceedings of the 17th International Colloquium on Automata,
Languages and Programming , pp. 400-413. London, UK: Springer-Verlag,
1990.
[Fogel and Halperin 07] Efi Fogel and Dan Halperin. “Exact and Efficient Con-
struction of Minkowski Sums of Convex Polyhedra with Applications.”
Comput. Aided Des. 39:11 (2007), 929-940.
[Ganjugunte 07] Shashidhara K. Ganjugunte. “A Survey on Techniques for Com-
puting Penetration Depth.”, 2007.
[O'Rourke 98] Joseph O'Rourke. “Comp.Graphics.Algorithms Frequently
Asked Questions: Section 2. 2D Polygon Computations.” Available online
( http://www.faqs.org/faqs/graphics/algorithms-faq/), 1998.
[Shamos and Hoey 76] Michael Ian Shamos and Dan Hoey. “Geometric Intersec-
tion Problems.” In SFCS '76: Proceedings of the 17th Annual Symposium
on Foundations of Computer Science , pp. 208-215. Washington, DC: IEEE
Computer Society, 1976.
[Snethen 08] Gary Snethen. “XenoCollide: Complex Collision Made Simple.” In
Game Programming Gems 7 , edited by Scott Jacobs, pp. 165-178. Boston:
Charles River Media, 2008.
[Terdiman 08] Pierre Terdiman. “Faster Convex-Convex SAT.” Coder Corner .
Available at http://www.codercorner.com/blog/?p=24, 2008.
9 n4g.com. 2008-01-25.
Search Nedrilad ::




Custom Search