Real-time and exact collision detection for interactive virtual prototyping

Proceedings of the ASME Design Engineering Technical Conference

Volumn 5, Issue , 1997, Pages

  Zachmann, Gabriel ^a  

^a FRAUNHOFER IGD   (Germany)

Author keywords

Digital mock up; Hierarchical data structures.; Interference detection; Virtual reality

Indexed keywords

GEOMETRY; SEMANTICS; VIRTUAL PROTOTYPING;

AUXILIARY DATA STRUCTURES; COLLISION DETECTION; CONVEX POLYHEDRONS; DIGITAL MOCK-UP; DISTANCE COMPUTATION; PRE-COMPUTATION; SPACE SUBDIVISION; TRAVERSAL ALGORITHMS;

MOCKUPS;

EID: 24244443931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1115/DETC97/CIE-4306     Document Type: Conference Paper

References (25)

1. Astheimer, P,, Dai, F., Felger, W., Giibel, M., Haase, H., Mtiller, S., and Ziegler, R. (1995). Virtual Design II-an advanced VR system for industrial applications. In Proc. Virtual Reality World '95, pages 337-363.
2. Bouma, W. and Vanecek, Jr., G. (1991). Collision detection and analysis in a physical based simulation. In Eurographics Workshop on Animation and Simulation, pages 191-203.
3. Canny, J. (1986). Collision detection for moving polyhedra. IEEE Transactions an Pattern Analysis and Machine Intelligence, PAMI-8(2):200-209.
4. Clifford A. Shaffer, G. M. H. (1992). A real-time robot arm collision avoidance system. IEEE Transactions on Robotics and Automation, K-9.
5. Dai, F., Felger, W., Friihauf, T., Gobel, M., Reiners, D., and Zachmann, G. (1996). Virtual prototyping examples for automotive industries. In Proc. Virtual Reality World, Stuttgart.
6. Dai, F. and Reindl, P. (1986). Enabling digital mock-up with virtual reality techniques-vision, concept, demonstrator. In ASME Design for Manufacturing Conferences, Irvine, CA.
7. Dobkin, D. P. and Kirkpatrick, D. G. (1985). A linear algorithm for determining the separation of convex polyhedra..I. Algorithms, 6:381-392.
8. Erdmann, M. and Lozano-Perez, T. (1987). On multiple moving objects. Algorithmica, 2:477-521.
9. Garcia-Alonso, A., Serrano, N., and Flaquer, J. (1994). Solving the collision detection problem. IEEE Computer Graphics and Applications, pages 36-43.
10. Gilbert, E. G., Johnson, D. W., and Keerthi, S. S. (1988). A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Journal of Robotics and Automation, 4(2): 193-203.
11. Heckbert, P. S., editor (1994). Graphics Gems IV. Academic Press, Inc., Cambridge, MA.
12. Hubbard, P M. (1995). Real-time collision detection and timecritical computing. In SIVE 95, The First Worjshop on Simulation and Interaction in Virtual Environments, number 1, pages 92-96, Iowa City, Iowa. University of Iowa, informal proceedings.
13. Liang, Y.-D. and Barsky, B. A. (1984). A new concept and method for line clipping. ACM Trans. Graphics (USA), 3: l-22.
14. Lin, M. C. and Manocha, D. (1991(?)). EfJicient Contact Determination Between Geometric Models. PhD dissertation, University of California, University of North Carolina Chapel Hill, URL: ftp://ftp.cs.unc.edu/pub/techreports/94-024.ps.Z.
15. Magnenat-Thalmann, N. and Thalmann, D., editors (1994). Realism in Virtual Reality, pages 189-210. Wiley & Sons.
16. Mehlhorn, K. and Simon, K. (1985). Intersecting two polyhedra one of which is convex. In Budach, L., editor, Proc. Found. Comput. Theory, volume 199 of Lecture Notes in Computer Science, pages 534-542. Springer-Verlag.
17. Moore, M. and Wilhelms, J. (1988). Collision detection and response for computer animation. In Dill, J., editor, Computer Graphics (SIGGRAPH '88 Proceedings), volume 22, pages 289-298.
18. Muller, D. E. and Preparata, F. P. (1978). Finding the intersection of two convex polyhedra. Theoret. Comput. Sci., 7:217-236.
19. Navazo, I., Ayala, D., and Brunet, P. (1986). A geometric modeler based on the exact octree representation of polyhedra. Computer Graphics Forum, 5(2):91-104.
20. Naylor, B., Amanatides, J., and Thibault, W. (1990). Merging BSP trees yields polyhedral set operations. In Baskett, F., editor, Computer Graphics (SIGGRAPH '90 Proceedings), volume 24, pages 115-124.
21. Ponamgi, M. K., Cohen, J. D., Lin, M. C., and Manocha, D. (1995). Incremental algorithms for colision detection between polyhedral models. In SIVE 95, The First Worjshop on Simulation and Interaction in Virtual Environments, number 1, pages 84-9 1, Iowa City, Iowa. University of Iowa, informal proceedings.
22. Reichling, M. (1988). On the detection of a common intersection of k convex polyhedra. In Computational Geometry and its Applications, volume 333 of Lecture Notes in Computer Science, pages 180-186. Springer-Verlag.
23. Thibault, W. C. and Naylor, B. F. (1987). Set operations on polyhedra using binary space partitioning trees. In Stone, M. C., editor, Computer Graphics (SIGGRAPH '87 Proceedings), volume 21, pages 153-162.
24. Yu, Y., Wu, M., and Zhou, J. (1996). An octre algorithm for dynamic interference detection using space partitioning. In Proc. of The I996 ASMEDesing Engineering Technical Conference and Computers in Engineering Conference, pages 96-DECT/DAC-1046, Irvine, CA.
25. Zachmann, G. (1995). The BoxTree: Enabling real-time and exact collision detection of arbitrary polyhedra. In Informal Proc. First Workshop on Simulation and Interaction in Virtual Environments, SIVE 95, University of Iowa, Iowa City. The OX Association for Computing Machinery.