Premium
Efficient self‐collision detection on smoothly discretized surface animations using geometrical shape regularity
Author(s) -
VOLINO Pascal,
THALMANN Nadia Magnenat
Publication year - 1994
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.1330155
Subject(s) - computer science , adjacency list , discretization , collision detection , surface (topology) , preprocessor , representation (politics) , computation , task (project management) , collision , algorithm , artificial intelligence , theoretical computer science , geometry , mathematics , mathematical analysis , computer security , management , politics , political science , law , economics
We present a new algorithm for detecting self‐collisionson highly discretized moving polygonal surfaces. If is based on geometrical shape regularity properties that permit avoiding many useless collision tests. We use an improved hierarchical representation of our surface that, besides the optimizations inherent to hierarchisation, allows us to fake adjacency information to our advantage for applying efficiently our geometrical optimizations. We reduce the computation time between each frame by building automatically the hierarchical structure once as a preprocessing task. We describe the main principles of our algorithm, followed by some performance tests.