This is an implementation of geodesic (shortest path) algorithm for triangular meshes, written by Danil Kirsanov. The C++ code is hosted on Google Code and the Matlab interface is from Matlab File Exchange.
The code and compiled Windows dynamic-link libraries are originally released on 2008, which are quite old and do not work on modern PCs. The maintainer of this repository modified the code to make it easy to use, following Fritz and Dean Mark's comments.
For algorithm details, please refer to readme.
- Build the shared library (
.dll
or.so
)
mkdir build
cd build
cmake ..
cmake --build . --config Release
-
Add
./src
and the folder containinggeodesic_(debug|release).dll
to the MATLAB path. -
Run
example[1-5]
in Matlab. -
[Optional] Run
./example0.out
(Linux) or./Release/example0.exe
(Windows) with argumentshedgehog_mesh.txt 3 14
.
See Issues.
- libigl/libigl: a wrapper for the same exact geodesic algorithm implementation, exposing it through an Eigen-based API.
- mojocorp/geodesic: the same implementation with cross-platform CMakeLists and Python binding.