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:
Main Author: | Du, Jie |
---|---|
Other Authors: | He Ying |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143580 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Parallelizing discrete geodesic algorithms with perfect efficiency
by: Ying, Xiang, et al.
Published: (2021) -
Efficient and practical algorithms for discrete geodesics
by: Xiang, Ying
Published: (2013) -
Discrete geodesic graphs
by: Fang, Zheng
Published: (2019) -
Fast construction of discrete geodesic graph as generalized discrete geodesic approximation algorithms
by: Adikusuma, Yohanes Yudhi, et al.
Published: (2017) -
Parallel computation of discrete geodesics and its applications
by: Le, Tien Hung
Published: (2017)