[25] J. S. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. *SICOMP*, 16(4):647–668, 1987.
[26] L. Morreale, N. Aigerman, P. Guerrero, V. G. Kim, and N. J. Mitra. Neural convolutional surfaces. In Proc. CVPR, pages 19333-19342, 2022.
[27] L. Morreale, N. Aigerman, V. G. Kim, and N. J. Mitra. Neural surface maps. In Proc. CVPR, pages 4639-4648, 2021.
[28] T. Ngo and K. Nguyen. Geodesic-former: A geodesic-guided few-shot 3d point cloud instance segmenter. In Proc. ECCV, pages 561-578, 2022.
[29] J. J. Park, P. Florence, J. Straub, R. Newcombe, and S. Lovegrove. Deepsdf: Learning continuous signed distance functions for shape representation. In Proc. CVPR, pages 165-174, 2019.
[30] S. Peng, M. Niemeyer, L. Mescheder, M. Pollefeys, and A. Geiger. Convolutional occupancy networks. In Proc. ECCV, pages 523-540, 2020.
[31] R. A. Potamias, A. Neofytou, K. M. Bintsi, and S. Zafeiriou. Graphwalks: Efficient shape agnostic geodesic shortest path estimation. In Proc. CVPRW, pages 2968-2977, 2022.
[32] Y. Qin, X. Han, H. Yu, Y. Yu, and J. Zhang. Fast and exact discrete geodesic computation based on triangle-oriented wavefront propagation. TOG, 35(4), 2016.
[33] N. Sharp and K. Crane. You can find geodesic paths in triangle meshes by just flipping edges. TOG, 39(6), 2020.
[34] V. Sitzmann, J. Martel, A. Bergman, D. Lindell, and G. Wetzstein. Implicit neural representations with periodic activation functions. Proc. NeurIPS, 33:7462-7473, 2020.
[35] T. Takikawa, J. Litalien, K. Yin, K. Kreis, C. Loop, D. Nowrouzezahrai, A. Jacobson, M. McGuire, and S. Fidler. Neural geometric level of detail: Real-time rendering with implicit 3d shapes. In Proc. CVPR, pages 11358-11367, 2021.
[36] J. Tao, J. Zhang, B. Deng, Z. Fang, Y. Peng, and Y. He. Parallel and scalable heat methods for geodesic distance computation. TPAMI, 43(2):579-594, 2021.
[37] O. Weber, Y. S. Devir, A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Parallel algorithms for approximation of distance maps on parametric surfaces. TOG, 27(4):104:1-104:16, 2008.
[38] S.-Q. Xin, Y. He, and C.-W. Fu. Efficiently computing exact geodesic loops within finite steps. TVCG, 18(6):879-889, 2012.
[39] S.-Q. Xin and G.-J. Wang. Improving Chen and Han's algorithm on the discrete geodesic problem. TOG, 28(4):104, 2009.
[40] S.-Q. Xin, X. Ying, and Y. He. Constant-time all-pairs geodesic distance query on triangle meshes. In I3D, pages 31-38, 2012.
[41] C.-X. Xu, T. Y. Wang, Y.-J. Liu, L. Liu, and Y. He. Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes. TVCG, 21(7):822-834, 2015.
[42] Q. Xu, W. Wang, D. Ceylan, R. Mech, and U. Neumann. Disn: Deep implicit surface network for high-quality single-view 3d reconstruction. Proc. NeurIPS, 32, 2019.
[43] Y. Yang, C. Feng, Y. Shen, and D. Tian. Foldingnet: Point cloud auto-encoder via deep grid deformation. In Proc. CVPR, pages 206–215, 2018.
[44] L. Yatziv, A. Bartesaghi, and G. Sapiro.  $O(N)$  implementation of the fast marching algorithm. JCP, 212(2):393-399, 2006.
[45] W. Yifan, L. Rahmann, and O. Sorkine-Hornung. Geometry-consistent neural shape representation with implicit displacement fields. arXiv preprint arXiv:2106.05187, 2021.
[46] X. Ying, X. Wang, and Y. He. Saddle vertex graph (SVG): A novel solution to the discrete geodesic problem. TOG, 32(6):170:1-12, 2013.
[47] X. Ying, S.-Q. Xin, and Y. He. Parallel Chen-Han (PCH) algorithm for discrete geodesics. TOG, 33(1):9:1-9:11, 2014.
[48] W. E. Lorensen and H. E. Cline. Marching cubes: A high resolution 3d surface construction algorithm. ACM SIGGRAPH Computer Graphics, 21(4):163-169, 1987.
[49] B. Pang, Z. Zheng, G. Wang, and P.-S. Wang. Learning the geodesic embedding with graph neural networks. arXiv preprint arXiv:2309.05613, 2023.