Thesis Open Access
The FMB algorithm
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.
67
40
views
downloads
| All versions | This version | |
|---|---|---|
| Views | 67 | 4 |
| Downloads | 40 | 3 |
| Data volume | 59.2 MB | 5.3 MB |
| Unique views | 51 | 4 |
| Unique downloads | 35 | 3 |
Indexed in
- Publication date:
- February 5, 2020
- DOI:
-
- Keyword(s):
- intersection detection collision Fourier-Motzkin FMB SAT
- License (for files):
- Creative Commons Attribution 4.0 International