Lightweight preprocessing and fast query of geodesic distance via proximity graph
Computing geodesic distance on a mesh surface efficiently and accurately is a central task in numerous computer graphics applications. In order to deal with high-resolution mesh surfaces, a lightweight preprocessing is a proper choice to make a balance between query accuracy and speed. In the prepr...
Saved in:
Main Authors: | , , , , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2019
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/85378 http://hdl.handle.net/10220/49218 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |