Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs
暂无分享,去创建一个
Martin Held | James T. Klosowski | James T. Klosowski | Sarah Joseph | M. Held | J. Klosowski | S. Joseph
[1] Dinesh Manocha,et al. Incremental collision detection for polygonal models , 1995, SCG '95.
[2] Dinesh Manocha,et al. I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.
[3] Philip M. Hubbard. Real-Time Collision Detection and Time-Critical Computing , 1995 .
[4] Dinesh Manocha,et al. Incremental Algorithms for Collision Detection Between General Solid Models , 1994 .
[5] Dinesh Manocha,et al. Exact collision detection for interactive environments (extended abstract) , 1994, SCG '94.
[6] Joseph S. B. Mitchell,et al. Query-sensitive ray shooting , 1994, SCG '94.
[7] Alejandro M. García-Alonso,et al. Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.
[8] Subhash Suri,et al. A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.
[9] Michael T. Goodrich,et al. Dynamic ray shooting and shortest paths via balanced geodesic triangulations , 1993, SCG '93.
[10] Brown UniversityProvidence. Space-Time Bounds for Collision Detection , 1993 .
[11] Philip M. Hubbard,et al. Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.
[12] Micha Sharir,et al. Ray shooting amidst convex polytopes in three dimensions , 1993, SODA '93.
[13] K. Pankaj,et al. Line Stabbing Bounds in Three Dimensions , 1993 .
[14] Siu-Wing Cheng,et al. Algorithms for Ray-Shooting and Intersection Searching , 1992, J. Algorithms.
[15] David M. Mount. Intersection detection and separators for simple polygons , 1992, SCG '92.
[16] O. Schwarzkopf. Ray shooting in convex polytopes , 1992, SoCG 1992.
[17] Jirí Matousek,et al. Ray shooting and parametric search , 1992, STOC '92.
[18] Mark de Berg,et al. Efficient algorithms for ray shooting and hidden surface removal , 1992 .
[19] Nickolas S. Sapidis,et al. Delaunay triangulation of arbitrarily shaped planar domains , 1991, Comput. Aided Geom. Des..
[20] Nickolas S. Sapidis,et al. Domain Delaunay tetrahedrization of solid models , 1991, Int. J. Comput. Geom. Appl..
[21] Mark de Berg,et al. Efficient ray shooting and hidden surface removal , 2005, Algorithmica.
[22] John Amanatides,et al. Merging BSP trees yields polyhedral set operations , 1990, SIGGRAPH.
[23] Stephen Cameron,et al. Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..
[24] Marco Pellegrini,et al. Stabbing and ray shooting in 3 dimensional space , 1990, SCG '90.
[25] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[26] Jane Wilhelms,et al. Collision Detection and Response for Computer Animation , 1988, SIGGRAPH.
[27] Herbert Edelsbrunner,et al. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.
[28] Hiroshi Noborio,et al. Fast interference check method using octree representation , 1988, Adv. Robotics.
[29] John F. Canny,et al. Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.