There is a newer version of this record available.

Thesis Open Access

The FMB algorithm

Pascal Baillehache


Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Pascal Baillehache</dc:creator>
  <dc:date>2020-02-05</dc:date>
  <dc:description>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.</dc:description>
  <dc:identifier>https://zenodo.org/record/3702529</dc:identifier>
  <dc:identifier>10.5281/zenodo.3702529</dc:identifier>
  <dc:identifier>oai:zenodo.org:3702529</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>doi:10.5281/zenodo.3702528</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:subject>intersection</dc:subject>
  <dc:subject>detection</dc:subject>
  <dc:subject>collision</dc:subject>
  <dc:subject>Fourier-Motzkin</dc:subject>
  <dc:subject>FMB</dc:subject>
  <dc:subject>SAT</dc:subject>
  <dc:title>The FMB algorithm</dc:title>
  <dc:type>info:eu-repo/semantics/doctoralThesis</dc:type>
  <dc:type>publication-thesis</dc:type>
</oai_dc:dc>
67
40
views
downloads
All versions This version
Views 6750
Downloads 4029
Data volume 59.2 MB39.9 MB
Unique views 5144
Unique downloads 3529

Share

Cite as