Partitioning and handling massive models for interactive collision detection

Computer Graphics Forum

Volumn 18, Issue 3, 1999, Pages 319-330

  Wilson, A ^a   Larsen, E ^a   Manocha, D ^a   Lin, M C ^a  

^a University of North Carolina   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; COMPUTER SYSTEMS PROGRAMMING; COMPUTER WORKSTATIONS; DATA STRUCTURES; DATABASE SYSTEMS; PERSONAL COMPUTERS; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

INTERACTIVE COLLISION DETECTION; OVERLAP GRAPHS;

INTERACTIVE COMPUTER GRAPHICS;

EID: 0032691831     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00352     Document Type: Article

References (27)

1. Aliaga et al. A framework for real-time walkthroughs of massive models. Technical Report TR98-013, Department of Computer Science, University of North Carolina, 1998.
2. Lisa Sobierajski Avila and William Schroeder. Interactive visualization of aircraft and power generation engines. In Roni Yagel and Hans Hagen, editors, IEEE Visualization 97, pages 483-486. IEEE, November 1997.
3. G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, and A. Tal. Boxtree: A hierarchical representation of surfaces in 3d. In Proc. of Eurographics'96, 1996.
4. Richard Bukowski and Carlo H. Sequin. Interactive simulation of fire in virtual building environments. In SIGGRAPH 97 Conference Proceedings, pages 35-44, 1997.
5. S. Cameron. Approximation hierarchies and sbounds. In Proceedings. Symposium on Solid Modeling Foundations and CAD/CAM Applications, pages 129-137, Austin, TX, 1991.
6. Stephen Cameron. A comparison of two fast algorithms for computing the distance between convex polyhedra. IEEE Transactions on Robotics and Automation, 13(6):915-920, December 1996.
7. J. Cohen, M. Lin, D. Manocha, and M. Ponamgi. I-collide: An interactive and exact collision detection system for large-scale environments. In Proc. of ACM Interactive 3D Graphics Conference, pages 189-196, 1995.
8. Michael B. Cox and David Ellsworth. Application-controlled demand paging for Out-of-Core visualization. In Roni Yagel and Hans Hagen, editors, IEEE Visualization 97, pages 235-244. IEEE, November 1997.
9. T. Funkhouser, C. Sequin, and S. Teller. Management of large amounts of data in interactive building walkthroughs. In Computer Graphics (1992 Symposium on Interactive 3D Graphics), volume 25, pages 11-20, 1992.
10. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE J. Robotics and Automation, vol RA-4:193-203, 1988.
11. S. Gottschalk. Collision Queries using Oriented Bounding Boxes. PhD thesis, University of North Carolina. Department of Computer Science, 1999.
12. S. Gottschalk, M. Lin, and D. Manocha. Obbtree: A hierarchical structure for rapid interference detection. In Proc. of ACM Siggraph'96, pages 171-180, 1996.
13. B. Hendrickson and R. Leland. A multi-level algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Laboratory, 1993.
14. P. M. Hubbard. Interactive collision detection. In Proceedings of IEEE Symposium on Research Frontiers in Virtual Reality, October 1993.
15. D. Johnson and E. Cohen. A framework for efficient minimum distance computation. IEEE Conference on Robotics and Automation, pages 36783683, 1998.
16. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, pages 269-278, 1996.
17. J. Klosowski, M. Held, J.S.B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-dops. In Siggraph'96 Visual Proceedings, page 151, 1996.
18. S. Krishnan, M. Gopi, M. Lin, D. Manocha, and A. Pattekar. Rapid and accurate contact determination between spline models using shelltrees. In Proc. of Eurographics'98, 1998. To appear.
19. E. Larsen, S. Gottschalk, M. Lin, and D. Manocha. Swept sphere volumes for fast proximity queries. Technical Report TR99-018, Department of Computer Science, University of North Carolina, 1999.
20. M. Lin and S. Gottschalk. Collision detection between geometric models: A survey. In Proc. of IMA Conference on Mathematics of Surfaces, 1998.
21. M.C. Lin and John F. Canny. Efficient algorithms for incremental distance computation. In IEEE Conference on Robotics and Automation, pages 1008-1014, 1991.
22. Brian Mirtich. V-Clip: Fast and robust polyhedral collision detection. ACM Transactions on Graphics, 17(3):177-208, July 1998.
23. S. Quinlan. Efficient distance computation between non-convex objects. In Proceedings of International Conference on Robotics and Automation, pages 3324-3329, 1994.
24. J. Rohlf and J. Helman. Iris performer: A high performance multiprocessor toolkit for realtime 3d graphics. In Proc. of ACM Siggraph, pages 381-394, 1994.
25. R. Seidel. Linear programming and convex hulls made easy. In Proc. 6th Ann. ACM Conf. on Computational Geometry, pages 211-215, Berkeley, California, 1990.
26. S. Teller, C. Fowler, T. Funkhouser, and P. Hanrahan. Partitioning and ordering large radiosity computations. In Andrew Glassner, editor, Proceedings of SIGGRAPH '94, pages 443-450. ACM SIGGRAPH, 1994.
27. S. J. Teller. Visibility Computations in Densely Occluded Polyheral Environments. PhD thesis, CS Division, UC Berkeley, 1992.