Object representation by means of nonminimal division quadtrees and octrees
ACM Transactions on Graphics (TOG)
Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Interval analysis for computer graphics
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Solving the Collision Detection Problem
IEEE Computer Graphics and Applications
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Quick elimination of non-interference polytopes in virtual environments
Proceedings of the Eurographics workshop on Virtual environments and scientific visualization '96
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Rapid Collision Detection by Dynamically Aligned DOP-Trees
VRAIS '98 Proceedings of the Virtual Reality Annual International Symposium
Collision Detection
Adaptive medial-axis approximation for sphere-tree construction
ACM Transactions on Graphics (TOG)
Tetra-trees properties in graphic interaction
Graphical Models
Modified UDP-Based semi-supervised learning for fruit internal quality detection
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
| Hi-index | 0.00 |
Collision detection (CD) between two objects is a complex task which demands spatial decomposition or bounding volume hierarchy in order to classify the features of the objects for a successful intersection test. Moreover, when the objects are complex and have concavities, holes, etc., the complexity of the decomposition increases and it is necessary to find a method which detects all special cases and degenerations. In this paper, we present a method for CD between complex polyhedra. We use a polyhedron representation based on simplicial coverings. With such as representation it is possible to model complex objects by using simpler objects (simplices), without any previous decomposition into convex pieces. The spatial decomposition so-called tetra-tree is utilized in order to classify the simplices of the covering, as well as a bounding volume hierarchy based on tetrahedra and spheres which allows us to drastically reduce the number of intersection tests between the features of both polyhedra. A time study has been performed to obtain a real time CD between two complex objects.