Balanced hierarchies for collision detection between fracturing objects

Proceedings - IEEE Virtual Reality

Volumn , Issue , 2007, Pages 83-90

  Otaduy, Miguel A ^a   Chasso, Olivier ^a   Steinemann, Denis ^a   Gross, Markus ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

AVL trees; Collision detection; Fracture

Indexed keywords

AVL-TREES; COLLISION DETECTION; FRACTURE SIMULATIONS; FRACTURING OBJECTS;

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; FRACTURE; TREES (MATHEMATICS);

COLLISION AVOIDANCE;

EID: 34547691110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VR.2007.352467     Document Type: Conference Paper

References (35)

1. G. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. Doklady Akademii Nauk SSSR, 146:263-266, 1962.
2. (Russian) English translation by M. J. Ricci in Soviet Math. Doklady, 3:1259-1263, 1962.
3. AGEIA PhysX SDK. http://www.ageia.com/developers/downloads.html.
4. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R-tree: An efficient and robust access method for points and rectangles. In SIGMOD, pages 322-331, 1990.
5. R. Bridson, R. Fedkiw, and J. Anderson. Robust treatment of collisions, contact and friction for cloth animation. In Proc. of ACM SIGGRAPH, 2002.
6. N. A. Carr and J. C. Hart. Two algorithms for fast reclustering of dynamic meshed surfaces. Eurographics Symposium on Geometry Processing, 2004.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press. Cambridge, MA, 2nd edition, 2001.
8. G. V. den Bergen. Efficient collision detection of complex deformable models using aabb trees. J. Graphics Tools, 2(4): 1-14, 1997.
9. S. Ehmann and M. C. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. Computer Graphics Forum (Proc. of Eurographlcs'2001), 20(3):500-510, 2001.
10. S. Fisher and M. C. Lin. Deformed distance fields for simulation of non-penetrating flexible bodies. Proc. of EG Workshop on Computer Animation and Simulation, pages 99- 111, 2001.
11. S. Gottschalk, M. Lin, and D. Manocha. OBB-Tree: A hierarchical structure for rapid interference detection. Proc. of ACM Siggraph '96, pages 171-180, 1996.
12. N. Govindaraju, S. Redon, M. Lin, and D. Manocha. CULLIDE: Interactive collision detection between complex models in large environments using graphics hardware. Proc. of ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware, pages 25-32, 2003.
13. N. K. Govindaraju, D. Knott, N. Jain, I. Kabul, R. Tamstoff, R. Gayle, M. C. Lin. and D. Manocha. Interactive collision detection between deformable models using chromatic decomposition. Proc. of ACM SIGGRAPH, 2005.
14. B. Heidelberger, M. Teschner, and M. Gross. Real-time volumetic intersections of deforming objects. Proc. of Vision, Modeling and Visualization, 2003.
15. P. Hubbard. Collision Detection for Interactive Graphics Applications. PhD thesis, Brown University. 1994.
16. D. L. James and D. K. Pai. Bd-tree: Output-sensitive collision detection for reduced deformable models. ACM Trans, on Graphics (Proc. of ACM SIGGRAPH), 2004.
17. J. Klosowski, M. Held, J. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-dops. IEEE Trans, on Visualization and Computer Graphics, 4(1):21-37, 1998.
18. D. E. Knuth. The Art of Computer Programming Vol. 3, Sorting and Searching, Second Edition. Addison-Wesley, Reading, MA, 1998.
19. T. Larsson and T. Akenine-Möller. Collision detection for continuously deforming bodies. Eurographics, pages 325-333, 2001.
20. T. Larsson and T. Akenine-Möller. A dynamic bounding volume hierarchy for generalized collision detection. Workshop on Virtual Reality Interaction and Physical Simulation, 2005.
21. M. C. Lin and D. Manocha. Collision and proximity queries. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd Ed., chapter 35, pages 787-807. CRC Press LLC, Boca Raton, FL, 2004.
22. J. Mezger, S. Kimmerle. and I. Etzmuss. Hierarchical techniques in collision detection for cloth animation. Journal of WSCG, 11(2):322-329, 2003.
23. N. Molino, Z. Bao, and R. Fedkiw. A virtual node algorithm for changing mesh topology during simulation. Proc. of ACM SIGGRAPH, 2004.
24. J. F. O'Brien, A. W. Bargteil, and J. K. Hodgins. Graphical modeling and animation of ductile fracture. Proc. of ACM SIGGRAPH, pages 291-294, 2002.
25. J. F. O'Brien and J. K. Hodgins. Graphical modeling and animation of brittle fracture. Proc. of ACM SIGGRAPH, 1999.
26. S. Quinlan. Efficient distance computation between non-convex objects. In Proceedings of International Conference on Robotics and Automation, pages 3324-3329, 1994.
27. E. Soisalon-Soininen and P. Widmayer. Amortized complexity of bulk updates in avl-trees. Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 2368, Springer, pages 439-448, 2002.
28. SOLID Collision Detection Library, http://www.dtecta.com/.
29. D. Steinemann, M. A. Otaduy, and M. Gross. Fast arbitrary splitting of deforming objects. ACM SIGGRAPH/Eurogmphics Symposium on Computer Animation, 2006.
30. A. Sud, N. K. Govindaraju, R. Gayle, I. Kabul, and D. Manocha. Fast proximity computationa among deformable models using discrete voronoi diagrams. Proc. of ACM SIGGRAPH, 2006.
31. M. Teschner, B. Heidelberger, M. Müeller, D. Pomeranets, and M. Gross. Optimized spatial hashing for collision detection of deformable objects. Proc. of Vision, Modeling and Visualization, 2003.
32. M. Teschner, S. Kimmerle, B. Heidelberger, G. Zachmann, L. Raghupathi, A. Furhmann, M.-P. Cani, F. Faure. N. Magnenat-Thalinann, W. Strasser, and P. Volino. Collision detection for deformable objects. Computer Graphics Forum, 24(1), 2005.
33. P. Volino and N. Magnenat Thalinann. Collision and self-collision detection: Efficient and robust solutions for highly deformable surfaces. In D. Terzopoulos and D. Thalmann, editors, Computer Animation and Simulation '95, pages 55-65. Eurographics, Springer-Verlag, Sept. 1995. ISBN 3-211-82738-2.
34. R. Weiler, J. Klein, and G. Zachmann. A model for the expeceted running time of collision detection using aabb trees. Eurographics Symposium on Virtual Environments, 2006.
35. G. Zachmann and R. Weiler. Kinetic bounding volume hierarchies for deforming objects. ACM lnt 'I Conf. on Virtual Reality Continuum and its Applications, 2006.