CGAL 6.1 - Triangulated Surface Mesh Shortest Paths

Loading...
Searching...
No Matches
Bibliography

[1]

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

[2]

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

[3]

  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.