## Publications -> Journal Papers

Solving the initial value problem of discrete geodesics

Authors: | P. Cheng, C. Miao, Y.-J. Liu, C. Tu, and Y. He | ||||

Title: | Solving the initial value problem of discrete geodesics | ||||

Abstract: | Computing geodesic paths and distances is a common operation in computer graphics and computer-aided geometric design. The existing discrete geodesic algorithms are mainly designed to solve the boundary value problem, i.e., to find the shortest path between two given points. In this paper, we focus on the initial value problem, i.e., finding a uniquely determined geodesic path from a given point in any direction. Since the shortest paths do not provide the unique solution on triangle meshes, we solve the initial value problem in an indirect manner: given a fixed point and an initial tangent direction on a triangle mesh M, we first compute a geodesic curve γ on a piecewise smooth surface M, which well approximates the input mesh M and can be constructed at little cost. Then, we solve a first-order ODE of the tangent vector using the fourth-order Runge–Kutta method, and parallel transport it along γ. When the geodesic curve reaches the boundary of the current patch, its tangent can be directly transported to the neighboring patch, thanks to the G1-continuity along the common boundary of two adjacent patches. Finally, once the geodesic curve γ is available, we project it onto the underlying mesh M, producing the discrete geodesic path γ, which is guaranteed to be unique on M. It is worth noting that our method is different from the conventional methods of directly solving the geodesic equation (i.e., a second-order ODE of the position) on piecewise smooth surfaces, which are difficult to implement due to the complicated representation of the geodesic equation involving Christoffel symbols. The proposed method, based on the first-order ODE of the tangent vector, is intuitive and easy for implementation. Our method is particularly useful for computing geodesic paths on low-resolution meshes which may have large and/or skinny triangles, since the conventional straightest geodesic paths are usually far from the ground truth. | ||||

Keywords: | Discrete geodesics; Initial value problem; Geodesic polar coordinates | ||||

Journal Name: | Computer-Aided Design, vol. 70 | ||||

Publisher: | Elsevier | ||||

Year: | 2016 | ||||

Accepted PDF File: | Solving_the_Initial_Value_Problem_of_Discrete_Geodesics_accepted.pdf | ||||

Permanent Link: | http://dx.doi.org/10.1016/j.cad.2015.07.012 | ||||

Reference: | P. Cheng, C. Miao, Y.-J. Liu, C. Tu, and Y. He, “Solving the initial value problem of discrete geodesics,” Computer-Aided Design, vol. 70, pp. 144–152, January 2016. | ||||

bibtex: | @article {LILY-j24, author = {Cheng, Peng and Miao, Chunyan and Liu, Yong-Jin and Tu, Changhe and He, Ying}, title = {Solving the initial value problem of discrete geodesics}, journal = {Computer-Aided Design}, year = {2016}, month = {January}, volume = {70}, number = {}, pages = {144-152}, publisher = {Elsevier}, } |