[vtkusers] Single source shortest path class published

[John Biddiscombe]

Rasmus,

I haven't tested the code, but did flip through it casually. Would it
require a lot of work to alter the distance measure from physical {x,y,x}
Euclidian to some function of the scalar value at a point - ie a sphere as
in the example, but with different scalar values at each point rather than a
distortion of shape. I don't need this, but it would be interesting to play
with assigning random scalars to surfaces and making it traverse them in
scalar space. (I say function of scalar value as there may be a vector
quantity)

ttfn

JB

----- Original Message -----
From: "Rasmus Reinhold Paulsen" <rrp at imm.dtu.dk>
To: <vtkusers at public.kitware.com>
Sent: Thursday, April 04, 2002 3:57 PM
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