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: | , , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2021
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/152296 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!