There is a newer version of this record available.

Thesis Open Access

The FMB algorithm

Pascal Baillehache


JSON Export

{
  "files": [
    {
      "links": {
        "self": "https://zenodo.org/api/files/25047072-0c99-430e-9d50-1a3cf5786e4d/fmb.pdf"
      }, 
      "checksum": "md5:32e031ad045a827d192be5699610fc8e", 
      "bucket": "25047072-0c99-430e-9d50-1a3cf5786e4d", 
      "key": "fmb.pdf", 
      "type": "pdf", 
      "size": 1377384
    }
  ], 
  "owners": [
    94005
  ], 
  "doi": "10.5281/zenodo.3702529", 
  "stats": {
    "version_unique_downloads": 37.0, 
    "unique_views": 47.0, 
    "views": 53.0, 
    "version_views": 72.0, 
    "unique_downloads": 30.0, 
    "version_unique_views": 54.0, 
    "volume": 41321520.0, 
    "version_downloads": 43.0, 
    "downloads": 30.0, 
    "version_volume": 64087220.0
  }, 
  "links": {
    "doi": "https://doi.org/10.5281/zenodo.3702529", 
    "conceptdoi": "https://doi.org/10.5281/zenodo.3702528", 
    "bucket": "https://zenodo.org/api/files/25047072-0c99-430e-9d50-1a3cf5786e4d", 
    "conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.3702528.svg", 
    "html": "https://zenodo.org/record/3702529", 
    "latest_html": "https://zenodo.org/record/3766062", 
    "badge": "https://zenodo.org/badge/doi/10.5281/zenodo.3702529.svg", 
    "latest": "https://zenodo.org/api/records/3766062"
  }, 
  "conceptdoi": "10.5281/zenodo.3702528", 
  "created": "2020-03-10T12:56:58.006462+00:00", 
  "updated": "2020-04-25T06:34:23.478821+00:00", 
  "conceptrecid": "3702528", 
  "revision": 4, 
  "id": 3702529, 
  "metadata": {
    "access_right_category": "success", 
    "doi": "10.5281/zenodo.3702529", 
    "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>", 
    "language": "eng", 
    "title": "The FMB algorithm", 
    "license": {
      "id": "CC-BY-4.0"
    }, 
    "relations": {
      "version": [
        {
          "count": 3, 
          "index": 0, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "3702528"
          }, 
          "is_last": false, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "3766062"
          }
        }
      ]
    }, 
    "keywords": [
      "intersection", 
      "detection", 
      "collision", 
      "Fourier-Motzkin", 
      "FMB", 
      "SAT"
    ], 
    "publication_date": "2020-02-05", 
    "creators": [
      {
        "affiliation": "None", 
        "name": "Pascal Baillehache"
      }
    ], 
    "access_right": "open", 
    "resource_type": {
      "subtype": "thesis", 
      "type": "publication", 
      "title": "Thesis"
    }, 
    "related_identifiers": [
      {
        "scheme": "doi", 
        "identifier": "10.5281/zenodo.3702528", 
        "relation": "isVersionOf"
      }
    ]
  }
}
72
43
views
downloads
All versions This version
Views 7253
Downloads 4330
Data volume 64.1 MB41.3 MB
Unique views 5447
Unique downloads 3730

Share

Cite as