Where are code for the construction of geodesic coordinate system and geodesic distance computation?

[BoleynCN]

Thank you very much for your work, but I have a question. I don't find the code for the construction of geodesic coordinate system and geodesic distance computation in section 3.2 (the results in Fig. 7), do they included in there? If not, can you provided?

[vvvwo]

Sorry, we don't provide geodesic computation code in current version. Because we will discuss the code and implemetation in other paper. Some funtions would be improved. For now, you can use exe file or use fast marching to implement the method.

[BoleynCN]

Thanks for reply, I'm looking forward to your future papers. But I have a question for fast marching used in this paper. In section 3.2, the fast marching in reference [52] is utilized for geodesic distance computation, and the reference [52] "Computing geodesic paths on manifolds" is to extend the fast marching method to triangulated domains. But why the point cloud triangulation is not mentioned in the paper?

[vvvwo]

We implement fast marching on point clouds directly. You can use knn to detect local neighborhoods for each point and make some adjustments to transfer method [52] on point clouds. it contains some details that we will discuss in another paper. If you want to implement the geodesic coodinate urgently I have a suggestion. You can map the neighbors into the tangent space and use Delaunay triangulation to achieve the faces. Then, you can compute the geodesic by fast marching .