skip to main content
10.1145/514191.514231acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
Article

A voxel-based parallel collision detection algorithm

Published:22 June 2002Publication History

ABSTRACT

Two physical objects cannot occupy the same space at the same time. Simulated physical objects do not naturally obey this constraint. Instead, we must detect when two objects have collided---we must perform collision detection. This work presents a simple voxel-based collision detection algorithm, an efficient parallel implementation of the algorithm, and performance results.

References

  1. S. Bandi and D. Thalmann. An adaptive spatial subdivision of the object space for fast collision of animated rigid bodies. In Proceedings of Eurographics '95, pages 259--270, August 1995. http://ligwww.epfl.ch/~thalmann/Google ScholarGoogle Scholar
  2. S. Brown, S. Attaway, S. Plimpton, and B. Hendrickson. Parallel strategies for crash and impact simulations. Computer Methods in Applied Mechanics and Engineering, 184:375--390, 2000Google ScholarGoogle ScholarCross RefCross Ref
  3. R. Brunner and L. Kalée. Adapting to load on workstation clusters. In The Seventh Symposium on the Frontiers of Massively Parallel Computation, pages 106--112, February 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Cameron. Approximation hierarchies and s-bounds. In Proceedings of Symposium on Solid Modeling Foundations and CAD/CAM Applications, pages 129--137, 1991 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Curless and M. Levoy. A volumetric method for building complex models from range images. In Proceedings of ACM Siggraph '96, pages 303--312, 1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. Farouki, C Neff, and M. O'Connor. Automatic parsing of degnerate quadric-surface intersections. ACM Transactions on Graphics, 8:174--203, 1989 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Proceedings of ACM Siggraph, pages 124--133, 1980 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170--231, June 1998 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. Gilbert, D. Johnson, and S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE Journal of Robotics and Automation, RA-4:193--203, 1988Google ScholarGoogle ScholarCross RefCross Ref
  10. S. Gottschalk, M. Lin, and D. Manocha. Obb-tree: A heirarchical structure for rapid interference detection. In Proceedings of ACM Siggraph '96, pages 171--180, 1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Chris Hecker. Let's get to the (floating) point. Game Developer Magazine, Feb/Mar, 1996Google ScholarGoogle Scholar
  12. P. Hubbard. Efficient Collision Detection for Animation and Robotics. PhD thesis, Brown University, 1994Google ScholarGoogle Scholar
  13. P. Jiménez, F. Thomas, and C. Torras. 3d collision detection: A survey. Computers and Graphics, 25(2):269--285, 2001Google ScholarGoogle ScholarCross RefCross Ref
  14. L. Kale and S. Krishnan. Charm++: Parallel Programming with Message-Driven Objects. In Parallel Programming using C++, pages 175--213. 1996. http://charm.cs.uiuc.edu/Google ScholarGoogle Scholar
  15. L. Kalée, R. Skeel, M. Bhandarkar, R. Brunner, A. Gursoy, N. Krawetz, J. Phillips, A. Shinozaki, K. Varadarajan, and K. Schulten. NAMD2: Greater scalability for parallel molecular dynamics. Journal of Computational Physics, 151:283--312, 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. K. Kawachi and H. Suzuki. Distance computation between non-convex polyhedra at short range based on discrete voronoi regions. In Proceedings of Geometric Modeling and Procesing, pages 123--128, Hong Kong, 2000. IEEE Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Klosowski, M. Held, J. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volumes of k-dops. In Siggraph '96 Visual Proceedings, page 151, 1996Google ScholarGoogle Scholar
  18. S. Krishnan, A. Pattekar, M. Lin, and D. Manocha. A higher order bounding volume for fast proximity queries. In Proceedings of Third International Workshop on Algorithmic Foundations of Robotics, 1998 Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. O. Lawlor. A grid-based parallel collision detection algorithm. Master's thesis, University of Illinois at Urbana-Champaign, March 2001. http://charm.cs.uiuc.edu/papers/Google ScholarGoogle Scholar
  20. O. Lawlor and L. Kalée. Supporting dynamic parallel object arrays. In Proceedings of International Symposium on Computing in Object-oriented Parallel Environments, Stanford, CA, Jun 2001. http://charm.cs.uiuc.edu/papers/ Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Lin. Efficient Collision Detection for Animation and Robotics. PhD thesis, University of California, Berkeley, 1993 Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Lin and J. Canny. Efficient algorithms for incremental distance computation. IEEE Conference on Robotics and Automation, pages 1008--1014, 1991Google ScholarGoogle Scholar
  23. M. Lin and S. Gottschalk. Collision detection between geometric models: A survey. In Proceedings of IMA Conference on Mathematics of Surfaces, 1998. http://www.cs.unc.edu/~dm/collision.htmlGoogle ScholarGoogle Scholar
  24. S. Suri, P. Hubbard, and J. Hughes. Analyzing bounding boxes for object intersections. ACM Transactions on Graphics, 18 no. 3:257--277, July 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. G. Turk. Interactive collision detection for molecular graphics. Master's thesis, University of North Carolina at Chapel Hill, 1989Google ScholarGoogle Scholar
  26. Y. Zhou and S. Suri. Analysis of a bounding box heuristic for object intersection. Journal of the ACM, 46 no. 6:833--857, November 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. M. Zyda, W. Osborne, J. Monahan, and D. Pratt. Npsnet: Real-time collision detection and response. Journal of Visualization and Computer Animation, 4, number 1:13--24, 1993Google ScholarGoogle Scholar

Index Terms

  1. A voxel-based parallel collision detection algorithm

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ICS '02: Proceedings of the 16th international conference on Supercomputing
      June 2002
      338 pages
      ISBN:1581134835
      DOI:10.1145/514191

      Copyright © 2002 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 22 June 2002

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      ICS '02 Paper Acceptance Rate31of144submissions,22%Overall Acceptance Rate584of2,055submissions,28%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader