Reducing the memory required to find a geodesic shortest path on a large mesh
Vishal Verma, Jack Scott Snoeyink · 2009
Finding shortest paths and distances on the surface of a mesh in R3 is a well studied problem, with most research aiming to minimize computation time. However for large meshes, such as TIN terrain models in GIS, the major bottleneck is often the memory required by an algorithm.