There is a newer version of this record available.

Thesis Open Access

The FMB algorithm

Pascal Baillehache


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.3702529", 
  "language": "eng", 
  "title": "The FMB algorithm", 
  "issued": {
    "date-parts": [
      [
        2020, 
        2, 
        5
      ]
    ]
  }, 
  "abstract": "<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>", 
  "author": [
    {
      "family": "Pascal Baillehache"
    }
  ], 
  "type": "thesis", 
  "id": "3702529"
}
95
63
views
downloads
All versions This version
Views 9569
Downloads 6342
Data volume 94.6 MB57.9 MB
Unique views 7663
Unique downloads 5441

Share

Cite as