These are the references from the book Real-Time Collision Detection. They are made available online to allow all the links to various papers and books to be clicked through (rather than tediously typed in). Please report any stale links!

Entries in red have been updated since the latest printing of the book.

Real-Time Collision Detection References

[Abrams98] Abrams, Stephen. Wonjoon Cho. Chun-Yi Hu. Takashi Maekawa. Nicholas Patrikalakis. Evan Sherbrooke. Xiuzi Ye. “Efficient and Reliable Methods for Rounded Interval Arithmetic,” MIT Design Laboratory Memorandum 97-9. 1998.
[Acton96] Acton, Forman. Real Computing Made Real. Princeton University Press. 1996.
[Akenine-Möller01] Akenine-Möller, Tomas. “Fast 3D Triangle-box Overlap Testing,” Journal of Graphics Tools, vol. 6, no. 1, pp. 29-33, 2001. See also http://www.ce.chalmers.se/staff/tomasm/pubs/tribox.pdf
[Akenine-Möller02] Akenine-Möller, Tomas. Eric Haines. Real-Time Rendering (2d ed.) A K Peters, 2002. http://www.realtimerendering.com/
[Amanatides87] Amanatides, John. Andrew Woo. “A Fast Voxel Traversal Algorithm for Ray Tracing.” Proceedings of Eurographics 1987, pp. 3-10, 1987. htttp://www.cs.yorku.ca/~amana/research/grid.pdf
[Amanatides97] Amanatides, John. Kia Choi. “Ray Tracing Triangular Meshes.” Proceedings of the Eighth Western Computer Graphics Symposium, pp 43-52, April 1997. http://www.cs.yorku.ca/~amana/research/mesh.pdf
[Andrew79] Andrew, Alex. “Another Efficient Algorithm for Convex Hulls in Two Dimensions.” Information Processing Letters, vol. 9, no. 5, pp. 216-219, 1979. http://dx.doi.org/10.1016/0020-0190(79)90072-3
[Anton00] Anton, Howard. Elementary Linear Algebra (8th ed.) John Wiley & Sons, 2000.
[Arvo90] Arvo, James. “Transforming Axis-aligned Bounding Boxes.” in Andrew Glassner (ed.), Graphics Gems, Academic Press, pp. 548-550, 1990. http://www.graphicsgems.org/
[Arvo91] Arvo, James (editor). Graphics Gems II. Academic Press, 1991. http://www.graphicsgems.org/
[Avnaim95] Avnaim, Francis. Jean-Daniel Boissonnat. Olivier Devillers. Franco Preparata. Mariette Yvinec. ”Evaluation of a New Method to Compute Signs of Determinants.” Proceedings of the eleventh annual symposium on computational geometry, pp. 416-417, 1995. ftp://ftp-sop.inria.fr/geometrica/publis/abdpy-enmcs-95.pdf
[Baciu99] Baciu, George. Wingo Wong. Hanqiu Sun. “RECODE: An Image-based Collision Detection Algorithm.” Journal of Visualization and Computer Animation, vol. 10, no. 4, pp. 181-192, 1999.
[Baraff92] Baraff, David. “Dynamic Simulation of Non-penetrating Rigid Bodies,” Ph.D. thesis, Technical Report 92-1275, Computer Science Department, Cornell University, 1992. http://www.pixar.com/companyinfo/research/deb/
[Barber96] Barber, C. Bradford. David Dobkin. Hannu Huhdanpaa. “The Quickhull Algorithm for Convex Hulls.” ACM Transactions on Mathematical Software, vol. 22, no. 4, pp. 469-483, 1996. http://www.acm.org/pubs/citations/journals/toms/1996-22-4/p469-barber/
[Barequet96] Barequet, Gill. Bernard Chazelle. Leonid Guibas. Joseph Mitchell. Ayellet Tal. “BOXTREE: A Hierarchical Representation for Surfaces in 3D.” Computer Graphics Forum, vol. 15, no. 3, pp. 387-396, 1996. ftp://ftp.ams.sunysb.edu/pub/geometry/boxtree.ps.gz
[Barequet97] Barequet, Gill. Subodh Kumar. “Repairing CAD Models.” Proceedings of the 8th Conference on Visualization 1997 (VIS 97), pp. 363-370, October 1997. ftp://ftp.cs.technion.ac.il/pub/barequet/papers/unv-vis97.ps.gz
[Barequet99] Barequet, Gill. Sariel Har-Peled. “Efficiently Approximating the Minimum-volume Bounding Box of a Point Set in Three Dimensions.” Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 82-91, 1999. http://valis.cs.uiuc.edu/~sariel/research/papers/98/bbox.pdf
[Barrera03] Barrera, Tony. Anders Hast. Ewert Bengtsson. “A Fast and Simple All-integer Parametric Line.” in Jeff Lander (ed.), Graphics Programming Methods. Charles River Media. 2003.
[Baumgart72] Baumgart, Bruce. “Winged Edge Polyhedron Representation.” Artificial Intelligence Project Memo AIM-179 (CS-TR-72-320), Computer Science Department, Stanford University, 1972. ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/72/320/CS-TR-72-320.pdf
[Bekker01] Bekker, Henk. Jos Roerdink. “An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra.” Computational Science - ICCS 2001, Lecture Notes in Computer Science 2073, Springer-Verlag, pp. 619-628, 2001. http://www.cs.rug.nl/~roe/publications/ccs3.ps.gz
[Belov02] Belov, Gleb. “A Modified Algorithm for Convex Decomposition of 3D Polyhedra,” Technical report MATH-NM-03-2002, Institut für Numerische Mathematik, Technische Universität, Dresden. March, 2002. http://www.math.tu-dresden.de/~belov/cd3/cd3.ps
[Bentley75] Bentley, Jon. “Multidimensional Binary Search Trees Used for Associative Searching.” Communications of the ACM, vol. 18, no. 9, pp. 509-517, 1975. http://www.acm.org/pubs/articles/journals/cacm/1975-18-9/p509-bentley/p509-bentley.pdf
[Berg00] de Berg, Mark. Marc van Kreveld. Mark Overmars. Otfried Schwarzkopf. Computational Geometry (2d ed.). Springer Verlag, 2000.

[Bergen97] van den Bergen, Gino. “Efficient Collision Detection of Complex Deformable Models Using AABB Trees.” Journal of Graphics Tools, vol. 2, no. 4, pp. 1-14, 1997. http://www.win.tue.nl/~gino/solid/jgt98deform.pdf
[Bergen99] van den Bergen, Gino. “Collision Detection in Interactive 3D Computer Animation,” Ph.D. thesis, Eindhoven University of Technology, Eindhoven, 1999.
[Bergen03] van den Bergen, Gino. Collision Detection in Interactive 3D Environments. Morgan Kaufmann Publishers, 2003.
[Binstock96] Binstock, Andrew. “Hashing Rehashed.” Doctor Dobbs Journal, April 1996.
[Bonnedal02] Bonnedal, Rasmus. Magnus Pettersson. “SIMD Accelerated Ray Tracing.” Master’s thesis. Department of Computer Engineering. Chalmers University of Technology. Gothenburg, 2002. http://www.ce.chalmers.se/undergraduate/Theses/Exjobbsrapporter/973_2002.pdf
[Botkin] Botkin, Nikolai. “Randomized Algorithm for Solving Quadratic Programs.” http://citeseer.ist.psu.edu/108615.html
[Botkin95] Botkin, Nikolai. “Randomized Algorithms for the Separation of Point Sets and for Solving Quadratic Programs.” Applied Mathematics and Optimization. vol 32, pp. 195-210, 1995. http://citeseer.ist.psu.edu/87315.html
[Boyd04] Boyd, Stephen. Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004. http://www.stanford.edu/~boyd/cvxbook.html
[Boyles99] Boyles, Michael. Shiaofen Fang. “Slicing-based Volumetric Collision Detection.” Journal of Graphics Tools, vol. 4, no. 4, pp. 23-32, 1999. http://www.avl.iu.edu/~mjboyles/papers/vcd.ps
[Capens01] Capens, Nicolas. “Smallest Enclosing Spheres.” flipcode Code Of The Day Forum, June 29, 2001. http://www.flipcode.com/cgi-bin/msg.cgi?showThread=COTD-SmallestEnclosingSpheres&forum=cotd&id=-1 and ftp://ftp.flipcode.com/cotd/MiniBall.zip
[Cardoso98] Cardoso, Jean-François. “Blind Signal Separation: Statistical Principles.” Proceedings of IEEE, vol. 86, no. 10, pp. 2009-2025, 1998. http://citeseer.ist.psu.edu/cardoso98blind.html
[Carr02] Carr, Nathan. Jesse Hall. John Hart. “The Ray Engine.” Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, pp. 37-46, 2002. http://basalt.cs.uiuc.edu/~jch/papers/rt2/RayEngine-gh02.pdf
[Cazals95] Cazals, Frédéric. George Drettakis. Claude Puech. “Filtering, Clustering and Hierarchy Construction: A New Solution for Ray Tracing Very Complex Environments.” Computer Graphics Forum (Eurographics 1995 Proceedings), vol. 14, no. 3, pp. 371-382, 1995. http://w3imagis.imag.fr/Publications/1995/CDP95/index.fr.html
[Chien03] Chien, Yu-Ren. Jing Sin Liu. “Improvements to Ellipsoidal Fit Based Collision Detection,” Technical report TR-IIS-03-001, Institute of Information Science, Academia Sinica, Taiwan, 2003. http://www.iis.sinica.edu.tw/LIB/TechReport/tr2003/tr03001.pdf
[Chilimbi99a] Chilimbi, Trishul. Mark Hill. James Larus. “Cache-conscious Structure Layout.” Proceedings of the ACM SIGPLAN 1999 Conference on Programming Language Design and Implementation (PLDI 99), pp. 1-12, May 1999. http://research.microsoft.com/~trishulc/papers/layout_distr.pdf
[Chilimbi99b] Chilimbi, Trishul. Bob Davidson. James Larus. “Cache-conscious Structure Definition.” Proceedings of the ACM SIGPLAN 1999 Conference on Programming Language Design and Implementation (PLDI 99), pp. 13-24, May 1999. http://research.microsoft.com/~trishulc/papers/definition_distr.pdf
[Chin92] Chin, Norman. “Partitioning a 3-D Convex Polygon with an Arbitrary Plane.” in David Kirk (editor), Graphics Gems III, Academic Press, pp. 219-222, 1992. http://www.graphicsgems.org/
[Choi02] Choi, Yi-King. Wenping Wang. Myung-Soo Kim. “Exact Collision Detection of Two Moving Ellipsoids Under Rational Motions.” Technical report TR-2002-15, Department of Computer Science and Information Systems, Hong Kong University, 2002. http://www.csis.hku.hk/research/techreps/document/TR-2002-15.pdf
[Chung96] Chung, Kelvin. Wenping Wang. “Quick Collision Detection of Polytopes in Virtual Environments.” Proceedings of the ACM Symposium on Virtual Reality Software and Technology (VRST 96), Mark Green, Ed., pp. 125-131, 1996. http://www.geocities.com/kelchung220/download/exactcol.tar.gz
[Chung98] Chung, Adrian. “Re: OBB Trees.” comp.graphics.algorithms usenet newsgroup article, Message-ID <6le9nu$ef9$1@magpie.doc.ic.ac.uk>, June 7, 1998. http://groups.google.com/groups?selm=6le9nu$ef9$1@magpie.doc.ic.ac.uk
[Chvátal83] Chvátal, Vašek. Linear Programming. W H Freeman & Co, 1983.
[Cleary88] Cleary, John. Geoff Wyvill. “Analysis of an Algorithm for Fast Ray Tracing Using Uniform Space Subdivision.” The Visual Computer, vol. 4, no. 2, pp. 65-83, July 1988. See also: Technical report 1987-282-30, Department of Computer Science, University of Calgary. http://pharos.cpsc.ucalgary.ca/Dienst/Repository/2.0/Body/ncstrl.ucalgary_cs/1987-282-30/pdf
[Cohen95] Cohen, Jonathan. Ming Lin. Dinesh Manocha. Madhav Ponamgi. “I-COLLIDE: An Interactive and Exact Collision Detection System for Large-scale Environments.” Proceedings of the 1995 Symposium on Interactive 3D Graphics, pp. 189-196, 1995. http://www.cs.jhu.edu/~cohen/Publications/icollide.pdf
[Coutinho01] Coutinho, Murilo. Dynamic Simulations of Multibody Systems, Springer-Verlag, 2001.
[Cormen90] Cormen, Thomas. Charles Leiserson. Ronald Rivest. Introduction to Algorithms, 2nd Edition MIT Press, 2001.
[Cromwell94] Cromwell, Robert. “Efficient Eigenvalues for Visualization.” in Paul Heckbert (editor), Graphics Gems IV, Academic Press, pp. 193-198, 1994. http://www.graphicsgems.org/
[Crosnier99] Crosnier, André. Jarek Rossignac. “Tribox Bounds for Three-dimensional Objects.” Computers & Graphics, vol. 23, no. 3, pp. 429-437, 1999. http://www.gvu.gatech.edu/~jarek/papers/Tribox.pdf
[Cychosz92] Cychosz, Joseph. “Use of Residency Masks and Object Space Partitioning to Eliminate Ray-Object Intersection Calculations”, in David Kirk (editor), Graphics Gems III, Academic Press, pp. 284-287, 1992. http://www.graphicsgems.org/
[Cychosz94] Cychosz, Joseph. Warren Waggenspack Jr. “Intersecting a Ray with a Cylinder.” in Paul Heckbert (editor), Graphics Gems IV, Academic Press, pp. 356-365, 1994. http://www.graphicsgems.org/
[Cyrus78] Cyrus, Mike. Jay Beck. “Generalized Two- and Three-dimensional Clipping.” Computers and Graphics, vol. 3, no. 1, pp. 23-28, 1978.
[Devillers02] Devillers, Olivier. Philippe Guigue. “Faster Triangle-Triangle Intersection Tests,” Technical Report 4488, INRIA, June 2002. http://www.inria.fr/rrrt/rr-4488.html
[Dinerstein02] Dinerstein, Jonathan. Parris Egbert. “Practical Collision Detection in Rendering Hardware for Two Complex 3D Polygon Objects.” Proceedings of the 20th Eurographics UK Conference, pp. 129-135, 2002.
[Dobkin90] Dobkin, David. David Kirkpatrick. “Determining the Separation of Preprocessed Polyhedra – A Unified Approach.” Proceedings of the 17th International Colloquium on Automata, Languages and Programming, vol. 443 of Lecture Notes in Computer Science, Springer-Verlag, pp. 400-413, 1990. http://citeseer.ist.psu.edu/58807.html
[Duff92] Duff, Tom. “Interval Arithmetic and Recursive Subdivision for Implicit Functions and Constructive Solid Geometry.” Computer Graphics (SIGGRAPH 1992 Proceedings), vol. 26, no. 2, pp. 131-138, July 1992. http://doi.acm.org/10.1145/133994.134027
[Eberly00] Eberly, David. “Intersection of Cylinders,” Technical Report, Magic Software, November 21, 2000. http://www.geometrictools.com/Documentation/IntersectionOfCylinders.pdf
[Eberly01] Eberly, David. 3D Game Engine Design. Morgan Kaufmann Publishers, 2001.
[Eberly02] Eberly, David. “Intersection of a Sphere and a Cone,” Technical Report, Magic Software, March 8, 2002. http://www.geometrictools.com/Documentation/IntersectionSphereCone.pdf
[Eberly03] Eberly, David. “Polyhedral Mass Properties (Revisited),” Technical Report, Magic Software, January 25, 2003. http://www.geometrictools.com/Documentation/PolyhedralMassProperties.pdf
[Eberly04] Eberly, David. Game Physics. Morgan Kaufmann Publishers. 2004.
[Edelsbrunner87] Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
[Ehmann00] Ehmann, Stephen. Ming Lin. “SWIFT: Accelerated Proximity Queries Between Convex Polyhedra by Multi-level Voronoi Marching,” Technical Report, Department of Computer Science, University of North Carolina at Chapel Hill, 2000. http://www.cs.unc.edu/~geom/SWIFT/EhmannLinTR00.pdf
[Erickson97] Erickson, Jeff. “Plücker coordinates.” Ray Tracing News, vol. 10, no. 3, December 1997. http://www.acm.org/tog/resources/RTNews/html/rtnv10n3.html#art11
[Ericson03] Ericson, Christer. “Memory optimization,” Presentation at Game Developer’s Conference, San José, 2003. http://www.gdconf.com/archives/2003/Ericson_Christer.ppt
[Erikson95] Erikson, Carl. “Error Correction of a Large Architectural Model: the Henderson County Courthouse,” Technical report TR95-013, Department of Computer Science, University of North Carolina at Chapel Hill, 1995. http://www.cs.unc.edu/~walk/papers/eriksonc/courthouse.ps.gz
[Everitt02] Everitt, Cass. Mark Kilgard. “Practical and Robust Stenciled Shadow Volumes for Hardware-accelerated Rendering,” White paper, NVIDIA Corporation, March 2002. http://arxiv.org/ftp/cs/papers/0301/0301002.pdf
[Fischer03] Fischer, Kaspar. Bernd Gärtner. “The Smallest Enclosing Ball of Balls: Combinatorial Structure and Algorithms.” Proceedings of 19th Annual ACM Symposium on Computational Geometry (SCG), pp. 292-301. 2003. http://www.inf.ethz.ch/personal/gaertner/texts/own_work/ballsofballs.pdf
[Floater04] Floater, Michael. Kai Hormann. Géza Kós. “A General Construction of Barycentric Coordinates Over Convex Polygons.” to appear in Advances in Computational Mathematics, 2004. http://vcg.isti.cnr.it/~hormann/papers/coordinates.pdf
[Fortune93] Fortune, Steven. Christopher Van Wyk. “Efficient Exact Arithmetic for Computational Geometry.” Proceedings of the 9th ACM Symposium on Computational Geometry, pp. 163-172, May 1993. http://cm.bell-labs.com/cm/cs/who/sjf/eeacg.ps.gz
[Freeman75] Freeman, Herbert. Ruth Shapira. “Determining the Minimum-area Encasing Rectangle for an Arbitrarily Closed Curve.” Communications of the ACM, vol. 18, no. 7, pp. 409-413, 1975.
[Friedman77] Friedman, Jerome. Jon Bentley. Raphael Finkel. “An Algorithm for Finding Best Matches in Logarithmic Expected Time.” ACM Transactions on Mathematical Software, vol. 3, no. 3, pp. 209-226, September 1977. See also: ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/75/482/CS-TR-75-482.pdf
[Frigo99] Frigo, Matteo. Charles Leiserson. Harald Prokop. Sridhar Ramachandran. “Cache-oblivious Algorithms.” Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 99), pp. 285-297, October 1999. ftp://theory.lcs.mit.edu/pub/cilk/FrigoLePr99.ps.gz
[Fuchs80] Fuchs, Henry. Zvi Kedem. Bruce Naylor. “On Visible Surface Generation by a Priori Tree Structures.” Computer Graphics (SIGGRAPH 1980 Proceedings), vol. 14, no. 3, pp. 124-133, July 1980. http://portal.acm.org/citation.cfm?id=807481
[Fuchs83] Fuchs, Henry. Gregory Abram. Eric Grant. “Near Real-time Shaded Display of Rigid Objects.” Computer Graphics (SIGGRAPH 1983 Proceedings), vol. 17, no. 3, pp. 65-72, 1983. http://portal.acm.org/citation.cfm?id=801134
[Fünfzig03] Fünfzig, Christoph. Dieter Fellner. “Easy Realignment of k-DOP Bounding Volumes.” Proceedings of Graphics Interface 2003. pp. 257-264, 2003. http://www.graphicsinterface.org/cgi-bin/DownloadPaper?name=2003/117/paper117.pdf
[Garcia99] Garcia, Miguel Angel. Angel Domingo Sappa. Luis Basañez. “Efficient Generation of Object Hierarchies from 3D Scenes.” IEEE International Conference on Robotics and Automation, Detroit, USA, pp. 1359-1364, May 1999. http://www.etse.urv.es/recerca/rivi/pub/3d/icra99.pdf
[Gärtner99] Gärtner, Bernd. “Fast and Robust Smallest Enclosing Balls.” Proceedings 7th Annual European Symposium on Algorithms (ESA99), Lecture Notes in Computer Science vol. 1643, Springer-Verlag, pp. 325-338, 1999. http://www.inf.ethz.ch/personal/gaertner/texts/own_work/esa99_final.pdf
[Gärtner00] Gärtner, Bernd. Sven Schönherr. “An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization.” Proceedings 16th Annual ACM Symposium on Computational Geometry (SCG), pp. 110-118, 2000. http://www2.inf.ethz.ch/~gaertner/cv/publications.html
[Gilbert88] Gilbert, Elmer. Daniel Johnson. S. Sathiya Keerthi. “A Fast Procedure for Computing the Distance Between Complex Objects in Three Dimensional Space.” IEEE Journal of Robotics and Automation, vol. 4, no. 2, pp. 193-203, 1988.
[Gilbert90] Gilbert, Elmer. Chek-Peng Foo. “Computing the Distance Between General Convex Objects in Three-dimensional Space.” IEEE Transactions on Robotics and Automation, vol. 6, no. 1, pp. 53-61, 1990.
[Glassner89] Glassner, Andrew (editor). An Introduction to Ray Tracing. Academic Press, 1989.
[Glassner90] Glassner, Andrew (editor). Graphics Gems. Academic Press, 1990. http://www.graphicsgems.org/
[Goldberg91] Goldberg, David. “What Every Computer Scientist Should Know About Floating-point Arithmetic.” ACM Computing Surveys, March 1991.
[Goldman90] Goldman, Ronald. “Intersection of Three Planes.” in Andrew Glassner (editor), Graphics Gems, Academic Press, p. 305, 1990.
[Goldsmith87] Goldsmith, Jeffrey. John Salmon. “Automatic Creation of Object Hierarchies for Ray Tracing.” IEEE Computer Graphics and Applications, vol. 7, no. 5, pp. 14-20, May 1987.
[Golub96] Golub, Gene. Charles van Loan. Matrix Computations (3d ed.). John Hopkins University Press. 1996.
[Gomez99] Gomez, Miguel. “Simple Intersection Tests for Games.” Gamasutra, October 1999. http://www.gamasutra.com/features/19991018/Gomez_1.htm
[Gomez01] Gomez, Miguel. “Compressed Axis-aligned Bounding Box Trees.” in Mark DeLoura (editor), Game Programming Gems 2, pp. 388-393, 2001.
[Gottschalk96] Gottschalk, Stefan. Ming Lin. Dinesh Manocha. “OBB-Tree: A Hierarchical Structure for Rapid Interference Detection.” Computer Graphics (SIGGRAPH 1996 Proceedings), pp. 171-180, 1996. http://www.cs.unc.edu/~walk/papers/gottscha/sig96.pdf
[Gottschalk00] Gottschalk, Stefan. “Collision Queries Using Oriented Bounding Boxes,” Ph.D. thesis, Department of Computer Science, University of North Carolina, Chapel Hill, 2000. http://www.cs.unc.edu/~geom/theses/gottschalk/main.pdf
[Govindaraju03] Govindaraju, Naga. Stephane Redon. Ming Lin. Dinesh Manocha. “CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments Using Graphics Hardware.” Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, San Diego, CA, pp. 25-32, 2003. http://gamma.cs.unc.edu/CULLIDE/
[Green95] Green, Daniel. Don Hatch. “Fast Polygon-Cube Intersection Testing.” in Alan Paeth (editor), Graphics Gems V, Academic Press, pp. 375-379, 1995. http://www.graphicsgems.org/
[Greenspan96] Greenspan, Michael. Nestor Burtnyk. “Obstacle Count Independent Real-time Collision Avoidance.” Proceedings of the 1996 IEEE International Conference on Robotics and Automation (ICRA 96), pp. 1073-1080, April 1996. http://www.ece.queensu.ca/hpages/faculty/greenspan/MyWebPage/papers/grebur96.pdf
[Gu01] Gu, Hong. Thomas Chase. Douglas Cheney. Thomas Bailey. Douglas Johnson. “Identifying, Correcting, and Avoiding Errors in Computer-aided Design Models Which Affect Interoperability.” Journal of Computing and Information Science in Engineering, vol. 1, no. 2, pp. 156-166, June 2001. http://dx.doi.org/10.1115/1.1384887
[Guha03] Guha, Sudipto. Shankar Krishnan. Kamesh Munagala. Suresh Venkatasubramanian. “The Power of a Two-sided Depth Test and its Application to CSG Rendering and Depth Extraction.” Proceedings of ACM Siggraph Symposium on Interactive 3D Graphics (to appear), 2003. http://www.research.att.com/~krishnas/MY_PAPERS/i3d03_csg.pdf
[Guibas85] Guibas, Leonidas. Jorge Stolfi. “Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams.” ACM Transactions on Graphics, vol. 4, no. 2, pp. 74-123, April 1985. http://doi.acm.org/10.1145/282918.282923
[Guibas99] Guibas, Leonidas. David Hsu. Li Zhang. “H-Walk: Hierarchical Distance Computation for Moving Convex Bodies.” Proceedings of the Fifteenth Annual Symposium on Computational Geometry, pp. 265 - 273, 1999. http://citeseer.ist.psu.edu/guibas99hwalk.html
[Guibas03] Guibas, Leonidas. An Nguyen. Li Zhang. “Zonotopes as Bounding Volumes.” Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 803-812, 2003. http://www.hpl.hp.com/personal/Li_Zhang/papers/zonotopes.ps
[Haines88] Haines, Eric. “Automatic Creation of Object Hierarchies for Ray Tracing.” Ray Tracing News, vol. 1, no. 6, April 1988. http://www.acm.org/tog/resources/RTNews/html/rtnews3a.html#art6
[Haines91a] Haines, Eric. “Efficiency Improvements for Hierarchy Traversal in Ray Tracing.” in James Arvo (editor), Graphics Gems II, Academic Press, pp. 267-272, 1991. http://www.graphicsgems.org/
[Haines91b] Haines, Eric. “Fast Ray-convex Polyhedron Intersection.” in James Arvo (editor), Graphics Gems II, Academic Press, pp. 247-250, 1991. http://www.graphicsgems.org/
[Haines94] Haines, Eric. “Point in Polygon Strategies.” in Paul Heckbert (editor), Graphics Gems IV, Academic Press, pp. 24-46, 1994. See also: http://www.erichaines.com/ptinpoly/
[Haines99] Haines, Eric. “Quicker Grid Generation via Memory Allocation.” Ray Tracing News, vol. 12, no. 1, June 1999. http://www.acm.org/pubs/tog/resources/RTNews/html/rtnv12n1.html#art6
[Hansen92] Hansen, Eldon. Global Optimization Using Interval Analysis. Marcel Dekker, New York 1992.
[Hashemi97] Hashemi, Amir. David Kaeli. Brad Calder. “Efficient Procedure Mapping Using Cache Line Coloring.” Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pp. 171-182, June 1997. http://www.cs.ucsd.edu/users/calder/papers/PLDI97-Color.pdf
[Hausner98] Hausner, Melvin. A Vector Space Approach to Geometry. Dover Publications, 1998.
[Havran99] Havran, Vlastimil. Filip Sixta. “Comparison of Hierarchical Grids.” Ray Tracing News, vol. 12, no. 1, June 1999. http://www.acm.org/tog/resources/RTNews/html/rtnv12n1.html#art3
[He99] He, Taosong. “Fast Collision Detection Using QuOSPO trees.” Proceedings of the 1999 Symposium on Interactive 3D Graphics, pp. 55-62, 1999. http://citeseer.ist.psu.edu/262510.html
[Heckbert94] Heckbert, Paul (editor). Graphics Gems IV. Academic Press, 1994. http://www.graphicsgems.org/
[Held97] Held, Martin. “ERIT: A Collection of Efficient and Reliable Intersection Tests.” Journal of Graphics Tools, vol. 2, no. 4, pp. 25-44, 1997. http://www.cosy.sbg.ac.at/~held/papers/jgt98.ps.gz
[Held01] Held, Martin. “FIST: Fast Industrial-strength Triangulation of Polygons.” Algorithmica, vol. 30, no. 4, pp. 563-596, August 2001. http://citeseer.ist.psu.edu/held00fist.html
[Hennessy02] Hennessy, John. David Patterson. David Goldberg. Computer Architecture: A Quantitative Approach (3d ed.). Morgan Kaufmann Publishers, 2002.
[Hertel83] Hertel, Stefan. Kurt Mehlhorn. “Fast Triangulation of Simple Polygons.” Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory, pp. 207-218, 1983.
[Hickey01] Hickey, Timothy. Qun Ju. Maarten van Emden. “Interval Arithmetic: From Principles to Implementation.” Journal of the ACM, vol. 48, no. 5, pp. 1038-1068, September 2001. http://csr.uvic.ca/~vanemden/Publications/hickeyJuvE.ps
[Hill89] Hill, Mark. Alan Smith. “Evaluating Associativity in CPU Caches.” IEEE Transactions on Computers, vol. 38, no. 12, pp. 1612-1630, December 1989.
[Hinker93] Hinker, Paul. Charles Hansen. “Geometric Optimization.” Proceedings of the 4th Conference on Visualization 1993, pp. 189-195, October 1993. http://www.ccs.lanl.gov/ccs1/projects/Viz/pdfs/93-vis.pdf
[Huang97] Huang, Chong-Wei. Tian-Yuan Shih. “On the Complexity of Point-in-polygon Algorithms.” Computers & Geosciences, vol. 23, no. 1, pp. 109-118, 1997.
[Hubbard95] Hubbard Philip. “Collision Detection for Interactive Graphics Applications.” IEEE Transactions on Visualization and Computer Graphics. vol. 1, no. 3, pp. 218-230, September 1995. See also: Technical report CS-95-08, Department of Computer Science, Brown University. http://www.cs.brown.edu/publications/techreports/reports/CS-95-08.html
[idSoftware01] id Software. Quake II source code. ftp://ftp.idsoftware.com/idstuff/source/q2source-3.21.zip
[Imbert93] Imbert, Jean-Louis. “Fourier's Elimination: Which to Choose?” Principles and Practice of Constraint Programming (PPCP), pp. 117-129, Newport, Rhode Island, 1993.
[Intel99] Intel. “Applying Streaming SIMD Extensions to Collision Detection,” Intel Application Note AP-812. January 1999. http://www.intel.com/cd/ids/developer/asmo-na/eng/19049.htm
[James99] James, Adam. “Binary Space Partitioning for Accelerated Hidden Surface Removal and Rendering of Static Environments,” Ph.D. thesis, University of East Anglia, August 1999. http://www.sys.uea.ac.uk/~aj/PHD/Postscripts/bsp.pdf
[James00] James, Adam. Andy Day. “Conflict Neutralization on Binary Space Partitioning.” Computer Graphics Forum, vol. 19, no. 2, pp. 153-163, June 2000. http://citeseer.ist.psu.edu/james98conflict.html
[Jenkins97] Jenkins, Robert. “Algorithm Alley,” Doctor Dobbs Journal, September 1997. See also: http://burtleburtle.net/bob/
[Jevans89] Jevans, David. Brian Wyvill. “Adaptive Voxel Subdivision for Ray Tracing.” Proceedings of Graphics Interface 1989, pp. 164-172, 1989.
[Jolliffe02] Jolliffe, Ian. Principal Component Analysis (2d ed.). Springer Verlag, 2002.
[Joshi03] Joshi, Bhautik. Sebastien Ourselin. “BSP-assisted Constrained Tetrahedralization.” Proceedings of the 12th International Meshing Roundtable, Sandia National Laboratories, pp. 251-260, September 2003. http://www.imr.sandia.gov/papers/imr12/joshi03.pdf
[Joy86] Joy, Kenneth. “A Dissection of Fujimoto's Algorithm,” Technical report CSE-86-6, Department of Computer Science, University of California, Davis, September 1986.
[Kalvin96] Kalvin, Alan. Russell Taylor. “Superfaces: Polygonal Mesh Simplification with Bounded Error.” IEEE Computer Graphics and Applications, vol. 16, no. 3, pp. 64-77, May 1996. http://csdl.computer.org/comp/mags/cg/1996/03/g3064abs.htm
[Karasick89] Karasick, Michael. “On the Representation and Manipulation of Rigid Solids,” Ph.D. thesis, Department of Computer Science, Cornell University, NY, March 1989. See also: Technical report TR 89-976. http://historical.ncstrl.org/tr/ps/cornellcs/TR89-976.ps
[Kay86] Kay, Timothy. James Kajiya. “Ray Tracing Complex Scenes.” Computer Graphics (SIGGRAPH 1986 Proceedings), vol. 20, no. 4, pp. 269-278, 1986. http://doi.acm.org/10.1145/15922.15916
[Keil02] Keil, Mark. Jack Snoeyink. “On the Time Bound for Convex Decomposition of Simple Polygons.” International Journal of Computational Geometry and Applications, vol. 12, no. 3, pp. 181-192, June 2002. http://www.cs.unc.edu/~snoeyink/papers/convdecomp.ps.gz
[Kirk92] Kirk, David (editor). Graphics Gems III. Academic Press, 1992. http://www.graphicsgems.org/
[Klimaszewski97] Klimaszewski, Krzysztof. Thomas Sederberg. “Faster Ray Tracing Using Adaptive Grids.” IEEE Computer Graphics and Applications, vol. 17 no. 1, pp. 42-51, January 1997.
[Klosowski98] Klosowski, James. Martin Held. Joseph Mitchell. Henry Sowizral. Karel Zikan. “Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs.” IEEE Transactions on Visualization and Computer Graphics, vol. 4, no. 1, pp. 21-36, 1998. ftp://ftp.ams.sunysb.edu/pub/geometry/cd-tvcg-97.ps.gz
[Knittel00] Knittel, Günter. “The UltraVis System,” HP Labs Tech report HPL-2000-100, 2000. http://www.hpl.hp.com/techreports/2000/HPL-2000-100.pdf
[Knott03a] Knott, David. Dinesh Pai. “CInDeR: Collision and Interference Detection in Real-time Using Graphics Hardware.” Proceedings of Graphics Interface 2003 http://www.graphicsinterface.org/cgi-bin/DownloadPaper?name=2003/139/paper139.pdf
[Knott03b] Knott, David. “CInDeR: Collision and Interference Detection in Real-time Using Graphics Hardware,” Master’s thesis. Department of Computer Science, University of British Columbia, 2003. http://www.cs.ubc.ca/grads/resources/thesis/Nov03/David_Knott.pdf
[Knuth97] Knuth, Donald. The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3d ed.). Addison-Wesley, 1997.
[Knuth98] Knuth, Donald. The Art of Computer Programming, Volume 3: Sorting and Searching (2d ed.). Addison-Wesley, 1998.
[Konečný97] Konečný, Petr. Karel Zikan. “Lower Bound of Distance in 3D.” Proceedings of WSCG 1997, vol. 3, pp. 640-649, 1997. See also: Technical report FIMU-RS-97-01, Faculty of Informatics, Masaryk University, Brno, Czech republic. http://ftp.fi.muni.cz/pub/reports/1997/pdf/FIMU-RS-97-01.pdf
[Konečný98] Konečný, Petr. “Bounding Volumes in Computer Graphics,” Master’s thesis. Faculty of informatics, Masaryk University, Brno, Czech republic. 1998. http://decibel.fi.muni.cz/HCILAB/thesis.ps.gz
[Krishnan98] Krishnan, Shankar. Amol Pattekar. Ming Lin. Dinesh Manocha. “Spherical Shell: A Higher Order Bounding Volume for Fast Proximity Queries.” Robotics: The Algorithmic Perspective: WAFR 1998, pp. 177-190, 1998. http://www.research.att.com/~krishnas/MY_PAPERS/wafr98.pdf
[Lahanas00] Lahanas, Michael. Thorsten Kemmerer. Natasa Milickovic. Kostas Karouzakis. Dimos Baltas. Nikolaos Zamboglou. “Optimized Bounding Boxes for Three-dimensional Treatment Planning in Brachytherapy.” Medical Physics, vol. 27, no. 10, pp. 2333-2342, 2000. http://www.mlahanas.de/Papers/preprint/bbox.pdf
[Laidlaw86] Laidlaw, David. William Trumbore. John Hughes. “Constructive Solid Geometry for Polyhedral Objects.” Computer Graphics (SIGGRAPH 1986 Proceedings), vol. 20, no. 4, pp. 161-170, 1986. http://doi.acm.org/10.1145/15922.15904
[Larcombe95] Larcombe, Mikki. “Re: arbitrary bounding box intersection.” comp.graphics.algorithms usenet newsgroup article. Message-ID <1995Oct11.130545.22985@dcs.warwick.ac.uk>, October 11, 1995.
[Larsen99] Larsen, Eric. Stefan Gottschalk. Ming Lin. Dinesh Manocha. “Fast Proximity Queries with Swept Sphere Volumes,” Technical report TR99-018, Department of Computer Science, University of North Carolina, Chapel Hill, 1999. ftp://ftp.cs.unc.edu/pub/users/manocha/PAPERS/COLLISION/ssv.pdf
[Larsen00] Larsen, Eric. Stefan Gottschalk. Ming Lin. Dinesh Manocha. “Fast Distance Queries Using Rectangular Swept Sphere Volumes.” Proceedings of IEEE International Conference on Robotics and Automation, 2000. ftp://ftp.cs.unc.edu/pub/users/manocha/PAPERS/COLLISION/icrassv00.pdf
[Lengyel02] Lengyel, Eric. “The Mechanics of Robust Stencil Shadows.” Gamasutra, October 2002. http://www.gamasutra.com/features/20021011/lengyel_01.htm
[Levine00] Levine, Ron. “Collisions of moving objects.” gdalgorithms-list mailing list article, November 14, 2000. http://www.realtimecollisiondetection.net/files/levine_swept_sat.txt
[Li98] Li, Tsai-Yen. Jin-Shin Chen. “Incremental 3D Collision Detection with Hierarchical Data Structures.” Proceedings of ACM Symposium on Virtual Reality Software and Technology (VRST 98), pp. 139-144, November 1998. http://www3.nccu.edu.tw/~li/Publication/
[Lin91] Lin, Ming. John Canny. “A Fast Algorithm for Incremental Distance Calculation.” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, pp. 1008-1014, April 1991.
[Luebke95] Luebke, David. Chris Georges. “Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets.” Proceedings of the 1995 Symposium on Interactive 3D Graphics, pp. 105-106, 1995. http://www.cs.virginia.edu/~luebke/publications/portals.html
[Luebke02] Luebke, David. Martin Reddy. Jonathan Cohen. Amitabh Varshney. Benjamin Watson. Robert Huebner. Level of Detail for 3D Graphics. Morgan Kaufmann Publishers, 2002.
[Lumelsky85] Lumelsky, Vladimir. “On Fast Computation of Distance Between Line Segments.” Information Processing Letters, vol. 21, no. 2, pp. 51-61, 1985.
[MacDonald90] MacDonald, David. Kellogg Booth. “Heuristics for Ray Tracing Using Space Subdivision.” The Visual Computer, vol. 6, no. 3, pp. 153-166, 1990.
[Mäntylä88] Mäntylä, Martti. An Introduction to Solid Modeling. Computer Science Press, Rockville, Maryland. 1988.
[McConnell93] McConnell, Steve. Code Complete. Microsoft Press, 1993.
[McGuire00] McGuire, Max. “Quake 2 BSP File Format,” June 7, 2000. http://www.flipcode.com/tutorials/tut_q2levels.shtml
[Meisters75] Meisters, Gary. “Polygons Have Ears.” American Mathematical Monthly, vol. 82, pp. 648-651, June/July 1975.
[Melax00] Melax, Stan. “Dynamic Plane Shifting BSP Traversal.” Proceedings of Graphics Interface 2000, pp. 213-220, May 2000. http://www.graphicsinterface.org/proceedings/2000/140/
[Meyer02] Meyer, Mark. Haeyoung Lee. Alan Barr. Mathieu Desbrun. “Generalized Barycentric Coordinates on Irregular Polygons.” Journal of Graphics Tools, vol. 7, no. 1, pp. 13-22, 2002. http://www-grail.usc.edu/pubs/MHBD02.pdf
[Michelucci96] Michelucci, Dominique. “Arithmetic Issues in Geometric Computations.” Proceedings of the 2nd Real Numbers and Computers Conference. Marseille, France. pp. 43-69. April 1996. http://www.emse.fr/~micheluc/nro96.ps.gz
[Miettinen02a] Miettinen, Ville. “RE: A better method of removing duplicate vertices...” gdalgorithms-list mailing list article. July 3, 2002. http://sourceforge.net/mailarchive/message.php?msg_id=1777716
[Miettinen02b] Miettinen, Ville. “RE: Generating a (near) optimal OBB from set of points.” gdalgorithms-list mailing list article. December 5, 2002. http://sourceforge.net/mailarchive/message.php?msg_id=2623767
[Mirtich96a] Mirtich, Brian. “Fast and Accurate Computation of Polyhedral Mass Properties.” Journal of Graphics Tools. vol. 1, no. 2, pp. 31-50, 1996. http://citeseer.ist.psu.edu/mirtich96fast.html
[Mirtich96b] Mirtich, Brian. “Impulse-based Dynamic Simulation of Rigid Body Systems,” Ph.D. thesis, Department of Computer Science, University of California, Berkeley, 1996.
[Mirtich97] Mirtich, Brian. “Efficient Algorithms for Two-phase Collision Detection.” Practical Motion Planning in Robotics: Current Approaches and Future Directions, John Wiley & Sons, pp. 203-223, 1998. Se also: Technical report TR97-23, Mitsubishi Electric Research Laboratories (MERL), 1997. http://www.merl.com/reports/TR97-23/
[Mirtich98] Mirtich, Brian. “V-Clip: Fast and Robust Polyhedral Collision Detection.” ACM Transactions on Graphics, vol. 17, no. 3, pp. 177-208, July 1998. See also: Technical report TR97-05, Mitsubishi Electric Research Laboratories (MERL), 1997. http://www.merl.com/papers/docs/TR97-05.pdf
[Mitchell90] Mitchell, Don. “Robust Ray Intersection with Interval Arithmetic.” Proceedings on Graphics interface 1990, Halifax, Nova Scotia, pp. 68-74, 1990.
[Mitchell00] Mitchell, Mark. “Type-based Alias Analysis.” Dr. Dobb’s Journal, October 2000.
[Möller97a] Möller, Tomas. Ben Trumbore. “Fast, Minimum Storage Ray/Triangle Intersection.” Journal of Graphics Tools, vol. 2, no. 1, pp. 21-28, 1997. See also: http://www.graphics.cornell.edu/pubs/1997/MT97.html
[Möller97b] Möller, Tomas. “A Fast Triangle-Triangle Intersection Test.” Journal of Graphics Tools, vol. 2, no. 2, pp. 25-30, 1997. See also: http://www.ce.chalmers.se/staff/tomasm/pubs/tritri.pdf
[Moore66] Moore, Ramon. Interval Analysis. Prentice-Hall, 1966.
[Moore88] Moore, Matthew. Jane Wilhelms. “Collision Detection and Response for Computer Animation.” Computer Graphics (SIGGRAPH 1988 Proceedings), vol. 22, no. 4, pp. 289-298, August 1988.
[Mortenson99] Mortenson, Michael. Mathematics for Computer Graphics Applications (2d ed.). Industrial Press, 1999.
[Motzkin53] Motzkin, Theodore. H. Raiffa. G. Thompson. R. Thrall. “The Double Description Method.” in H. Kuhn and A. Tucker (editors), Contributions to the Theory of Games volume II, volume 8 of Annals of Math. Studies, pp. 51-73. Princeton University Press, NJ, 1953.
[Mulmuley94] Mulmuley, Ketan. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, 1994.
[Murali97] Murali, T.M., Thomas Funkhouser. “Consistent Solid and Boundary Representations from Arbitrary Polygon Data.” Proceedings of the 1997 Symposium on Interactive 3D Graphics, pp. 155-162, April 1997. http://www.cs.princeton.edu/~funk/symp97.ps.gz
[Myszkowski95] Myszkowski, Karol. Oleg Okunev. Tosiyasu Kunii. “Fast Collision Detection Between Computer Solids Using Rasterizing Graphics Hardware.” The Visual Computer, vol. 11, no. 9, pp. 497–511, 1995. See also: Technical report 94-1-047, University of Aizu, Japan, 1995. ftp://ftp.u-aizu.ac.jp/u-aizu/doc/Tech-Report/1994/94-1-047.ps.Z
[Nagle02] Nagle, John. “Re: Collision points with SOLID.” comp.graphics.algorithms usenet newsgroup article, Message-ID <3C4089BC.80907@animats.com>. January 12, 2002. http://groups.google.com/groups?selm=3C4089BC.80907%40animats.com
[Naylor93] Naylor, Bruce. “Constructing Good Partitioning Trees.” Proceedings of Graphics Interface 1993, pp. 181-191, May 1993. http://www.graphicsinterface.org/pre1996/93-Naylor.pdf
[Nettle00] Nettle, Paul. “Generic Collision Detection for Games Using Ellipsoids,” Unpublished manuscript, 2000. http://www.fluidstudios.com/publications.html
[Omohundro89] Omohundro, Stephen. “Five Balltree Construction Algorithms,” Technical report TR-89-063, International Computer Science Institute, Berkeley, November 1989. http://www.icsi.berkeley.edu/ftp/global/pub/techreports/1989/tr-89-063.pdf
[O’Rourke85] O’Rourke, Joseph. “Finding Minimal Enclosing Boxes.” International Journal of Computer and Information Sciences, vol. 14, no. 3, pp. 183-199, June 1985.
[O’Rourke98] O’Rourke, Joseph. Computational Geometry in C (2d ed.). Cambridge University Press, 1998.
[Ostgard03] Ostgard, Nathan. “Quake 3 BSP Collision Detection,” March 28, 2003. http://www.devmaster.net/articles/quake3collision/
[O’Sullivan99] O’Sullivan, Carol. John Dingliana. “Real-time Collision Detection and Response Using Sphere-trees,” Technical report TCD-CS-1999-10, Computer Science Department, Trinity College Dublin, February 1999. http://www.cs.tcd.ie/publications/tech-reports/reports.99/TCD-CS-1999-10.pdf
[Paeth95] Paeth, Alan (editor). Graphics Gems V. Academic Press, 1995. http://www.graphicsgems.org/
[Paoluzzi89] Paoluzzi, Alberto. M. Ramella. A. Santarelli. “Boolean Algebra over Linear Polyhedra.” Computer Aided Design, vol. 21, no. 8, pp. 474-484, August 1989.
[Preparata85] Preparata, Franco. Michael Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
[Priest91] Priest, Douglas. “Algorithms for Arbitrary Precision Floating Point Arithmetic.” Proceedings of the 10th Symposium on Computer Arithmetic, pp. 132-143, Grenoble, France, June 1991. http://www.cs.cmu.edu/~quake-papers/related/Priest.ps
[Prokop99] Prokop, Harald. “Cache-oblivious Algorithms,” Master’s Thesis, Massachusetts Institute of Technology, 1999.
[Puppo97] Puppo, Enrico. Roberto Scopigno. “Simplification, LOD and Multiresolution – Principles and Applications.” Eurographics 1997 Tutorial Notes PS97 TN4, 1997. http://www.disi.unige.it/person/PuppoE/PS/EG97-tut.ps.gz
[Purcell02] Purcell, Timothy. Ian Buck. William Mark. Pat Hanrahan. “Ray Tracing on Programmable Graphics Hardware.” ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH 2002), vol. 21, no. 3, pp. 703-712, 2002. http://graphics.stanford.edu/papers/rtongfx/
[Quinlan94] Quinlan, Sean. “Efficient Distance Computation Between Non-convex Objects.” Proceedings of IEEE International Conference on Robotics and Automation, pp. 3324-3329, May 1994. http://www.cs.bell-labs.com/who/seanq/icra94.pdf
[Redon02] Redon, Stéphane. Abderrahmane Kheddar. Sabine Coquillart. “Fast Continuous Collision Detection Between Rigid Bodies.” Computer Graphics Forum (Eurographics 2002 Proceedings), vol. 21, no. 3, September 2002. http://www-rocq.inria.fr/i3d/i3d/publications/redoneg2002.pdf
[Reinhard00] Reinhard, Erik. Brian Smits. Charles Hansen. “Dynamic Acceleration Structures for Interactive Ray Tracing.” Proceedings of the Eurographics Workshop on Rendering Techniques 2000, Brno, Czech Republic, pp. 299-306, June 2000. http://www.cs.utah.edu/~reinhard/papers/egwr2k.pdf
[Ribelles01] Ribelles, José. Paul Heckbert. Michael Garland. Tom Stahovich. Vinit Srivastava. “Finding and Removing Features from Polyhedra.” Proceedings of 2001 ASME Design Engineering Technical Conference (DETC 01), September 2001. http://www.uiuc.edu/ph/www/garland/papers/polyfeat.pdf
[Rimon92] Rimon, Elon. Stephen Boyd. “Efficient Distance Computation Using Best Ellipsoid Fit.” Proceedings of the 1992 IEEE International Symposium on Intelligent Control, pp. 360-365, August 1992. http://citeseer.ist.psu.edu/rimon92efficient.html
[Ritter90] Ritter, Jack. “An Efficient Bounding Sphere.” in Andrew Glassner (editor), Graphics Gems, Academic Press, pp. 301-303, 1990. http://www.graphicsgems.org/
[Robison96a] Robison, Arch. “C++ Gets Faster for Scientific Computing.” Computers in Physics, vol. 10, pp. 458-462, 1996.
[Robison96b] Robison, Arch. “The Abstraction Penalty for Small Objects in C++.” The Parallel Object-Oriented Methods and Applications Conference (POOMA '96), 1996.
[Robison99] Robison, Arch. “Restricted Pointers are Coming.” C/C++ Users Journal, July 1999. http://www.cuj.com/documents/s=8050/cuj9907robison/
[Rockafellar96] Rockafellar, R. Tyrell. Convex Analysis. Princeton University Press, 1996.
[Rogers98] Rogers, David. Procedural Elements for Computer Graphics (2d ed.). McGraw-Hill, 1998.
[Rossignac92] Rossignac, Jarek. Abe Megahed. Bengt-Olaf Schneider. “Interactive Inspection of Solids: Cross-sections and Interferences.” Computer Graphics (SIGGRAPH 1992 Proceedings), July 1992.
[Röttger02] Röttger, Stefan. Alexander Irion. Thomas Ertl. “Shadow Volumes Revisited.” in Vaclav Skala (editor), Proceedings of Winter School of Computer Graphics (WSCG), pp. 373-379. 2002. http://www.vis.uni-stuttgart.de/~roettger/data/Papers/SHADOWS.PDF
[Rundberg99] Rundberg, Peter. “An Optimized Collision Detection Algorithm,” MSc Thesis, Department of Computer Engineering, Chalmers University of Technology, Gothenburg, 1999. http://www.ce.chalmers.se/staff/biff/exjobb/
[Ruspini] Ruspini, Diego. gilbert.c, a C version of the original Fortran implementation of the GJK algorithm. ftp://labrea.stanford.edu/cs/robotics/sean/distance/gilbert.c
[Salesin92] Salesin, David. Filippo Tampieri. “Grouping Nearly Coplanar Polygons into Coplanar Sets.” in David Kirk (editor), Graphics Gems III, Academic Press, pp. 225-230, 1992. http://www.graphicsgems.org/
[Samet90a] Samet, Hanan. Applications of Spatial Data Structures. Addison-Wesley, 1990.
[Samet90b] Samet, Hanan. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[Sauer01] Sauer, Florian. “Dealing with Memory Constraints: Bringing Dr. Jones to the Infernal Machine,” Presentation at Game Developer’s Conference, San José, 2001. http://www.gdconf.com/archives/2001/sauer.doc
[Sayood00] Sayood, Khalid. Introduction to Data Compression (2d ed.). Morgan Kaufmann Publishers, 2000.
[Schneider02] Schneider, Philip. David Eberly. Geometric Tools for Computer Graphics. Morgan Kaufmann Publishers, 2002.
[Schömer00] Schömer, Elmar. Jürgen Sellen. Marek Teichmann. Chee-Keng Yap. “Smallest Enclosing Cylinders.” Algorithmica, vol. 27, no. 2, pp. 170-186, 2000. http://www.mpi-sb.mpg.de/~schoemer/publications/ALGO00.pdf
[Schorn94] Schorn, Peter. Frederick Fisher. “Testing the Convexity of a Polygon.” in Paul Heckbert (editor), Graphics Gems IV, Academic Press, pp. 7-15, 1994. http://www.graphicsgems.org/
[Schroeder01] Schroeder, Tim. “Collision Detection Using Ray Casting.” Game Developer, vol. 8, no. 8, pp. 50-56, August 2001. http://www.gdmag.com/src/aug01.zip
[Segal03] Segal, Mark. Kurt Akeley. The OpenGL Graphics System: A Specification (Version 1.5), October 2003. http://www.opengl.org/documentation/specs/version1.5/glspec15.pdf
[Seidel90] Seidel, Raimund. “Linear Programming and Convex Hulls Made Easy.” Proceedings 6th Annual ACM Conference On Computational Geometry, pp. 211-215, Berkeley, CA, 1990.
[Shene94] Shene, Ching-Kuang. “Computing the Intersection of a Line and a Cylinder.” in Paul Heckbert (editor), Graphics Gems IV, Academic Press, pp. 353-355, 1994. http://www.graphicsgems.org/
[Shewchuk96a] Shewchuk, Jonathan. “Robust Adaptive Floating-point Geometric Predicates.” Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp. 141-150, 1996. http://www.cs.cmu.edu/afs/cs/project/quake/public/papers/robust-predicates.ps
[Shewchuk96b] Shewchuk, Jonathan. “Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator.” First Workshop on Applied Computational Geometry, pp. 124-133, May 1996. http://www-2.cs.cmu.edu/afs/cs/project/quake/public/papers/triangle.ps
[Shirley00] Shirley, Peter. Realistic Ray Tracing. A K Peters, 2000.
[Shoemake98] Shoemake, Ken. “Plücker Coordinate Tutorial.” Ray Tracing News, vol. 11, no. 1, July 1998. http://www.acm.org/tog/resources/RTNews/html/rtnv11n1.html#art3
[Skiena98] Skiena, Steven. The Algorithm Design Manual. TELOS (Springer-Verlag), 1998.
[Snyder93] Snyder, John. Adam Woodbury. Kurt Fleischer. Bena Currin. Alan Barr. “Interval Methods for Multi-point Collisions Between Time-dependent Curved Surfaces.” Computer Graphics (SIGGRAPH 1993 Proceedings), pp. 321-334, 1993. http://doi.acm.org/10.1145/166117.166158
[Stepanov] Stepanov, Alexander. Stepanov Benchmark Code. http://www.physics.ohio-state.edu/~wilkins/computing/benchmark/stepanov.html
[Stewart02] Stewart, Nigel. Geoff Leach. Sabu John. “Linear-time CSG Rendering of Intersected Convex Objects.” The 10th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2002 (WSCG 2002), vol. 2, pp. 437-444. http://www.nigels.com/research/wscg2002.pdf
[StøltingBrodal01] Stølting Brodal, Gerth. Rolf Fagerberg. Riko Jacob. “Cache Oblivious Search Trees via Binary Trees of Small Height,” Technical Report BRICS RS-01-36, BRICS, University of Aarhus, Denmark. October 2001. http://www.brics.dk/~rjacob/Publications/brics-rs-01-36.ps.gz
[Stone98] Stone, James. John Porrill. Independent Component Analysis and Projection Pursuit: A Tutorial Introduction. Unpublished Technical Report, April 1998. ftp://ftp.shef.ac.uk/pub/misc/personal/pc1jvs/papers/ica_tutorial.ps.gz
[Sunday02] Sunday, Daniel. “Fast Polygon Area and Newell Normal Computation.” Journal of Graphics Tools, vol. 7, no. 2, pp. 9-13, 2002.
[Sutherland74] Sutherland, Ivan. Gary Hodgman. “Reentrant Polygon Clipping.” Communications of the ACM, vol. 17, no. 1, pp. 32-42, 1974.
[Szécsi03] Szécsi, László. “An Effective Implementation of the k-D tree.” in Jeff Lander (editor), Graphics Programming Methods, Charles River Media, pp. 315-326, 2003.
[Tampieri92] Tampieri, Filippo. “Newell’s Method for Computing the Plane Equation of a Polygon.” in David Kirk (editor), Graphics Gems III, Academic Press, pp. 231-232, 1992. http://www.graphicsgems.org/
[Teller92] Teller, Seth. “Visibility Computations in Densely Occluded Polyhedral Environments,” Ph.D. thesis, Computer Science Division (EECS), University of California, Berkeley, 1992. http://graphics.lcs.mit.edu/~seth/pubs/pubs.html
[Thibault87] Thibault, William. Bruce Naylor. “Set Operations on Polyhedra Using Binary Space Partitioning Trees.” Computer Graphics (SIGGRAPH 1987 Proceedings), vol. 21, no. 4, pp. 153-162, 1987. http://doi.acm.org/10.1145/37401.37421
[Toussaint83] Toussaint, Godfried. “Solving Geometric Problems with the Rotating Calipers.” Proceedings of IEEE MELECON 1983, Athens, Greece, May 1983. http://www-cgrl.cs.mcgill.ca/~godfried/publications/calipers.ps.gz
[Tzafestas96] Tzafestas, Costas. Philippe Coiffet. “Real-time Collision Detection Using Spherical Octrees: Virtual Reality Application.” Proceedings 1996 IEEE International Workshop on Robot and Human Communication (ROMAN 96). Tsukuba, Japan, pp. 500-506, November 1996. http://www.softlab.ntua.gr/~ktzaf/Publications/Tzafestas_ROMAN_96.zip
[Ulrich00] Ulrich, Thatcher. “Loose Octrees.” in Mark DeLoura (editor), Game Programming Gems. Charles River Media, pp. 444-453, 2000.
[Veldhuizen95] Veldhuizen, Todd. “Expression Templates.” C++ Report, vol. 7, no. 5, pp. 26-31, June 1995. http://osl.iu.edu/~tveldhui/papers/Expression-Templates/exprtmpl.html
[Vlack01] Vlack, Kevin. Susumu Tachi. “Fast and Accurate Spacio-temporal Intersection Detection with the GJK Algorithm.” Proceedings of the International Conference on Artificial Reality and Telexistence (ICAT 01), pp. 79-84, 2001. http://sklab-www.pi.titech.ac.jp/~hase/ICATPHP/upload/30_camera.pdf
[Voorhies92] Voorhies, Douglas. “Triangle-Cube Intersection.” in David Kirk (editor), Graphics Gems III, Academic Press, pp. 236-239, 1992. http://www.graphicsgems.org/
[Wald01] Wald, Ingo. Philipp Slusallek. Carsten Benthin. Markus Wagner. “Interactive Rendering with Coherent Ray Tracing.” Proceedings of the EUROGRAPHICS 2001, pp. 153-164, 2001. http://graphics.cs.uni-sb.de/Publications/2001/InteractiveRenderingWithCoherentRayTracing.pdf
[Walker99] Walker, Robert. Jack Snoeyink. “Practical Point-in-Polygon Tests Using CSG Representations of Polygons,” Technical report TR-99-12, Department of Computer Science, University of British Columbia, November 1999. http://www.cs.ubc.ca/labs/imager/tr/pdf/walker.1999a.pdf
[Walster98] Walster, William. The Extended Real Interval System, 1998. http://www.mscs.mu.edu/~globsol/Papers/extended_intervals.ps
[Wang01] Wang, Wenping. Jiaye Wang. Myung-Soo Kim. “An Algebraic Condition for the Separation of Two Ellipsoids.” Computer Aided Geometric Design, vol. 18, no. 6, pp. 531-539, July 2001. http://3map.snu.ac.kr/mskim/ftp/ellipsoid.pdf
[Wang02] Wang, Wenping. Yi-King Choi. Bin Chan. Myung-Soo Kim. Jiaye Wang. Efficient Collision Detection for Moving Ellipsoids Based on Simple Algebraic Test and Separating Planes. Technical report TR-2002-16, Department of Computer Science and Information Systems, University of Hong Kong, 2002. http://www.csis.hku.hk/research/techreps/document/TR-2002-16.pdf
[Warren93] Warren, Michael. John Salmon. “A Parallel Hashed Oct-tree N-body Algorithm.” Proceedings of Supercomputing 1993, pp. 12-21, 1993. http://www.thesalmons.org/john/pubs/papers.html
[Weghorst84] Weghorst, Hank. Gary Hooper. Donald Greenberg. “Improved Computational Methods for Ray Tracing.” ACM Transactions on Graphics, vol. 3, no. 1, pp. 52-69, January 1984. http://doi.acm.org/10.1145/357332.357335
[Weiler88] Weiler, Kevin. “The Radial Edge Structure: A Topological Representation for Non-manifold Geometric Modeling.” Geometric Modeling for CAD Applications, North-Holland, pp. 3-36, 1988.
[Weiler94] Weiler, Kevin. “An Incremental Angle Point in Polygon Test.” in Paul Heckbert (editor), Graphics Gems IV, Academic Press, pp. 16-23, 1994. http://www.graphicsgems.org/
[Welzl91] Welzl, Emo. “Smallest Enclosing Disks (Balls and Ellipsoids).” in Hermann Maurer (editor), New Results and New Trends in Computer Science, vol. 555 of Lecture Notes in Computer Science, pp. 359-370, Springer-Verlag, 1991. http://citeseer.ist.psu.edu/welzl91smallest.html
[Wu92] Wu, Xiaolin. “A Linear-time Simple Bounding Volume Algorithm.” in David Kirk (editor), Graphics Gems III, Academic Press, pp. 301-306, 1992. http://www.graphicsgems.org/
[Xavier97] Xavier, Patrick. “Fast Swept-volume Distance for Robust Collision Detection.” Proceedings of the 1997 IEEE International Conference on Robotics and Automation, Albuquerque, New Mexico, April 1997.
[Yong00] Lu, Yong. Rajit Gadh. “Constrained and Aggregated Half Space Volume Decomposition: Generating Cutting Patches with ‘Internal’ and ‘External’ Extending.” Proceedings of the Eighth Pacific Conference on Computer Graphics and Applications (PG 00), pp. 262-271, 2000. http://csdl.computer.org/comp/proceedings/pg/2000/0868/00/08680262abs.htm
[Zachmann95] Zachmann, Gabriel. “The BoxTree: Exact and Fast Collision Detection of Arbitrary Polyhedra.” First Workshop on Simulation and Interaction in Virtual Environments (SIVE 95), University of Iowa, July 1995. http://web.informatik.uni-bonn.de/II/ag-klein/people/zach/papers/
[Zachmann98] Zachmann, Gabriel. “Rapid Collision Detection by Dynamically Aligned DOP-trees.” Proceedings of IEEE Virtual Reality Annual International Symposium (VRAIS 98). Atlanta, Georgia, pp. 90-97, March 1998. http://web.informatik.uni-bonn.de/II/ag-klein/people/zach/papers/
[Zachmann00] Zachmann, Gabriel. “Virtual Reality in Assembly Simulation – Collision Detection, Simulation Algorithms, and Interaction Techniques,” Ph.D. thesis, Department of Computer Science, Darmstadt University of Technology, Germany, May 2000. http://web.informatik.uni-bonn.de/II/ag-klein/people/zach/papers/zachmann_diss.pdf
[Zhang95] Zhang, Lixin. Jing Xiao. “Derivation of Contact States from Geometric Models of Objects.” Proceedings of the IEEE International Conference Assembly and Task Planning, Pittsburgh, pp. 375-380, August 1995. http://www.cs.uncc.edu/~xiao/contactd/ct.ps