There is a newer version of this record available.

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:12b17780b46bac5bf3b2f7d430c17c92
1.8 MB Download
104
69
views
downloads
All versions This version
Views 10420
Downloads 6911
Data volume 104.0 MB19.3 MB
Unique views 8517
Unique downloads 609

Share

Cite as