[Insight-users] Is there any Dijkstra algorithm in ITK?

[Kevin H. Hobbs]

On 12/17/2013 11:45 PM, Mengda Wu wrote:
> Hi all,
> 
>    I am wondering if there is any algorithm in ITK to compute the
> shortest path between two points in 3D image. Actually, the better one
> is to compute the shortest path from one point to a region of many points.

The FastMarchingImageFilter may do what you want.

You can think of it as a continuous version of Dijkstra's Algorithm for
graphs.


-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 255 bytes
Desc: OpenPGP digital signature
URL: <http://www.itk.org/pipermail/insight-users/attachments/20131218/4fd9c3ac/attachment.pgp>