1. Fast Construction of Discrete Geodesic Graphs
2. Lecture Notes in Computer Science, Vol. 9220;Buluç Adyın
3. Oliver Burghard and Reinhard Klein . 2015 . Simple, robust, constant-time bounds on surface geodesic distances using point Landmarks . In Proceedings of 20th International Symposium on Vision, Modeling and Visualization ( Aachen, Germany) (VMV ’15). Eurographics Association, Goslar, 17–24. https://doi.org/10.2312/vmv. 20151253 10.2312/vmv.20151253 Oliver Burghard and Reinhard Klein. 2015. Simple, robust, constant-time bounds on surface geodesic distances using point Landmarks. In Proceedings of 20th International Symposium on Vision, Modeling and Visualization (Aachen, Germany) (VMV ’15). Eurographics Association, Goslar, 17–24. https://doi.org/10.2312/vmv.20151253
4. Elliot W. Cheney . 1982. Introduction to Approximation Theory ( 2 nd ed.). Chelsea Publishing Company , New York . Elliot W. Cheney. 1982. Introduction to Approximation Theory(2nd ed.). Chelsea Publishing Company, New York.
5. Keenan Crane Marco Livesu Enrico Puppo and Yipeng Qin. 2020. A survey of algorithms for geodesic paths and distances. arxiv:2007.10430 [cs.GR] Keenan Crane Marco Livesu Enrico Puppo and Yipeng Qin. 2020. A survey of algorithms for geodesic paths and distances. arxiv:2007.10430 [cs.GR]