Exact geodesic for triangular meshes
Geodesic (shortest path) algorithm for triangular mesh (triangulated 2D surface in 3D).
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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 (2026). Exact geodesic for triangular meshes (https://se.mathworks.com/matlabcentral/fileexchange/18168-exact-geodesic-for-triangular-meshes), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (301 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 | - fixed libpointer conflict with matlab 2007b
|
