Thesis Open Access

The FMB algorithm

Pascal Baillehache

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 (1.8 MB)
Name Size
fmb.pdf
md5:34d97c0865ea05bde0cf10349f77813f 		1.8 MB Download
76
48
views
downloads
All versions This version
Views 764
Downloads 487
Data volume 72.1 MB12.3 MB
Unique views 584
Unique downloads 416
More info on how stats are collected.
Indexed in
Publication date:
February 5, 2020
DOI:
10.5281/zenodo.3766062

Zenodo DOI Badge

DOI 

10.5281/zenodo.3766062

Markdown 

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.3766062.svg)](https://doi.org/10.5281/zenodo.3766062)

reStructedText 

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.3766062.svg
   :target: https://doi.org/10.5281/zenodo.3766062

HTML 

<a href="https://doi.org/10.5281/zenodo.3766062"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.3766062.svg" alt="DOI"></a>

Image URL 

https://zenodo.org/badge/DOI/10.5281/zenodo.3766062.svg

Target URL 

https://doi.org/10.5281/zenodo.3766062

Keyword(s):
intersection detection collision Fourier-Motzkin FMB SAT
License (for files):
Creative Commons Attribution 4.0 International

Versions

Version v1.2 10.5281/zenodo.3766062 Feb 5, 2020
Version 2 10.5281/zenodo.3740418 Feb 5, 2020
Version 1 10.5281/zenodo.3702529 Feb 5, 2020
Cite all versions? You can cite all versions by using the DOI 10.5281/zenodo.3702528. This DOI represents all versions, and will always resolve to the latest one. Read more.

Share

Cite as

Export