An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes

Graphical Models

Volumn 74, Issue 4, 2012, Pages 209-220

  Quynh, Dao T P ^a   He, Ying ^a   Xin, Shi Qing ^a   Chen, Zhonggui ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b XIAMEN UNIVERSITY   (China)

Author keywords

Discrete geodesics; Geodesic distance field; Global optimization; Intrinsic algorithm; Triangle mesh

Indexed keywords

DEFORMING OBJECTS; DISCRETE GEODESIC; EXACT SOLUTION; FUNDAMENTAL CONCEPTS; GEODESIC DISTANCE FIELD; GEODESIC DISTANCES; GEOMETRIC MODELING; HIGH DIMENSIONAL SPACES; HIGHLY SENSITIVE; HOLE FILLING; POLYGONAL MESHES; SYNTHETIC MODELS; TOPOLOGICAL CHANGES; TRIANGLE MESH;

GEODESY; GEOMETRY; GLOBAL OPTIMIZATION; TOPOLOGY;

ALGORITHMS;

ALGORITHM; GEODESY; MESH SIZE; NUMERICAL MODEL; OPTIMIZATION; TOPOLOGY;

EID: 84862019229     PISSN: 15240703     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.gmod.2012.04.009     Document Type: Conference Paper

References (22)

1. J.S.B. Mitchell, D.M. Mount, and C.H. Papadimitriou The discrete geodesic problem SIAM J. Comput. 16 4 1987 647 668
2. J. Chen, Y. Han, Shortest paths on a polyhedron, in: Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990, pp. 360-369.
3. S.-Q. Xin, and G.-J. Wang Improving Chen and Han's algorithm on the discrete geodesic problem ACM Trans. Graph. 28 4 2009 1 8
4. M. Campen, and L. Kobbelt Walking on broken mesh: defect-tolerant geodesic distances and parameterizations Comput. Graph. Forum 30 2 2011 623 632
5. J.S.B. Mitchell, M. Sharir, New results on shortest paths in three dimensions, in: Proceedings of the Twentieth Annual Symposium on Computational Geometry, 2004, pp. 124-133.
6. M. Sharir, and A. Schorr On shortest paths in polyhedral spaces SIAM J. Comput. 15 1 1986 193 215
7. V. Surazhsky, T. Surazhsky, D. Kirsanov, S.J. Gortler, and H. Hoppe Fast exact and approximate geodesics on meshes ACM Trans. Graph. 24 3 2005 553 560
8. Y. Schreiber, M. Sharir, An optimal-time algorithm for shortest paths on a convex polytope in three dimensions, in: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, 2006, pp. 30-39.
9. M. Barbehenn A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices IEEE Trans. Comput. 47 2 1998 263
10. R. Kimmel, J.A. Sethian, Computing geodesic paths on manifolds, in: Proceedings of National Academy of Science, USA, 1998, pp. 8431-8435.
11. K. Polthier, M. Schmies, Geodesic flow on polyhedral surfaces, in: Proceedings of Eurographics-IEEE Symposium on Scientific Visualization '99, 1999, pp. 179-188.
12. A. Spira, R. Kimmel, Geodesic curvature flow on parametric surfaces, in: Curve and Surface Design, 2002, pp. 365-373.
13. O. Weber, Y.S. Devir, A.M. Bronstein, M.M. Bronstein, R. Kimmel, Parallel algorithms for approximation of distance maps on parametric surfaces, ACM Trans. Graph. 27 (4).
14. Y.-J. Liu, Z. Chen, and K. Tang Construction of iso-contours, bisectors, and voronoi diagrams on triangulated surfaces IEEE Trans. Pattern Anal. Mach. Intell. 33 8 2011 1502 1517
15. C. Wu, and X. Tai A level set formulation of geodesic curvature flow on simplicial surfaces IEEE Trans. Visual. Comput. Graph. 16 2010 647 662
16. S.-Q. Xin, Y. He, and C.-W. Fu Efficiently computing exact geodesic loops within finite steps IEEE Trans. Visual. Comput. Graph. 18 6 2012 879 889
17. S.-Q. Xin, X. Ying, and Y. He Efficiently computing geodesic offsets on triangle meshes by the extended Xin-Wang algorithm Comput. Aided Des. 43 11 2011 1468 1476
18. A.F. Cook IV, C. Wenk, Shortest path problems on a polyhedral surface, in: WADS '09, 2009, pp. 156-167.
19. S.-Q. Xin, X. Ying, Y. He, Constant-time all-pairs geodesic distance query on triangle meshes, in: Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, 2012, pp. 31-38.
20. K. Polthier, M. Schmies, Mathematical Visualization, Straightest Geodesics on Polyhedral Surfaces, 1998, p. 391.
21. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
22. D.C. Liu, and J. Nocedal On the limited memory BFGS method for large scale optimization Mathematical Programming: Series A and B 45 3 1989 503 528