Exact geodesic for triangular meshes

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

Windows + MSVC

C++ executable

1. Build projects example0 and example1 in geodesic.sln.

MATLAB API functions

1. Build project geodesic in geodesic.sln.
2. Copy built library geodesic_(debug|release).dll to the folder matlab.
3. Run example[1-5] in Matlab.

Linux

C++ executable

cd src
make example0
./example0.out hedgehog_mesh.txt 3 14

MATLAB API functions

1. Build shared library

   cd src
   make debug
   cp ./geodesic_debug.so ../matlab/

2. Run example[1-5] in Matlab.

Known Issues

See Issues.

Author

Danil Kirsanov

Related Projects

All projects in this list use the same geodesic algorithm implementation.

• alecjacobson/gptoolbox: a matlab toolbox for geometry processing.
• libigl/libigl: a wrapper exposed through an Eigen-based API.
  • Python binding of libigl also includes this function.
• MeshUtility: Python binding, including an approximated method of edge-sourced geodesic distance field computation.