Ruggeri, Mauro R.Darom, TalSaupe, DietmarKiryati, NahumMario Botsch and Baoquan Chen and Mark Pauly and Matthias Zwicker2014-01-292014-01-2920063-905673-32-01811-7813http://dx.doi.org/10.2312/SPBG/SPBG06/085-093We present a technique for computing piecewise linear approximations of geodesics on point set surfaces by minimizing an energy function defined for piecewise linear path. The function considers path length, closeness to the surface for the nodes of the piecewise linear path and for the intermediate line segments. Our method is robust with respect to noise and outliers. In order to avoid local minima, a good initial piecewise linear approximation of a geodesic is provided by Dijkstra s algorithm that is applied to a proximity graph constructed over the point set. As the proximity graph we use a sphere-of-influence weighted graph extended for surfel sets. The convergence of our method has been studied and compared to results of other methods by running experiments on surfaces whose geodesics can be computed analytically. Our method is presented and optimized for surfel-based representations but it has been implemented also for MLS surfaces. Moreover, it can also be applied to other surface representations, e.g., triangle meshes, radial-basis functions, etc.Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Line and Curve Generation; I.3.5 [Computer Graphics]: Curve, surface, solid, and object representations; I.3.5 [Computer Graphics]: Geometric algorithms, languages, and systems.