Constant-time all-pairs geodesic distance query on triangle meshes

• المؤلفون الرئيسيون: Xin, Shi-Qing, Ying, Xiang, He, Ying
• مؤلفون آخرون: School of Computer Engineering
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2013
• الموضوعات: DRNTU::Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/96690; http://hdl.handle.net/10220/12996
• المؤسسة: Nanyang Technological University

Computing discrete geodesics on polyhedral surfaces plays an important role in computer graphics. In contrast to the well-studied "single-source, all-destination" discrete geodesic problem, little progress has been reported to the all-pairs geodesic, i.e., computing the geodesic distance b...