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: | Xin, Shiqing, Wang, Wenping, He, Ying, Zhou, Yuanfeng, Chen, Shuangmin, Tu, Changhe, Shu, Zhenyu |
---|---|
其他作者: | School of Computer Science and Engineering |
格式: | Article |
語言: | English |
出版: |
2019
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/85378 http://hdl.handle.net/10220/49218 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
由: Wang, Xiaoning, et al.
出版: (2018) -
Computing smooth quasi-geodesic distance field (QGDF) with quadratic programming
由: Cao, Luming, et al.
出版: (2021) -
Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes
由: Xu, Chunxu, et al.
出版: (2018) -
A learned generalized geodesic distance function-based approach for node feature augmentation on graphs
由: AZAD, Amitoz, et al.
出版: (2024) -
An optimization-driven approach for computing geodesic paths on triangle meshes
由: Liu, Bangquan, et al.
出版: (2018)