LIE ANALYSIS SYMBOL
FastMarching (Windows only)
FastMarching[cost, seeds, tips]
computes the shortest path between seeds and tips with a matric based on the cost
DetailsDetails
- Tracking can be in the 2, 2, SE(2) and SE(3) manifold
- Valid tracking models are:
-
ModelName Manifold Riemann2 R2 Tensor Riemann3 R3 ReedsShepp2 SE(2) ReedsSheppForward2 SE(2) Dubins2 SE(2) Elastica2<5> SE(2) Elastica2<9> SE(2) ReedsShepp3 SE(3) ReedsSheppForward3 SE(3) IsotropicBox2<Boundary::Closed> SE(3) IsotropicBox3<Boundary::Closed> SE(3) - Returns a ObjFastMarchingResult
- The binaries are only compiled for windows, therefore this is a windows only function
- All the coordinates are given in array indices, to show them in a graphics you first need to transform to coordinates
- The input can be an Image, ObjPositionOrientationData and Obj3DPositionOrientationData.
ExamplesExamplesopen allclose all
Basic Examples (4)Basic Examples (4)
Compute the shortest path from the south of Eindhoven to all other main exit roads.
In[1]:= |
In[2]:= |
In[3]:= |
Retinal vessel tracking in R2 and SE(2).
In[1]:= |
In[2]:= |
Compute the shortest path in a 3-dimensional volume.
To also consider the orientation domain you can use Obj3DPositionOrientationData (which is computed from a 3-dimensional volume using OrientationScoreTransform3D)
In[2]:= |