Computing smooth quasi-geodesic distance field (QGDF) with quadratic programming

• المؤلفون الرئيسيون: Cao, Luming, Zhao, Junhao, Xu, Jian, Chen, Shuangmin, Liu, Guozhu, Xin, Shiqing, Zhou, Yuanfeng, He, Ying
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2021
• الموضوعات: Engineering::Computer science and engineering; Smooth Geodesic Distance Field; Quadratic Programming
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/152284
• المؤسسة: Nanyang Technological University

Computing geodesic distances on polyhedral surfaces is an important task in digital geometry processing. Speed and accuracy are two commonly-used measurements of evaluating a discrete geodesic algorithm. In applications, such as parametrization and shape analysis, a smooth distance field is often pr...