A global algorithm to compute defect-tolerant geodesic distance

SIGGRAPH Asia 2012 Technical Briefs, SA 2012

Volumn , Issue , 2012, Pages

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

^a NINGBO UNIVERSITY   (China)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Defect tolerant geodesic distance; Discrete geodesic

Indexed keywords

DIGITAL GEOMETRY PROCESSING; DISCRETE GEODESIC; GEODESIC DISTANCES; GLOBAL ALGORITHMS; TOPOLOGICAL CHANGES;

ALGORITHMS; DEFECTS; INTERACTIVE COMPUTER GRAPHICS; ITERATIVE METHODS;

GEODESY;

EID: 84871801916     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2407746.2407769     Document Type: Conference Paper

References (9)

1. CAMPEN, M., AND KOBBELT, L. 2011. Walking on broken mesh: Defect-tolerant geodesic distances and parameterizations. Comput. Graph. Forum 30, 2, 623-632.
2. CHEN, J., AND HAN, Y. 1990. Shortest paths on a polyhedron. In Proceedings of the sixth annual symposium on Computational geometry, SCG '90, 360-369.
3. COIFMAN, R. R., AND LAFON, S. 2006. Diffusion maps. Computational Harmonic Analysis 21, 1, 5-30.
4. KIMMEL, R., AND SETHIAN, J. A. 1998. Computing geodesic paths on manifolds. In Proc. Natl. Acad. Sci., 8431-8435.
5. LIPMAN, Y., RUSTAMOV, R., AND FUNKHOUSER, T. 2010. Biharmonic distance. ACM Transactions on Graphics 29, 3.
6. MITCHELL, J. S. B., MOUNT, D. M., AND PAPADIMITRIOU, C. H. 1987. The discrete geodesic problem. SIAM J. Comput. 16, 4, 647-668.
7. QUYNH, D., HE, Y., XIN, S.-Q., AND CHEN, Z. 2012. An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes. Graphical Models 74, 4, 209-220.
8. SURAZHSKY, V., SURAZHSKY, T., KIRSANOV, D., GORTLER, S. J., AND HOPPE, H. 2005. Fast exact and approximate geodesics on meshes. ACM Trans. Graph. 24, 3, 553-560.
9. XIN, S.-Q., AND WANG, G.-J. 2009. Improving Chen and Han's algorithm on the discrete geodesic problem. ACM Trans. Graph. 28, 4.