Collision Detection between a Complex Solid and a Particle Cloud assisted by Programmable GPU

In this work the problem of collision detection (CD) between a Complex Solid and a Particle cloud with au-tonomous movement is studied. In order to do this, some algorithms and data have been adapted to suit new extensions of the new generations of programmable graphics cards. These types of graphics cards allow more (cid:3)ex-ible programming in order to solve problems not-related to visualization process. We use a representation based on simplicial coverings as well as a structure named Tetra-Tree in order to represent and classify the simplices of complex objects. With this type of representation the operations carried out in CD are more robust and ef(cid:2)cient than those used in classic algorithms, so it is not necessary to decompose the complex object into more simple pieces. We also propose some implementation alternatives and give a study of their performance. Categories and Subject Descriptors (according to ACM CCS) : I.3.5 Graphics]: Geometric algorithms, languages and systems; Curve, surface, solid, and object representations. I.3.6 Graphics]: Methodol-ogy and Techniques; Graphics data structures and data types.