Easy Realignment of k-DOP Bounding Volumes

Proceedings - Graphics Interface

Volumn , Issue , 2003, Pages 257-264

  Fünfzig, Christoph ^a   Fellner, Dieter W ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Collision detection; Distance computation; Virtual reality

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; HEURISTIC METHODS; MOTION ESTIMATION; PROBLEM SOLVING; VIRTUAL REALITY;

COLLISION DETECTION; DISTANCE COMPUTATION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 1942453325     PISSN: 07135424     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Crosnier and J.R. Rossignac. Tribox bounds for three-dimensional objects. Computers & Graphics, 23(3):429-437, 1999.
2. Olivier Devillers and Philippe Guigue. Faster triangle-triangle intersection tests. Rapport de recherche 4488, INRIA, 2002.
3. S. Ehmann and M.C. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. In Computer Graphics Forum (Proc. of Eurographics 2001), 2001.
4. M. Held. Erit - a collection of efficient and reliable intersection tests. Technical report, University at Stony Brook, 1996.
5. M. Held, J.T. Klosowski, and J.S.B. Mitchell. Evaluation of collision detection methods for virtual reality fly-throughs. In Proc. 7th Canadian Conference on Computational Geometry, pages 205-210. Canadian Conference on Computational Geometry, August 1995.
6. Philip M. Hubbard. Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics, 15(3):179-210, 1996.
7. J. T. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics, 4(1):21-36, /1998.
8. P. Konecny and K. Zikan. Lower bound of distance in 3d. Technical Report 1, Masaryk University, 1997.
9. E. Larsen, S. Gottschalk, M.C. Lin, and D. Manocha. Distance queries with rectangular swept sphere volumes. In Proc. of IEEE Int. Conference on Robotics and Automation, 2000.
10. M.C. Lin and S. Gottschalk. Collision detection between geometric models: A survey. In Proc. of IMA Conference on Mathematics of Surfaces, 1998.
11. M.C. Lin, S. Gottschalk, and D. Manocha. Obb-tree: A hierarchical structure for rapid interference detection. In Computer Graphics (SIGGRAPH Conference Proceedings), 1996.
12. J. Mezger, S. Kimmerle, and O. Etzmuß. Improved collision detection and response techniques for cloth animation. Technical Report 5, WSI/GRIS, Universität Tübingen, Aug 2002.
13. T.Möller. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2):25-30, 1997.
14. F.P. Preparata and M.I. Shamos. Computational Geometry - An Introduction. Springer Verlag, New York, 1985.
15. P. Terdiman. Opcode benchmark, 2002. http://www.codecorner.com/ OpcodeDemo.htm.
16. Gino van den Bergen. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics Tools: JGT, 2(4): 1-14, 1997.
17. G. Zachmann. Rapid collision detection by dynamically aligned dop-trees. In Proc. of IEEE Virtual Reality Annual International Symposium; VRAIS 98, 1998.
18. G. Zachmann. Optimizing the collision detection pipeline. In Proc. of The First International Game Technology Conference GTEC, Jan 2001.
19. Yunhong Zhou and Subhash Suri. Analysis of a bounding box heuristic for object intersection. Journal of the ACM (JACM), 46(6):833-857, 1999.