A COMPARATIVE STUDY OF IMPLEMENTED COLLISION DETECTION STRATEGIES

Félix Paulano, Juan J. Jiménez, Rubén Pulido, Carlos J. Ogayar

Abstract

Many computer interactive environments require to calculate collision detections between geometrical models, usually triangle meshes. In this paper, a comparative study of some collision detection strategies is realized. For this purpose, the compared algorithms have been implemented. Some of these algorithms also allow realizing other procedures, such as calculating distances or overlapping triangles. Hence, the main features of each algorithm have been explained. The compared strategies have been tested considering, in addition to the runtime, the pre-processing time and the memory usage. Finally, the results have been compared in order to extract the benefits and constraints of each strategy, and proposing some possible applications for each strategy.

References

  1. Bergen, G. V. D. (2003). Collision Detection in Interactive 3D Environments. Elsevier.
  2. Cameron, S. (1997). Enhancing gjk: computing minimum and penetration distances between convex polyhedra. In Robotics and Automation, 1997. Proceendings., 1997 IEEE Inter, pages 3112-3117.
  3. Chen, H. and Huang, T. (1988). A survey of construction and manipulation of octrees. Computer Vision, Graphics, and Image Processing, 43:409-431.
  4. Ehmann, S. and Lin, M. (2000). Accelerated proximity queries between convex polyhedra by multi-level voronoi marching. In Intelligent Robots and Systems, 2000. (IROS 2000). Proceedings. 2000 IEEE/RSJ International Conference on, volume 3, pages 2101 - 2106.
  5. Ehmann, S. and Lin, M. (2001). Accurate and fast proximity queries between polyhedra using convex surface decomposition. Computer Graphics Forum, 20(3):500-511.
  6. Feito, F. and Torres, J. (1997). Inclusion test for general polyhedral. Computers & Graphics, 21(1):23-30.
  7. Geiger, B. (2000). Real-time collision detection and response for complex environments. In Computer Graphics International, 2000. Proceedings, pages 105 - 113.
  8. Gilbert, E., Johnson, D., and Keerthi, S. (1987). A fast procedure for computing the distance between complex objects in three space. In Robotics and Automation. Proceedings. 1987 IEEE International Conference on, volume 4, pages 1883-1889.
  9. Gottschalk, S., Lin, M., and Manocha, D. (1996). Obbtree: a hierarchical structure for rapid interference detection. In Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, SIGGRAPH 7896, pages 171-180. ACM.
  10. Jiménez, J., Feito, F., Segura, R., and Ogáyar, C. (2006). Particle oriented collision detection using simplicial coverings and tetra-trees. Computer Graphics Forum, 25:53-68.
  11. Jiménez, J. and Segura, R. (2008). Collision detection between complex polyhedra. Computers & Graphics, 4(32).
  12. Jiménez, J. J., Feito, F. R., and Segura, R. J. (2011). Tetratrees properties in graphic interaction. Graphical Models, 73(5):182 - 201.
  13. Jiménez, J. J., Martínez, A., and Feito, F. R. (2009). Disen˜o de descomposiciones espaciales jerárquicas para mallas de triángulos utilizando geometry shaders. design of hierarchical space decompositions for triangle meshes using geometry shaders. In CEIG09. Spanish conference on Computer Graphics, pages 95-104.
  14. Klosowski, J., Held, M., Mitchell, J., Sowizral, H., and Zikan, K. (1998). Efficient collision detection using bounding volume hierarchies of k-dops. Visualization and Computer Graphics, IEEE Transactions on, 4(1):21-36.
  15. Larsen, E., Gottschalk, S., Lin, M., and Manocha, D. (1999). Fast proximity queries with swept sphere volumes. Technical report, Department of Computer Science, UNC Chapel Hill.
  16. Lin, M. and Gottschalk, S. (1998). Collision detection between geometric models: A survey. In In Proc. of IMA Conference on Mathematics of Surfaces, pages 37-56.
  17. Lin, M. and Otaduy, M. (2008). Haptic Rendering: Foundations, Algorithms and Applications. A. K. Peters Ltd.
  18. Srungarapu, S., Reddy, D., Kothapalli, K., and Narayanan, P. (2011). Fast two dimensional convex hull on the gpu. In Advanced Information Networking and Applications (WAINA), 2011 IEEE Workshops of International Conference on, pages 7-12.
Download


Paper Citation


in Harvard Style

Paulano F., J. Jiménez J., Pulido R. and J. Ogayar C. (2012). A COMPARATIVE STUDY OF IMPLEMENTED COLLISION DETECTION STRATEGIES . In Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012) ISBN 978-989-8565-02-0, pages 485-490. DOI: 10.5220/0003930604850490


in Bibtex Style

@conference{grapp12,
author={Félix Paulano and Juan J. Jiménez and Rubén Pulido and Carlos J. Ogayar},
title={A COMPARATIVE STUDY OF IMPLEMENTED COLLISION DETECTION STRATEGIES},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012)},
year={2012},
pages={485-490},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003930604850490},
isbn={978-989-8565-02-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012)
TI - A COMPARATIVE STUDY OF IMPLEMENTED COLLISION DETECTION STRATEGIES
SN - 978-989-8565-02-0
AU - Paulano F.
AU - J. Jiménez J.
AU - Pulido R.
AU - J. Ogayar C.
PY - 2012
SP - 485
EP - 490
DO - 10.5220/0003930604850490