comp.lang.idl-pvwave archive: archive » Fast Marching Algorithm

Home » Public Forums » archive » Fast Marching Algorithm

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Fast Marching Algorithm [message #70932]

Fri, 21 May 2010 09:20

James[2]
Messages: 44
Registered: November 2009

Member

Has anyone implemented (or attempted to implement) Sethian's Fast
Marching Method in IDL? I'd like to use it to compute wave front
propagation in a scalar field. Here's a description:
http://math.berkeley.edu/~sethian/2006/Explanations/fast_mar ching_explain.html

The algorithm generally uses a binary heap to keep track of the narrow
band of neighbor *xels for the current wave front boundary. It also
loops around the list of current boundary *xels. With all that
looping and linked data structures, it seems like IDL might not run it
so quickly.

Matlab has this, and it seems like a pretty widely used algorithm.
I'm surprised IDL doesn't have it built in. If there's no preexisting
IDL implementation, I'll write a C program and post it here for anyone
who's interested.

(*xels = {pixels, voxels})

Report message to a moderator

[Message index]

Fast Marching Algorithm

By: James[2] on Fri, 21 May 2010 09:20

Previous Topic:	laplacian Kernal
Next Topic:	how to retain header info even after writefits

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 10 14:27:15 PDT 2025

Total time taken to generate the page: 0.80026 seconds