<p dir="ltr">Hi Mengda,</p>
<p dir="ltr">You might be interested in the following papers:</p>
<p dir="ltr">Implementation of weighted Dijkstra's shortest-path<br>
<a href="http://www.insight-journal.org/browse/publication/315">http://www.insight-journal.org/browse/publication/315</a></p>
<p dir="ltr">Fast Marching Minimal Path Extraction in ITK<br>
<a href="http://www.insight-journal.org/browse/publication/213">http://www.insight-journal.org/browse/publication/213</a></p>
<p dir="ltr">HTH</p>
<p dir="ltr">Cheers, Dan</p>
<div class="gmail_quote">On 18 Dec 2013 14:45, "Mengda Wu" <<a href="mailto:wumengda@gmail.com">wumengda@gmail.com</a>> wrote:<br type="attribution"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div dir="ltr"><div><div><div>Hi all,<br><br></div>   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.<br>

<br></div>Thanks,<br></div>Mengda<br></div>
<br>_____________________________________<br>
Powered by <a href="http://www.kitware.com" target="_blank">www.kitware.com</a><br>
<br>
Visit other Kitware open-source projects at<br>
<a href="http://www.kitware.com/opensource/opensource.html" target="_blank">http://www.kitware.com/opensource/opensource.html</a><br>
<br>
Kitware offers ITK Training Courses, for more information visit:<br>
<a href="http://www.kitware.com/products/protraining.php" target="_blank">http://www.kitware.com/products/protraining.php</a><br>
<br>
Please keep messages on-topic and check the ITK FAQ at:<br>
<a href="http://www.itk.org/Wiki/ITK_FAQ" target="_blank">http://www.itk.org/Wiki/ITK_FAQ</a><br>
<br>
Follow this link to subscribe/unsubscribe:<br>
<a href="http://www.itk.org/mailman/listinfo/insight-users" target="_blank">http://www.itk.org/mailman/listinfo/insight-users</a><br>
<br></blockquote></div>