Issue No. 06 - June (2009 vol. 31)
Mukund Balasubramanian , Boston University, Boston
Jonathan R. Polimeni , Harvard Medical School, Charlestown
Eric L. Schwartz , Boston University, Boston
We present two algorithms for computing distances along convex and non-convex polyhedral surfaces. The first algorithm computes exact minimal-geodesic distances and the second algorithm combines these distances to compute exact shortest-path distances along the surface. Both algorithms have been extended to compute the exact minimal-geodesic paths and shortest paths. These algorithms have been implemented and validated on surfaces for which the correct solutions are known, in order to verify the accuracy and to measure the run-time performance, which is cubic or less for each algorithm. The exact-distance computations carried out by these algorithms are feasible for large-scale surfaces containing tens of thousands of vertices, and are a necessary component of near-isometric surface flattening methods that accurately transform curved manifolds into flat representations.
Curve, surface, solid, and object representations, Differential geometry, Flat maps, Triangular meshes, Surface-based analysis, Computational geometry
J. R. Polimeni, E. L. Schwartz and M. Balasubramanian, "Exact Geodesics and Shortest Paths on Polyhedral Surfaces," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 31, no. , pp. 1006-1016, 2008.