Published February 5, 2020
| Version v1.2
Thesis
Open
The FMB algorithm
Description
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
fmb.pdf
Files
(1.8 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:34d97c0865ea05bde0cf10349f77813f
|
1.8 MB | Preview Download |