[vtkusers] Single source shortest path class published

[Miller, James V (CRD)]

This is really nice.  

Of course, I have a request.  :)

It would be cool if there was a mode such the shortest path
was not constrained to walk from vertex to vertex along the 
polydata.  I would love to have an implementation that allowed
me to give two points on the surface of a polydata (not necessarily
vertices but points within a polygon) and have the path
walk long the surface crossing edges (but not necessarily
crossing an edge at a vertex).

I suppose you could start with the path that you calculate now
and then run a relaxation step that will move the points from
the vertex positions along the edges to further reduce the cost.



-----Original Message-----
From: Rasmus Reinhold Paulsen [mailto:rrp at imm.dtu.dk]
Sent: Thursday, April 04, 2002 9:57 AM
To: vtkusers at public.kitware.com
Subject: [vtkusers] Single source shortest path class published


Hi All,

I have developed a single source shortest path class based on Dijkstras
algorithm. It works with vtkPolyData meshes.

It needs testing before I will add it to the VTK repository so I have
placed it together with a test program on my homepage:

www.imm.dtu.dk/~rrp/VTK

Comments and suggestions are most welcome!

Regards,
Rasmus

---------------------------------------------------
Rasmus Paulsen, Industrial Ph.D. Student (Oticon)
Image Analysis and Computer Graphics
Informatics and Mathematical Modelling
Technical University of Denmark
Building 321, DK-2800 Kgs. Lyngby, Denmark
http://www.imm.dtu.dk/~rrp
---------------------------------------------------

_______________________________________________
This is the private VTK discussion list. 
Please keep messages on-topic. Check the FAQ at: <http://public.kitware.com/cgi-bin/vtkfaq>
Follow this link to subscribe/unsubscribe:
http://public.kitware.com/mailman/listinfo/vtkusers