-
Notifications
You must be signed in to change notification settings - Fork 329
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Anisotropic Fast Marching #43
Comments
You can find it for instance in our review paper, especially in Section 3.4 (it is described on a triangulation, but the same apply on a grid by considering 4 or 8 neighboring triangles around each point). |
Thank you so much! |
Apologies for reviving an old thread but I am also interested in digging a bit more into anisotropic fast marching for cartesian grids (images). I tried looking at the code and the review paper listed above but got a bit confused. Would it be possible to share a bit more insight? Section 3.4 of the review paper doesn't specifically talk about anisotropic fast marching. A quick bibliography search point to a few potential options, e.g.:
It would thus be helpful to better understand what is implemented in the fastmarching_3_anisotropy notebook. I also saw the perform_front_propagation_anisotropic.cpp file but this refers to files that are missing from the repository: |
I am a researcher who is doing research about tubular shape related segmentation and tracking and I applied multi-stencil fast marching in my previous project. I find one of your numerical tour is about anisotropic fast marching and I am currently studying your code. I am new to anisotropic fast marching. I have to say your code is amazing. Is that possible for you to post some related math behind anisotropic fast marching code(fm2dAniso.h)? Thank you so much for the amazing numerical tour anyway!
Kind regards,
donghao
The text was updated successfully, but these errors were encountered: