This algorithm computes the shortest path between two points within a polygon.
The triangulated polygon with start (red) and target (green) points. The triangles shaded darker form the so-called sleeve of the polygon.
An intermediate snapshot of the algorithm:
At the end, the shortest path has been found: