3D game engine design: A practical approach to real-time computer graphics, second edition

3D Game Engine Design: A Practical Approach to Real-Time Computer Graphics, Second Edition

Volumn , Issue , 2006, Pages 1-985

  Eberly, David H ^a  

^a Geometric Tools Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GAMES; COMPUTER HARDWARE; HARDWARE; MACHINE DESIGN;

3D GAME ENGINES; COLLISION DETECTION; GAME PROGRAMMING; GRAPHICS ENGINE; GRAPHICS HARDWARE; NEW TECHNOLOGIES; REAL TIME COMPUTER GRAPHICS; SHADER PROGRAMMING;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 84884602392     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (102)

1. E. Andres and M. A. Jacob. The discrete analytical hyperspheres. IEEE Transactions on Visualization and Computer Graphics, 3(1):75–86, 1997.
2. Timo Aila and Ville Miettinen. SurRender Umbra Reference Manual, vol. 2.3, 2001.
3. E. Andres. Discrete circles, rings and spheres. Computer and Graphics, 18(5):695–706, 1994.
4. James Arvo, ed. Graphics Gems II. Academic Press, San Diego, CA, 1991.
5. Milton Abramowitz and Irene A. Stegun. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York, 1965.
6. [Bar01] David Baraff. Physically Based Modeling: Rigid Body Simulation. www.pixar .com/companyinfo/research/pbm2001/notesg.pdf, 2001, 68 pages.
7. [BF01] Richard L. Burden and J. Douglas Faires. Numerical Analysis, 7th ed., Brooks/Cole, Belmont, CA, 2001.
8. James F. Blinn. Models of light reflection for computer synthesized pictures. ACM Computer Graphics (Proceedings of SIGGRAPH 1977), July 1977, pp. 192– 198.
9. Grady Booch. Software Components with Ada: Structures, Tools, and Subsystems. Pearson Benjamin Cummings, San Francisco, CA, 1987.
10. J. E. Bresenham. Algorithm for computer control of a digital plotter. IBM Systems Journal, 4(1):25–30, 1965.
11. Stephen Cameron. Enhancing GJK: Computing minimum and penetration distances between convex polyhedra. In Proceedings of the IEEE Int’l Conference on Robotics and Automation, pp. 3112–3117, 1997.
12. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
13. Jonathan D. Cohen, Marc Olano, and Dinesh Manocha. Appearance-preserving simplifications. In Proceedings of SIGGRAPH, 1998, pp. 115–122.
14. Microsoft Corporation. The DirectX Software Development Kit. www .microsoft.com.
15. [CRE01] Elaine Cohen, Richard F. Riesenfeld, and Gershon Elber. Geometric Modeling with Splines: An Introduction. A. K. Peters, Natick, MA, 2001.
16. J. D. Cohen, A. Varshney, D. Manocha, G. Turk, et al. Simplification envelopes. In Proceedings of SIGGRAPH, 1996, pp. 119–128.
17. D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra—a unified approach. Proceedings of the 17th Int’l Colloq. Automata Lang. Program, Lecture Notes in Computer Science, 43:400–413, 1990.
18. H. Das, J-J. E. Slotine, and T. B. Sheridan. Inverse kinematic algorithms for redundant systems. IEEE International Conference on Robotics and Automation, 1988, pp. 43–48.
19. +97] Mark Duchaineau, Murray Wolinsky, David E. Sigeti, Mark C. Miller, et al. Roaming terrain: Real-time optimally adapting meshes. IEEE Visualization 1997, pp. 81–88.
20. David Eberly. Game Physics. Morgan Kaufmann, San Francisco, CA, 2003.
21. H. Edelsbrunner. Algorithms in Computational Geometry. Springer-Verlag, Heidelberg, Germany, 1987.
22. H. Edelsbrunner and H. A. Maurer. Finding extreme points in three dimensions and solving the post-office problem in the plane. Inform. Process. Lett., 21:39–47, 1985.
23. [Eng02] Wolfgang F. Engel, ed. Direct3D ShaderX: Vertex and Pixel Shader Tips and Tricks. Wordware, Plano, TX, 2002.
24. [Eng03] Wolfgang F. Engel, ed. ShaderX2: Shader Programming Tips & Tricks.Wordware, Plano, TX, 2003.
25. [Eng04] Wolfgang F. Engel, ed. ShaderX3: Advanced Rendering with DirectX and OpenGL. Charles River Media, Hingham, MA, 2004.
26. [Eng06] Wolfgang F. Engel, ed. ShaderX4: Lighting and Rendering. Charles River Media, Hingham, MA, 2006.
27. Christer Ericson. Real-Time Collision Detection. Morgan Kaufmann, San Francisco, CA, 2004.
28. Gerald Farin. Curves and Surfaces for Computer Aided Geometric Design. Academic Press, San Diego, CA, 1990.
29. [Far99] Gerald Farin. NURBS: From Projective Geometry to Practical Use. A.K.Peters, Natick, MA, 1999.
30. Randima Fernando, ed. GPU Gems: Programming Techniques, Tips, and Tricks for Real-Time Graphics. Addison-Wesley, Boston, MA, 2004.
31. Kaspar Fischer and Bernd Gärtner. The smallest enclosing ball of balls: Combinatorial structure and algorithms. In Annual Symposium on Computational Geometry: Proceedings of the Nineteenth Conference on Computational Geometry, 2003, pp. 292–301.
32. Henry Fuchs, Zvi Kedem, and Bruce Naylor. Predetermining visibility priority in 3D scenes. In Proceedings of SIGGRAPH, 1979, pp. 175–181.
33. Henry Fuchs, Zvi Kedem, and Bruce Naylor. On visible surface generation byaprioritreestructures.In Proceedings of SIGGRAPH, 1980, pp. 124–133.
34. James D. Foley, Andries van Dam, Steven K. Feiner, and John F. Hughes. Computer Graphics: Principles and Practice, 2nd ed. Addison-Wesley, Reading, MA, 1990.
35. E. G. Gilbert and C-P. Foo. Computing the distance between general convex objects in three-dimensional space. IEEE Transactions on Robotics and Automation, 6(1):53–61, 1990.
36. Michael Garland and Paul Heckbert. Surface simplification using quadric error metrics. In Proceedings of SIGGRAPH, 1997, pp. 209–216.
37. Michael Garland and Paul Heckbert. Simplifying surfaces with color and texture using quadric error metrics. IEEE Visualization, 1998, pp. 263–269.
38. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE Journal Robotics and Automation, vol. 4:193–203, 1988.
39. Gene H. Golub and Charles F. Van Loan. Matrix Computations, 2nd ed. Johns Hopkins University Press, Baltimore, MD, 1993.
40. Andrew S. Glassner, ed. Graphics Gems I. Academic Press, San Diego, CA, 1990.
41. Stefan Gottschalk, Ming Lin, and Dinesh Manocha. OBBTree: A hierarchical structure for rapid interference detection. In Proceedings of SIGGRAPH, 1996, pp. 171–180.
42. Paul Heckbert, ed. Graphics Gems IV. Academic Press, San Diego, CA, 1994.
43. Roger A. Horn and Charles R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, UK, 1985.
44. Hugues Hoppe. Progressive meshes. In Proceedings of SIGGRAPH, 1996, pp. 99–108.
45. Hugues Hoppe. View-dependent refinement of progressive meshes. In Proceedings of SIGGRAPH, 1996, pp. 189–198.
46. Michael Kallay. Computing moment of inertia. Private correspondence, November 29, 2004.
47. Doris H. U. Kochanek and Richard H. Bartels. Interpolating splines with local tension, continuity, and bias control. ACM SIGGRAPH Course Notes 22, Advanced Computer Animation, 1986.
48. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12:28–35, 1983.
49. David Kirk, ed. Graphics Gems III. Academic Press, San Diego, CA, 1992.
50. Donald E. Knuth. The Art of Computer Programming, Volumes 1–3. Addison-Wesley, Boston, MA, 1973.
51. Jeff Lander. Oh my god, i inverted kine. Game Developer Magazine, 1998, pp. 9–14.
52. Y-D. Liang and B. A. Barsky. A new concept and method for line clipping. ACM Transactions on Graphics, 3(1):1–22, 1984.
53. D. Luebke and C. Erikson. View-dependent simplification of arbitrary polygonal environments. In Proceedings of ACM SIGGRAPH 1997, pp. 199–208.
54. Ron Levine. Collision of Moving Objects.www.sourceforce.net (on the game developer algorithms list), November 2000.
55. F. Losasso and H. Hoppe. Geometry clipmaps: Terrain rendering using nested regular grids. In Proceedings of ACM SIGGRAPH 2004, pp. 769–776.
56. Boost C++ Libraries. Computing Moment of Inertia. www.boost.org/.
57. Ravenbrook Limited. The Memory Management Reference. www.memory-management.org, 2001.
58. Peter Lindstrom, David Koller, William Ribarsky, Larry F. Hodges, et al. Real-time, continuous level of detail rendering of height fields. In Proceedings of SIGGRAPH, 1996, pp. 109–118.
59. Stanley B. Lippman, Jósee Lajoie, and Barbara E. Moo. C++ Primer, 4th ed. Addison-Wesley, Reading, MA, 2005.
60. [Lom03] Chris Lomont. Fast Inverse Square Root. www.math.purdue.edu/~clomont /Math/Papers/2003/InvSqrt.pdf, 2003.
61. [LRC+03] David Luebke, Martin Reddy, Jonathan D. Cohen, Amitabh Varshney, et al. Level of Detail for 3D Graphics. Morgan Kaufmann, San Francisco, CA, 2003.
62. Peter Lindstrom and Greg Turk. Fast and memory efficient polygonal simplification. IEEE Visualization, 1998, pp. 279–286.
63. Tom McReynolds and David Blythe. Advanced Graphics Programming Using OpenGL. Morgan Kaufmann, San Francisco, CA, 2005.
64. Bertrand Meyer. Object-Oriented Software Construction. International Series in Computer Science, C. A. R. Hoare, ed., Prentice Hall, Englewood Cliffs, NJ, 1988.
65. Tomas Möller and Eric Haines. Real-Time Rendering, 2nded.A.K.Peters Ltd., Natick, MA, 2002.
66. Brian Mirtich. Fast and accurate computation of polyhedral mass properties. Journal of Graphics Tools, 1(2):31–50, 1996.
67. Tomas Möller. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2):25–30, 1997.
68. Tomas Möller and Ben Trumbore. Fast, minimum storage ray-triangle intersection. Journal of Graphics Tools, 2(1):21–28, 1997.
69. Zoran R. Novaković and Bojan Nemec. A solution of the inverse kinematics problem using the sliding mode. IEEE Transactions on Robotics and Automation, 6(2):247–252, 1990.
70. J. O’Rourke. Finding minimal enclosing boxes. Int’l Journal of Comput. Inform. Sci., 14:183–199, June 1985.
71. Joseph O’Rourke. Computational Geometry in C, 2nd ed. Cambridge University Press, Cambridge, UK, 1998.
72. Alan Paeth, ed. Graphics Gems V. Academic Press, San Diego, CA, 1995.
73. Brian Paul. The Mesa 3D Graphics Library. www.mesa3d.org, 2006.
74. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge, UK, 1988.
75. Matt Pharr, ed. GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation. Addison-Wesley, Boston, MA, 2005.
76. Bui Tuong Phong. Illumination for computer generated pictures. Communications of the ACM, 18(6):335–342, July 2000.
77. [Pro06] Virtual Terrain Project. www.vterrain.org/LOD/Papers/, 2006.
78. Franco P. Preparata and Michael I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, Heidelberg, Germany, 1985.
79. C. Phillips, J. Zhao, and N. Badler. Interactive real-time articulated figure manipulation using multiple kinematic constraints. SIGGRAPH I3D Symposium, 24(2):245–250, 1990.
80. [RB93] Jared Rossignac and Paul Borrel. Multiresolution 3D approximations for rendering complex scenes. In Modeling in Computer Graphics: Methods and Applications, B. Falcidieno and T. Kunii, eds. Springer-Verlag, Heidelberg, Germany, 1993, pp. 455–463.
81. Andrew Rollings and Dave Morris. Game Architecture and Design: A New Edition. Peachpit Press, Berkeley, CA, 2003.
82. David F. Rogers. An Introduction to NURBS with Historical Perspective.Morgan Kaufmann, San Francisco, CA, 2001.
83. Erik Reinhard, Greg Ward, Sumanta Pattanaik, and Paul Debevec. High Dynamic Range Imaging: Acquisition, Display, and Image-Based Lighting.Morgan Kaufmann, San Francisco, CA, 2005.
84. Philip J. Schneider and David Eberly. Geometric Tools for Computer Graphics. Morgan Kaufmann, San Francisco, CA, 2002.
85. Brian Sharp. Optimizing curved surface geometry. Game Developer Magazine, 1999, pp. 40–48.
86. [Spe06] Henry Spencer. getopt command-line parser.www.lysator.liu.se/c/henry/l, 2006.
87. Lorenzo Sciavicco and Bruno Siciliano. A dynamic solution to the inverse kinematic problem for redundant manipulators. In IEEE Int’l Conference on Robotics and Automation, 1987, pp. 1081–1086.
88. Bjarne Stroustrup. The C++ Programming Language, 3rd ed. Addison-Wesley, Reading, MA, 2000.
89. Dave Shreiner, Mason Woo, Jackie Neider, and Tom Davis. OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 2. Addison-Wesley, Boston, MA, 2005.
90. William J. Schroeder, Jonathan A. Zarge, and William E. Lorensen. Decimation of triangle meshes. In Proceedings of SIGGRAPH, 1992, pp. 65–70.
91. G. T. Toussaint. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. Proceedings of IEEE Int’l Conference on Pattern Recogn., 1984, pp. 465–467.
92. Gino van den Bergen. A fast and robust GJK implementation for collision detectionofconvexobjects. Journal of Graphics Tools, 4(2):7–25, 1999.
93. Gino van den Bergen. Collision Detection in Interactive 3D Environments. Morgan Kaufmann, San Francisco, CA, 2003.
94. [Wad] Bretton Wade. BSP Tree Frequently Asked Questions. www.faqs.org/faqs /graphics/bsptree-faq/.
95. Li-Chun Wang and Chih Cheng Chen. A combined optimization method for solving the inverse kinematics problem of mechanical manipulators. IEEE Transactions on Robotics and Applications, 7(4):489–499, 1991.
96. Emo Welzl. Smallest enclosing disks (balls and ellipsoids). Lecture Notes in Computer Science, 555:359–370, 1991.
97. Chris Welman. “Inverse Kinematics and Geometric Constraints for Articulated Figures.” Master’s thesis, Simon Frasier University, Burnaby, Canada, 1993.
98. Chionh Eng Wee and Ronald N. Goldman. Elimination and resultants, Part 1: Elimination and bivariate resultants. IEEE Computer Graphics and Applications, 1995, pp. 69–77.
99. Chionh Eng Wee and Ronald N. Goldman. Elimination and resultants, Part 2: Multivariate resultants. IEEE Computer Graphics and Applications, 1995, pp. 60–69.
100. Lance Williams. Pyramidal parametrics. Computer Graphics, 7(3):1–11, 1983.
101. Alan Watt and Mark Watt. Animation and Rendering Techniques: Theory and Practice. ACM Press, New York, 1992.
102. Jianmin Zhao and Norman I. Badler. Inverse kinematics positioning using nonlinear programming for highly articulated figures. ACM Transactions on Graphics, 13(4):313–336, 1994.