Encyclopedia of Computer Graphics and Games

Living Edition
| Editors: Newton Lee

Bounding Volume Hierarchies for Rigid Bodies

  • Simena DinasEmail author
Living reference work entry
DOI: https://doi.org/10.1007/978-3-319-08234-9_332-1

Synonyms

Definition

A bounding volume is a geometric primitive that encloses one or more objects and leads to cheaper overlapping tests (Ericson 2005). The bounding volumes most frequently used are spheres, boxes, and ellipsoids. The bounding volume hierarchy is a tree structure used to represent the set of geometric objects, which are enclose in bounding volumes. A rigid body is a solid body without deformation or whose deformation is so insignificant that it can be neglected.

Introduction

Bounding volumes and binary space partitioning belong to the acceleration structures used to increase the speed for applications that require to determine intersection between two or more objects. Bounding volume is a technique for object partitioning, which is based on object subdivision and objects level of details, whereas binary space partitioning is a technique for space partitioning, which is based on the space subdivision and space level of...

This is a preview of subscription content, log in to check access.

References

  1. Arcila, O.: Nuevas Representaciones Dobles: Estudio e Implementación. Linköping studies in science and technology: Thesis. Editorial Academica Espanola (2011)Google Scholar
  2. Bradshaw, G.: Bounding Volume Hierarchies for Level-of-Detail Collision Handling. PhD thesis, Trinity College Dublin, Dublin (2002)Google Scholar
  3. Chan, C., Tan, S.: Putting objects into a cylindrical-rectangular bounded volume. Comput. Aided Des. 36(12), 1189–1204 (2004)CrossRefGoogle Scholar
  4. Dinas, S., Bañón, J.M.: A literature review of bounding volumes hierarchy focused on collision detection – revisin de literatura de jerarqua volmenes acotantes enfocados en deteccin de colisiones. Ingeniera y Competitividad. 17, 63–76 (2015)CrossRefGoogle Scholar
  5. Dinas, S., Arcila, O., Bañón, J.M.: An’alisis de la paralelizaci’on de un esferizador geom’etrico. Cuarto Congreso Colombiano de Computación – 4CCC (2009)Google Scholar
  6. Ericson, C.: Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology). Morgan Kaufmann, Amsterdam (2005)Google Scholar
  7. Figueiredo, M., Oliveira, J., de Arajo, B.R., Pereira, J.A.M.: An efficient collision detection algorithm for point models. Graphicon 2010 – International Conference on Computer Graphics and Vision (2010)Google Scholar
  8. Lauterbach, C., Garland, M., Sengupta, S., Luebke, D., Manocha, D.: Fast bvh construction on gpus. Comput. Graphics Forum. 28(2), 375–384 (2009)CrossRefGoogle Scholar
  9. Luque, R.G., Comba, J.L.D., Freitas, C.M.D.S.: Broad phase collision detection using semi-adjusting bsp-trees. In: Proceedings of the 2005 Symposium on Interactive 3D graphics and Games, I3D’05, pp. 179–186. ACM, New York (2005)CrossRefGoogle Scholar
  10. Rubino, C., Crocco, M., Perina, A., Murino, V., and Bue, A. D. (2015). 3d structure from detections. Submitted to Computer Vision and Pattern Recognition 2015Google Scholar
  11. Spillmann, J., Becker, M., Teschner, M.: Efficient updates of bounding sphere hierarchies for geometrically deformable models. J. Vis. Commun. Image Represent. 18(2), 101–108 (2007)CrossRefGoogle Scholar
  12. Suaib, N., Bade, A., Mohamad, D.: Hybrid collision culling by bounding volumes manipulation in massive rigid body simulation. TELKOMNIKA Indonesian. J. Electr. Eng. 11(6), 3115–3122 (2013)Google Scholar
  13. Tang, M., Manocha, D., Kim, Y.J.: Hierarchical and controlled advancement for continuous collision detectionof rigid and articulated models. IEEE Trans. Vis. Comput. Graph. 20(5), 755–766 (2014)CrossRefGoogle Scholar
  14. Weller, R.: A brief overview of collision detection. In: New Geometric Data Structures for Collision Detection and Haptics, Springer Series on Touch and Haptic Systems, pp. 9–46. Springer International Publishing, Heidelberg (2013)CrossRefGoogle Scholar
  15. Yoon, S.-E., Manocha, D.: Cache- efficient layouts of bounding volume hierarchies. Comput. Graphics Forum. 25(3), 507–516 (2006)CrossRefGoogle Scholar
  16. Zhigang, F., Jianxun, J., Jie, X., Xiaochi, W.: Efficient collision detection using bounding volume hierarchies of obb-aabbs and its application. In: 2010 International Conference on Computer Design and Applications (ICCDA), vol. 5, pp. V5:242–V5:246 (2010)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Departamento de Electrónica y Ciencias de la ComputaciónPontificia Universidad Javeriana Cali – ColombiaCaliColombia