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

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...

全面介紹

Saved in:
書目詳細資料
Main Authors: Du, Jie, He, Ying, Fang, Zheng, Meng, Wenlong, Xin, Shi-Qing
其他作者: School of Computer Science and Engineering
格式: Article
語言:English
出版: 2021
主題:
在線閱讀:https://hdl.handle.net/10356/152296
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!