[ITK Community] [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://public.kitware.com/pipermail/community/attachments/20131218/4fd9c3ac/attachment.sig>
-------------- next part --------------
_____________________________________
Powered by www.kitware.com

Visit other Kitware open-source projects at
http://www.kitware.com/opensource/opensource.html

Kitware offers ITK Training Courses, for more information visit:
http://www.kitware.com/products/protraining.php

Please keep messages on-topic and check the ITK FAQ at:
http://www.itk.org/Wiki/ITK_FAQ

Follow this link to subscribe/unsubscribe:
http://www.itk.org/mailman/listinfo/insight-users