Accurate Anisotropic Fast Marching for Diffusion-Based Geodesic Tractography
Figure 2
(a) Grid representation of the different sets
involved during the fast-marching algorithm. (b) Position of the optimal point
on a simplex such as to minimise the geodesic distance to . (c) Geometry of the 48 simplexes surrounding a voxel
(central grey dot). The little red dots represent the centres of the 26
neighbouring voxels.