EFFICIENT UNIFORM GRIDS FOR COLLISION HANDLING IN MEDICAL SIMULATORS

Marc Gissler, Markus Ihmsen, Matthias Teschner

Abstract

We investigate spatial acceleration structures within collision handling in scenarios with ”worst-case” spatial layout. These are scenarios where lots of collisions and interactions persist over large time intervals. We focus on acceleration structures based on uniform grids and assess their efficiency in construction, update and query. Z-curves as a technique for the mapping of spatial locality to uniform grids are analyzed to improve the cache-hit rate. The findings are applied to a deformable collision framework. Experiments are performed on scenarios that are typical for medical simulators. They often exhibit the ”worst case” spatial layout mentioned above.

References

  1. (2005). OpenMP Application Program Interface, Version 2.5. OpenMP Architecture Review Board.
  2. Alcantara, D. A., Sharf, A., Abbasinejad, F., Sengupta, S., Mitzenmacher, M., Owens, J. D., and Amenta, N. (2009). Real-time parallel hashing on the GPU. In SIGGRAPH Asia 7809: ACM SIGGRAPH Asia 2009 papers, pages 1-9, New York, NY, USA. ACM.
  3. Amdahl, G. M. (1967). Validity of the single processor approach to achieving large scale computing capabilities. In AFIPS 7867 (Spring): Proceedings of the April 18-20, 1967, spring joint computer conference, pages 483-485, New York, NY, USA. ACM.
  4. Bentley, J. L. and Friedman, J. H. (1979). Data structures for range searching. ACM Comput. Surv., 11(4):397- 409.
  5. Ericson, C. (2004). Real-Time Collision Detection. Morgan Kaufmann.
  6. Fares, C. and Hammam, Y. (2005). Collision detection for rigid bodies: A state of the art review. In GraphiCon 2005.
  7. Fredman, M. L., Komlós, J., and Szemerédi, E. (1984). Storing a sparse table with 0(1) worst case access time. J. ACM, 31(3):538-544.
  8. Gissler, M., Schmedding, R., and Teschner, M. (2009). Time-critical collision handling for deformable modeling. Computer Animation and Virtual Worlds, 20:355-364.
  9. Griebel, M. and Zumbusch, G. (1998). Hash-storage techniques for adaptive multilevel solvers and their domain decomposition parallelization. In Domain decomposition methods 10. The 10th int. conf., Boulder, volume 218 of Contemp. Math, pages 279-286. AMS.
  10. Hubbard, P. M. (1996). Approximating polyhedra with spheres for time-critical collision detection. ACM Trans. Graph., 15(3):179-210.
  11. Kalojanov, J. and Slusallek, P. (2009). A parallel algorithm for construction of uniform grids. In HPG 7809: Proceedings of the Conference on High Performance Graphics 2009, pages 23-28, New York, NY, USA.
  12. Kockara, S., Halic, T., Iqbal, K., Bayrak, C., and Rowe, R. (2007). Collision detection: A survey. pages 4046 -4051.
  13. Lagae, A. and Dutré, P. (2008). Compact, fast and robust grids for ray tracing. Computer Graphics Forum (Proceedings of the 19th Eurographics Symposium on Rendering), 27(4):1235-1244.
  14. Levinthal, C. (1966). Molecular model-building by computer. Scientific American, 214:42-52.
  15. Lin, M. and Manocha, D. (2003). Collision and proximity queries. In Handbook of Discrete and Computational Geometry.
  16. O'Sullivan, C. and Dingliana, J. (2001). Collisions and perception. ACM Trans. Graph., 20(3):151-168.
  17. Pagh, R. and Rodler, F. F. (2004). Cuckoo hashing. J. Algorithms, 51(2):122-144.
  18. Pascucci, V. and Frank, R. J. (2001). Global static indexing for real-time exploration of very large regular grids. In Supercomputing 7801: Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM), pages 2-2, New York, NY, USA. ACM.
  19. Rabin, M. O. (1976). Probabilistic algorithms. In Traub, J. F., editor, Algorithms and complexity: new directions and recent results, pages 21-39. Academic Press, New York.
  20. Tang, M., Curtis, S., Yoon, S.-E., and Manocha, D. (2008). Interactive continuous collision detection between deformable models using connectivity-based culling. In SPM 7808: Proceedings of the 2008 ACM symposium on Solid and physical modeling, pages 25-36, New York, NY, USA. ACM.
  21. Teschner., M., Heidelberger, B., Mueller, M., Pomeranets, D., and Gross, M. (2003). Optimized spatial hashing for collision detection of deformable objects. In Vision, Modeling, Visualization VMV'03, Munich, Germany, pages 47 - 54.
  22. Teschner, M., Kimmerle, S., Heidelberger, B., Zachmann, G., Raghupathi, L., Fuhrmann, A., Cani, M.-P., Faure, F., Magnenat-Thalmann, N., Strasser, W., and Volino, P. (2005). Collision detection for deformable objects. Computer Graphics forum 24, 24(1):61 - 81.
Download


Paper Citation


in Harvard Style

Gissler M., Ihmsen M. and Teschner M. (2011). EFFICIENT UNIFORM GRIDS FOR COLLISION HANDLING IN MEDICAL SIMULATORS . In Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011) ISBN 978-989-8425-45-4, pages 79-84. DOI: 10.5220/0003324300790084


in Bibtex Style

@conference{grapp11,
author={Marc Gissler and Markus Ihmsen and Matthias Teschner},
title={EFFICIENT UNIFORM GRIDS FOR COLLISION HANDLING IN MEDICAL SIMULATORS},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011)},
year={2011},
pages={79-84},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003324300790084},
isbn={978-989-8425-45-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011)
TI - EFFICIENT UNIFORM GRIDS FOR COLLISION HANDLING IN MEDICAL SIMULATORS
SN - 978-989-8425-45-4
AU - Gissler M.
AU - Ihmsen M.
AU - Teschner M.
PY - 2011
SP - 79
EP - 84
DO - 10.5220/0003324300790084