Euclidean Shortest Path Algorithm

Screenshot ESP DG Kernel sample

Screen shot of ESP programming example


Euclidean Shortest Path algorithm calculates the obstructed shortest path between two points in space or on the surface of object(s).

The algorithm was developed initially in an application for the simulation of muscle wrapping around human joints. It is also useful for tool path optimisation and other technical applications.

The algorithm can be used directly by calling an API implemented in a DLL from various environments and languages without using DG Kernel components.

The functionality can be evaluated using the ESP example (source code provided) of the standard DG Kernel installation.