[vtk-developers] Geodesics on polygonal surfaces

[Claudio Silva]

Check out:

Fast exact and approximate geodesics on meshes.
V. Surazhsky, T. Surazhsky, D. Kirsanov, S. Gortler, H. Hoppe.
ACM SIGGRAPH 2005, 553-560.



On Feb 6, 2007, at 4:00 PM, Karthik Krishnan wrote:

> Hi,
>
> I'm writing a widget that can draw on polygonal datasets. So an  
> need an algorithm that can trace geodesics on surfaces. I dug up an  
> old thread :
>   http://public.kitware.com/pipermail/vtkusers/2005-June/080306.html
>
> I played around with Rasmus Paulsen's code that computes the  
> Dijkstra's shortest path between two vertices (Graph geodesics).  
> [ http://www2.imm.dtu.dk/~rrp/VTK/], hoping to get the shortest  
> path using Dijkistra and then try to smooth the resulting zig- 
> zagged curve.
>
> It sort of works if the mesh is very dense. Often, it gives non- 
> intuitive results.
>
> Attached is an example:
>
> - The input polydata is http://public.kitware.com/pub/itk/UsersITK/ 
> vtkDijkstra/ellipsoid.png
> - The result is : http://public.kitware.com/pub/itk/UsersITK/ 
> vtkDijkstra/DijkstraGeodesic1.png
>
> The curve ends up hugging the latitudes of the ellipsoid for a  
> while to get to its final destination, instead of zigzagging its  
> way through the latitudes and longitudes.
>
> Any thoughts. Anybody else using geodesics for similar purposes ?
>
> Thanks
>
> -- 
> Karthik Krishnan
> R&D Engineer,
> Kitware Inc.
> _______________________________________________
> vtk-developers mailing list
> vtk-developers at vtk.org
> http://www.vtk.org/mailman/listinfo/vtk-developers

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://public.kitware.com/pipermail/vtk-developers/attachments/20070206/dd751bff/attachment.html>