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.4 MB)
Name Size
fmb.pdf
md5:32e031ad045a827d192be5699610fc8e
1.4 MB Download
78
55
views
downloads
All versions This version
Views 7858
Downloads 5537
Data volume 82.5 MB51.0 MB
Unique views 6052
Unique downloads 4837

Share

Cite as