Lightweight preprocessing and fast query of geodesic distance via proximity graph

• المؤلفون الرئيسيون: Xin, Shiqing, Wang, Wenping, He, Ying, Zhou, Yuanfeng, Chen, Shuangmin, Tu, Changhe, Shu, Zhenyu
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2019
• الموضوعات: Proximity Graph; Geodesic Distance; Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/85378; http://hdl.handle.net/10220/49218

Computing geodesic distance on a mesh surface efficiently and accurately is a central task in numerous computer graphics applications. In order to deal with high-resolution mesh surfaces, a lightweight preprocessing is a proper choice to make a balance between query accuracy and speed. In the prepr...