Advertisement

Hierarchical Representation of 3D Polyhedra

  • Murilo G. Coutinho

Abstract

Collision detection is undoubtly the most time-consuming step in a dynamicsimulation engine. In theory, as the simulation evolves, every object needs to be checked for collisions against all other objects in the simulation. Whenever a collision is detected, the simulation engine needs to trace back in time to the instant before the collision, and determine the collision point and collision normal from the relative geometric displacement of the colliding objects.

Keywords

Line Segment Convex Hull Hash Table Intersection Test Collision Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes and Comments

  1. [GLM96]
    S. Gottschalk, M. C. Lin, and D. Manocha. Obbtree: A hierarchical structure for rapid interference detection. Computer Graphics (Proceedings SIGGRAPH), 30: 171 - 180, 1996.Google Scholar
  2. [Got96]
    S. Gottschalk. The separating axis test. Technical Report TR-96-24, University of North Carolina, Chapel Hill, 1996.Google Scholar
  3. [vdB97]
    Gino van den Bergen. Efficient collision detection of complex deformable models using aabb trees. Journal of Graphics Tools, 2 (4): 1 - 13, 1997.MATHCrossRefGoogle Scholar
  4. [Sam89]
    H. Samet. Spatial Data Structures: Quadtree, Octrees and Other Hierarchical Methods. Addison-Wesley, 1989.Google Scholar
  5. [Hub96]
    Chris Hecker. How to simulate a ponytail, part 1. Game Developer Magazine, pages 34 - 42, March 2000.Google Scholar
  6. [PS85]
    Franco P. Preparata and Michael Ian Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.Google Scholar
  7. [Ede8]
    Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.Google Scholar
  8. [GL96]
    Gene H. Golub and Charles F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 1996.MATHGoogle Scholar
  9. [HJ91]
    Roger A. Horn and Charles R. Johnson. Matrix Analysis. Cambridge University Press, 1991.Google Scholar
  10. [Mir96b]
    Brian V. Mirtich. Impulse-based Dynamic Simulation of Rigid Body Systems. PhD thesis, University of California, Berkeley, 1996.Google Scholar
  11. [Got96]
    S. Gottschalk. The separating axis test. Technical Report TR-96-24, University of North Carolina, Chapel Hill, 1996.Google Scholar
  12. [Arv90]
    James Arvo. A simple method for box-sphere intersection testing. Graphics Gems, 1: 335 - 339, 1990.Google Scholar
  13. [Rit90]
    Jack Ritter. An efficient bounding sphere. Graphics Gems, 1: 301 - 303, 1990.Google Scholar
  14. [KPTB99]
    Evaggelia-Aggeliki Karabassi, Georgios Papaioannou, Theoharis Theoharis, and Alexander Boehm. Intersection test for collision detection in particle systems. Journal of Graphics Tools, 4 (1): 25 - 37, 1999.CrossRefGoogle Scholar
  15. [Hel97]
    Martin Held. ERIT: A collection of efficient and reliable intersection tests. Journal of Graphics Tools, 2 (4): 25 - 44, 1997.CrossRefGoogle Scholar
  16. [G1a94]
    Georg Glaeser. Fast Algorithms for 3D-Graphics. Springer-Verlag, 1994.Google Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Murilo G. Coutinho
    • 1
  1. 1.Los AngelesUSA

Personalised recommendations