<meta http-equiv="content-type" content="text/html; charset=utf-8"><div><div class="gmail_quote">On Tue, Feb 15, 2011 at 8:13 AM, Dan Mueller <span dir="ltr"><<a href="mailto:dan.muel@gmail.com">dan.muel@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Hi David,<br>
<br>
Does the following Insight Journal article help?<br>
<a href="http://www.insight-journal.org/browse/publication/213" target="_blank">http://www.insight-journal.org/browse/publication/213</a><br>
<br>
Cheers, Dan</blockquote><div><br></div><div>Hi all,</div><div><br></div><div>The FastMarching filters were a bit overkill for my problem. I threw together a quick implementation of Dijkstra's shortest path algorithm and it does the job:</div>
<div><br></div><meta http-equiv="content-type" content="text/html; charset=utf-8"><a href="https://github.com/daviddoria/DijkstraBinaryImage">https://github.com/daviddoria/DijkstraBinaryImage</a><div><a href="https://github.com/daviddoria/DijkstraBinaryImage"></a><br clear="all">
Thanks,<br><br></div><div>David</div></div></div>