{"id":44355226,"url":"https://github.com/jvgomez/fast_methods","last_synced_at":"2026-02-11T16:05:18.756Z","repository":{"id":14201646,"uuid":"16908270","full_name":"jvgomez/fast_methods","owner":"jvgomez","description":"N-Dimensional Fast Methods: Fast Marching, Fast Sweeping, Group Marching, Fast Iterative, etc.","archived":false,"fork":false,"pushed_at":"2023-03-01T18:58:28.000Z","size":161431,"stargazers_count":180,"open_issues_count":2,"forks_count":63,"subscribers_count":16,"default_branch":"master","last_synced_at":"2026-01-14T08:56:56.413Z","etag":null,"topics":["algorithm","c-plus-plus","computer-vision","fast-marching","fast-methods","gridmap","path-planning"],"latest_commit_sha":null,"homepage":"http://jvgomez.github.io/fast_methods/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jvgomez.png","metadata":{"files":{"readme":"README.md","changelog":"changelog.md","contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2014-02-17T09:44:04.000Z","updated_at":"2025-12-22T08:52:54.000Z","dependencies_parsed_at":"2023-02-19T08:30:53.238Z","dependency_job_id":"367c5e88-4e66-4c7f-83f5-72ffb9e9c835","html_url":"https://github.com/jvgomez/fast_methods","commit_stats":null,"previous_names":["jvgomez/fastmarching"],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/jvgomez/fast_methods","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jvgomez%2Ffast_methods","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jvgomez%2Ffast_methods/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jvgomez%2Ffast_methods/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jvgomez%2Ffast_methods/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jvgomez","download_url":"https://codeload.github.com/jvgomez/fast_methods/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jvgomez%2Ffast_methods/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29337031,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-11T16:00:30.228Z","status":"ssl_error","status_checked_at":"2026-02-11T16:00:25.398Z","response_time":97,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","c-plus-plus","computer-vision","fast-marching","fast-methods","gridmap","path-planning"],"created_at":"2026-02-11T16:05:18.048Z","updated_at":"2026-02-11T16:05:18.750Z","avatar_url":"https://github.com/jvgomez.png","language":"C++","readme":"N-Dimensional Fast Methods Library v0.7\n\n**Authors:**\n - [Javier V. Gomez](http://jvgomez.github.io) javvgomez _at_ gmail.com\n - Jose Pardeiro jose.pardeiro _at_ gmail.com\n - Pablo Gely\n\n## ALGORITHMS\nAll the theory and algorithms implemented in this library can be found in my [PhD thesis](doc/files/phd_thesis.pdf). In fact, all the benchmarking data in chapter 4 has been produced with this library and it is stored on the `experiments` branch.\n\n\n**Fast Marching Methods:**\n- [FMM](http://jvgomez.github.io/fast_methods/classFMM.html): Fast Marching Method with Binary Queue and Fibonacci Queue (binary by default).\n- [FMM*](http://jvgomez.github.io/fast_methods/classFMMStar.html): FMM with CostToGo heuristics.\n- [SFMM](http://jvgomez.github.io/fast_methods/classSFMM.html): Simplified Fast Marhching Method.\n- [SFMM*](http://jvgomez.github.io/fast_methods/classSFMMStar.html): SFMM with CostToGo heuristics..\n\n**O(n) Fast Marching Methods:**\n- [GMM](http://jvgomez.github.io/fast_methods/classGMM.html): Group Marching Method.\n- [UFMM](http://jvgomez.github.io/fast_methods/classUFMM.html): Untidy Fast Marching Method.\n- [FIM](http://jvgomez.github.io/fast_methods/classFIM.html): Fast Iterative Method.\n\n**Fast Sweeping Methods:**\n- [FSM](http://jvgomez.github.io/fast_methods/classFSM.html): Fast Sweeping Method.\n- [LSM](http://jvgomez.github.io/fast_methods/classLSM.html): Lock Sweeping Method.\n- [DDQM](http://jvgomez.github.io/fast_methods/classDDQM.html): Dynamic Double Queue Method.\n\n**Fast Marching Square motion planning algorithms:**\n- [FM2](http://jvgomez.github.io/fast_methods/classFM2.html): Fast Marching Square Method.\n- [FM2*](http://jvgomez.github.io/fast_methods/classFM2Star.html): Fast Marching Square Star FM2 with CostToGo heuristics.\n\n**ROS**\n\nROS nodes using this code (tested in the TurtleBot) are provided in a [separate repo](https://github.com/jpardeiro/fastmarching_node)\n\n\n## DISCLAIMER and IMPORTANT NOTES\n\n- The code is not deeply tested. I've just tested it works for the cases I need. If you find any problem, have any question (or whatever), please write to: javvgomez _at_ gmail.com\n\n- The compilation time is highly increased due to CImg library. Please, omit it when possible as it is used only for visualization purposes.\n\n- License [GNU/GPL V3](http://www.gnu.org/copyleft/gpl.html)\n\n- This is a source code intended for my research. Although I want it to be useful for other people it is not intended to act as a library (there are many many points to improve). However, if you show interest or have feature request do not hesitate to contact me and I will try my best to improve the code for whoever needs it. I am also open to contributions and to create a formal library if necessary.\n\n\n## Documentation\n\n- [API Reference](http://jvgomez.github.io/fast_methods/)\n\n\n## Building the code\nCheck the [building section](http://jvgomez.github.io/fast_methods/md_markdown_building.html) of the documentation.\n\n\n## Design and folder structure\nCheck the [design section](http://jvgomez.github.io/fast_methods/md_markdown_design.html) of the documentation.\n\n\n## KNOWN ISSUES\n\n- Gradient Descent for FM2* could fail if very narrow passages are in the way of the path.\n- It seems that UFMM can fail in maps with random (or similar) velocity changes.","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjvgomez%2Ffast_methods","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjvgomez%2Ffast_methods","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjvgomez%2Ffast_methods/lists"}