Exact geodesic for triangular meshes

Geodesic (shortest path) algorithm for triangular mesh (triangulated 2D surface in 3D).
Updated 3 Mar 2008

View License

This is an implementation of exact geodesic algorithm for triangular mesh (first described by Mitchell, Mount and Papadimitriou in 1987) with some minor improvements, extensions and simplifications. The algorithm has O(n^2 \log n) worst-case time complexity, but in practice can work with million-node meshes in reasonable time. For the quick overview, see J. O'Rourke, "Computational Geometry Column 35", SIGACT News, 30(2) Issue #111.

Cite As

Danil Kirsanov (2024). Exact geodesic for triangular meshes (https://www.mathworks.com/matlabcentral/fileexchange/18168-exact-geodesic-for-triangular-meshes), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R13
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes

- fixed libpointer conflict with matlab 2007b
- fixed cellfun error with earlier versions of matlab