Exact geodesic for triangular meshes
by Danil Kirsanov
31 Dec 2007
(Updated 03 Mar 2008)
Geodesic (shortest path) algorithm for triangular mesh (triangulated 2D surface in 3D).
|
Watch this File
|
| File Information |
| Description |
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. |
| MATLAB release |
MATLAB 6.5 (R13)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Updates |
| 04 Jan 2008 |
minor changes in readme file |
| 03 Mar 2008 |
- fixed libpointer conflict with matlab 2007b
- fixed cellfun error with earlier versions of matlab |
|
Contact us at files@mathworks.com