Pascal Baillehache
2020-02-05
<p>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.</p>
https://doi.org/10.5281/zenodo.3766062
oai:zenodo.org:3766062
eng
Zenodo
https://doi.org/10.5281/zenodo.3702528
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
intersection
detection
collision
Fourier-Motzkin
FMB
SAT
The FMB algorithm
info:eu-repo/semantics/doctoralThesis