[vtkusers] Questions on shortest path/digital curve

[John Washbourne]

"Chen, Elvis" wrote:
> 
> greetings,
> 
> I need to compute the shortest path (and the length of
> it) between 2 vertices on a mesh.  The shortest path
> can be the shortest-edge-path, or the
> shortest-geodesic-path (better).  The mesh I will be
> working on is fairly dense, so I suspect that the
> shortest-edge-path would provide good answer.
> 

Can you simply slice the mesh (with for example a vertical plane
containing the two points) and compute the length of the
resulting line segments? You would have to do some work on
truncating the two segments that contain your points and
discarding the "exterior" line segments.

John