[vtkusers] compute a geodesic distance

[Lars Matthäus]

The problem of computing a geodesic on a discrete surface is an example
of discrete differential geometry. In this field a more than active
research is going on. For people interested in results and algorithms
rather than implementations in vtk I can recommend
http://www.zib.de/geom/ , a group of mathematicians at
Konrad-Zuse-Zentrum in Berlin / Technical University Berlin, Germany,
who work at the cutting edge of this field. They have their own
visualization for those problems called JavaView (www.javaview.de) which
is absolutely worth looking at.

Lars

Rasmus Reinhold Paulsen schrieb:
> After some digging on the internet I have to revise my statements. It                       
> seems that the development on geodesics are somewhat more evolved than I                    
> believed and that Fast Marching is not necessarely "The Solution (tm)".                     
>                                                                                             
> I also located a recent paper dealing with the subject:  
> 
> "Fast Exact and Approximate Geodesics on Meshes" V. Surazhsky, T.
> Surazhsky, D. Kirsanov, S. J. Gortler and H. Hoppe Proceedings of SIGGRAPH
> 2005
> 
> that can be downloaded here:
> 
> http://www.cs.harvard.edu/~sjg/papers.html
> 
> VTK implementation anyone?
> 
> Cheers,
> Rasmus