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 | 101 | 72 |
Downloads | 66 | 43 |
Data volume | 99.5 MB | 59.2 MB |
Unique views | 82 | 66 |
Unique downloads | 57 | 42 |