[1]

J. Chen and Y. Han. Shortest paths on a polyhedron. Internat. J. Comput. Geom. Appl., 6:127–144, 1996.

[2]

Mehdi Jazayeri, Rüdiger Loos, and David R. Musser, editors. Generic Programming, International Seminar on Generic Programming, Dagstuhl Castle, Germany, April 27 - May 1, 1998, Selected Papers, volume 1766 of Lecture Notes in Computer Science. Springer, 2000.

[3]

Joseph S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16:647–668, 1987.

[4]

Jan Vahrenhold, editor. Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, volume 5526 of Lecture Notes in Computer Science. Springer, 2009.

[5]

Shi-Qing Xin and Guo-Jin Wang. Improving chen and han's algorithm on the discrete geodesic problem. ACM Trans. Graph., 28(4):104:1–104:8, September 2009.