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.

Files (1.8 MB)
Name Size
fmb.pdf
md5:34d97c0865ea05bde0cf10349f77813f
1.8 MB Download
96
64
views
downloads
All versions This version
Views 966
Downloads 6411
Data volume 96.4 MB19.3 MB
Unique views 776
Unique downloads 5510

Share

Cite as