comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: Constructing an exact Euclidean distance map
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: Constructing an exact Euclidean distance map [message #83085 is a reply to message #83084] Mon, 04 February 2013 05:42 Go to previous message
David Fanning is currently offline  David Fanning
Messages: 11724
Registered: August 2001
Senior Member
Rob Klooster writes:

> I am looking for a way to get a (near) exact Euclidean distance map (EDM) of a binary image in a fast way. Using morph_distance is fast, but even the "approximate Euclidean distance" is not very close to the exact EDM. I have tried using the brute-force way of looping over all objects, looping over all pixels belonging to the edge of that object and calculating the distance of all pixels to that edge pixel, storing the value if it's smaller than the previous value. This
is obviously quite slow. Any ideas to speed things up?

You could try being less anal. (Difficult to put into practice, alas!)

What are you doing that requires an exact map?

Cheers,

David


--
David Fanning, Ph.D.
Fanning Software Consulting, Inc.
Coyote's Guide to IDL Programming: http://www.idlcoyote.com/
Sepore ma de ni thue. ("Perhaps thou speakest truth.")
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Big arrays, reducing data
Next Topic: Light Shed on GridData Mystery

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Thu Oct 09 19:42:07 PDT 2025

Total time taken to generate the page: 0.80351 seconds