The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computational complexity versus virtual worlds
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Curved surfaces and coherence for non-penetrating rigid body simulation
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Graphics gems II
Solving the Collision Detection Problem
IEEE Computer Graphics and Applications
Graphics gems IV
Efficient virtual collision detection for multiple users in large virtual spaces
VRST '94 Proceedings of the conference on Virtual reality software and technology
Interference detection among solids and surfaces
Communications of the ACM
Collision Detection and Response for Computer Animation
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Realistic animation of rigid bodies
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Graphics Gems III
The Psychology of Human-Computer Interaction
The Psychology of Human-Computer Interaction
Localized set operations for solid modeling
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
Consolidated manipulation of virtual and real objects
VRST '97 Proceedings of the ACM symposium on Virtual reality software and technology
Collision detection in aspect and scale bounded polyhedra
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a bounding box heuristic for object intersection
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a bounding box heuristic for object intersection
Journal of the ACM (JACM)
Hardware-assisted self-collision for deformable surfaces
VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Image-Based Collision Detection for Deformable Cloth Models
IEEE Transactions on Visualization and Computer Graphics
Proceedings of the ACM symposium on Virtual reality software and technology
Presence: Teleoperators and Virtual Environments
Efficient Point-Based Rendering Techniques for Haptic Display of Virtual Objects
Presence: Teleoperators and Virtual Environments
Research problems in clothing simulation
Computer-Aided Design
A dynamic bounding volume hierarchy for generalized collision detection
Computers and Graphics
Robust continuous collision detection for deformable objects
Proceedings of the 17th ACM Symposium on Virtual Reality Software and Technology
Collision detection algorithm in virtual environment of robot workcell
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
| Hi-index | 0.01 |
INSPEC Accession Number: 4917989 Abstract: We propose an accurate collision detection algorithm for use in virtual reality applications. The algorithm works for three-dimensional graphical environments where multiple objects, represented as polyhedra (boundary representation), are undergoing arbitrary motion (translation and rotation). The algorithm can be used directly for both convex and concave objects and objects can be deformed (non-rigid) during motion. The algorithm works efficiently by first reducing the number of face pairs that need to be checked accurately for interference by first localizing possible collision regions using bounding box and spatial subdivision techniques; face pairs that remain after this pruning stage are then accurately checked for interference. The algorithm is efficient, simple to implement, and does not require any memory intensive auxiliary data structures to be precomputed and updated. Since polyhedral shape representation is one of the most common shape representation schemes, this algorithm should be useful to a wide audience. Performance results are given to show the efficiency of the proposed method.