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

[Dan Mueller]

Hi Mengda,

You might be interested in the following papers:

Implementation of weighted Dijkstra's shortest-path
http://www.insight-journal.org/browse/publication/315

Fast Marching Minimal Path Extraction in ITK
http://www.insight-journal.org/browse/publication/213

HTH

Cheers, Dan
On 18 Dec 2013 14:45, "Mengda Wu" <wumengda at gmail.com> 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.
>
> Thanks,
> Mengda
>
> _____________________________________
> 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
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.itk.org/pipermail/insight-users/attachments/20131220/6467d713/attachment.htm>