Thesis Open Access
Pascal Baillehache
{ "inLanguage": { "alternateName": "eng", "@type": "Language", "name": "English" }, "description": "<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>", "license": "https://creativecommons.org/licenses/by/4.0/legalcode", "creator": [ { "affiliation": "None", "@type": "Person", "name": "Pascal Baillehache" } ], "headline": "The FMB algorithm", "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", "datePublished": "2020-02-05", "url": "https://zenodo.org/record/3702529", "keywords": [ "intersection", "detection", "collision", "Fourier-Motzkin", "FMB", "SAT" ], "@context": "https://schema.org/", "identifier": "https://doi.org/10.5281/zenodo.3702529", "@id": "https://doi.org/10.5281/zenodo.3702529", "@type": "ScholarlyArticle", "name": "The FMB algorithm" }
All versions | This version | |
---|---|---|
Views | 104 | 75 |
Downloads | 69 | 45 |
Data volume | 104.0 MB | 62.0 MB |
Unique views | 85 | 69 |
Unique downloads | 60 | 44 |