3740418
doi
10.5281/zenodo.3740418
oai:zenodo.org:3740418
The FMB algorithm
Pascal Baillehache
None
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
<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>
Zenodo
2020-02-05
info:eu-repo/semantics/doctoralThesis
3702528
1587796464.053789
1750192
md5:12b17780b46bac5bf3b2f7d430c17c92
https://zenodo.org/records/3740418/files/fmb.pdf
public
10.5281/zenodo.3702528
isVersionOf
doi