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...
| 主要な著者: | , , , , , , |
|---|---|
| その他の著者: | |
| フォーマット: | Journal Article |
| 言語: | English |
| 出版事項: |
2019
|
| 主題: | |
| オンライン･アクセス: | https://hdl.handle.net/10356/85378 http://hdl.handle.net/10220/49218 |