Parallelizing discrete geodesic algorithms with perfect efficiency
This paper presents a new method for parallelizing geodesic algorithms on triangle meshes. Using the half-edge data structure, we define the propagation dependency graph to characterize data dependency in computing geodesics. Then, we design an active strategy such that the vertices and half-edges o...
Saved in:
Main Authors: | Ying, Xiang, Huang, Caibao, Fu, Xuzhou, He, Ying, Yu, Ruiguo, Wang, Jianrong, Yu, Mei |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/151965 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes
by: Xu, Chunxu, et al.
Published: (2018) -
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
by: Wang, Xiaoning, et al.
Published: (2018) -
An accuracy controllable and memory efficient method for computing high-quality geodesic distances on triangle meshes
by: Adikusuma, Yohanes Yudhi, et al.
Published: (2022) -
On the vertex-oriented triangle propagation (VTP) algorithm : parallelization and approximation
by: Du, Jie, et al.
Published: (2021) -
An optimization-driven approach for computing geodesic paths on triangle meshes
by: Liu, Bangquan, et al.
Published: (2018)