[vtkusers] Shortest route algorithms?
ELabuschagne at gims.com
Thu Sep 19 08:07:19 EDT 2002
Thanks for the reply, after posting the message, I Google'd around and found
your site. It looks like it can be quite useful, I'll just have to find out
two things: 1) how to use it for a grid (maybe just convert the grid to
polydata - I'm interested in the final cost, more than HAVING to keep it a
grid) and 2) how to compile your code so that I can use it from Python.
Will bug you some more if I really have a problem figuring something out ;)
From: Rasmus Reinhold Paulsen [mailto:rrp at imm.dtu.dk]
Sent: Thursday, September 19, 2002 11:55 AM
To: Etienne Labuschagne
Cc: Vtkusers (E-mail)
Subject: Re: [vtkusers] Shortest route algorithms?
On Thu, 19 Sep 2002, Etienne Labuschagne wrote:
> If I have a structured grid containing a cost for each cell, what's the
> way to determine the least cost route from one cell to another.
> I am thinking along the lines of using Dijkstra's algorithm but if there
> already something available that is implemented for VTK, I would of course
> be glad to use that!
I have implemented a Dijkstra shortest path algorithm for polydata. It is
therefore not directly usefull for your data, but perhaps you can use some
of it. I believe though that if you want state-of-the-art path finding,
level-sets and fast-marching methods are the way to go.
for the Dijkstra class.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the vtkusers