[Insight-users] "Geodesic" distance on a binary image?
Dan Mueller
dan.muel at gmail.com
Wed Feb 16 11:05:00 EST 2011
Hi David,
Indeed, if you are just after the manhattan geodesic distance,
Dijkstra is a good option.
FYI: There is a Dijkstra implementation here:
http://www.insight-journal.org/browse/publication/315
Cheers, Dan
On 16 February 2011 15:35, David Doria <daviddoria at gmail.com> wrote:
> On Tue, Feb 15, 2011 at 8:13 AM, Dan Mueller <dan.muel at gmail.com> wrote:
>>
>> Hi David,
>>
>> Does the following Insight Journal article help?
>> http://www.insight-journal.org/browse/publication/213
>>
>> Cheers, Dan
>
> Hi all,
> 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:
> https://github.com/daviddoria/DijkstraBinaryImage
> Thanks,
>
> David
More information about the Insight-users
mailing list