Thesis Open Access
Pascal Baillehache
This thesis introduces the FMB algorithm and its C implementation, which can be used to perform intersection detection of pairs of static/dynamic cuboid/tetrahedron in 2D/3D by using the Fourier-Motzkin elimination method. Results show that the FMB algorithm can be in average up to 4.8 times faster than the SAT algorithm.
All versions | This version | |
---|---|---|
Views | 104 | 9 |
Downloads | 69 | 13 |
Data volume | 104.0 MB | 22.8 MB |
Unique views | 85 | 9 |
Unique downloads | 60 | 12 |