Geometry/Mesh Processing

If we have one point A on the surface of a mesh, the geodesic distance to another point also on the surface of mesh B, is the length of the shortest path joining A to B, while still walking always over the surface of the mesh. Joining all the points which are at the same geodesic distance from a point creates the isolines of the following imagen: Although some techniques already exists, I'm going to present my own algorithm which returns the exact geodesic distance. In runs on top of the half edge mesh structure, which defines an array of 3D vertices, edges and faces (not necessarily triangles, but convex polygons). Rather than computing the distance from two arbitrary points A and B, we will solve the problem 'finding the shortest distance from vertex A to all other vertices in the mesh', and if we want to stop when we reach B we can stop calculations, as we don't know in advance which path we should follow to reach B from A. The algorithm starts from the initial verte...