Parallel discrete geodesic algorithms
The computation of geodesic paths and distances on a 3D triangle mesh is an important and fundamental problem in computer graphics domain. Developing faster geodesic algorithms is the eternal pursuit of researchers. We focus on developing parallel exact and approximate discrete geodesic algorithms i...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis-Doctor of Philosophy |
| 語言: | English |
| 出版: |
Nanyang Technological University
2020
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/143580 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |