OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Optimizing triangle strips for fast rendering
Proceedings of the 7th conference on Visualization '96
Fast and simple 2D geometric proximity queries using graphics hardware
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Real-time Collision Detection for Virtual Surgery
CA '99 Proceedings of the Computer Animation
Symbolic and compositional reachability for timed automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Hybrid image-based collision detection in Java 3D
Software—Practice & Experience
| Hi-index | 0.00 |
This paper describes a collision detection method for polygonal deformable objects using OpenGL, which is suitable for surgery simulations. The method relies on the OpenGL selection mode which can be used to find out which objects or geometrical primitives (such as polygons) in the scene are drawn inside a specified region, called the viewing volume. We achieve a significant reduction in the detection time by using a data structure based on an AABB tree. The strength of our method is that it doesn't require the AABB hierarchy tree to be updated from bottom to top. We are using only a limited set of bounding volumes, which is much smaller than the object's number of polygons. This enables us to perform a fast update of our structure when objects deform. Therefore, our approach appears to be a reasonable choice for collision detection of deformable objects.