On the vertex-oriented triangle propagation (VTP) algorithm : parallelization and approximation

• المؤلفون الرئيسيون: Du, Jie, He, Ying, Fang, Zheng, Meng, Wenlong, Xin, Shi-Qing
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2021
• الموضوعات: Engineering::Computer science and engineering; Discrete Geodesics; Parallel Computing
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/152296
• المؤسسة: Nanyang Technological University

Computing geodesic distances on polyhedral surfaces is a fundamental problem in digital geometry processing and computer-aided design. Most of the existing exact algorithms partition mesh edges into intervals, called windows, and propagate one window at a time. The state-of-the-art, Vertex-oriented...