arrow
返回

Parallelizing discrete geodesic algorithms with perfect efficiency

delete2019-10-01
delete8
PRE
AI
X
Xiang Ying
C
Caibao Huang
X
Xuzhou Fu
Y
Ying He *
R
Ruiguo Yu *
J
Jianrong Wang
M
Mei Yu
DOI:10.1016/j.cad.2019.05.023delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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 on the wavefront take the initiative to collect their input data and then propagate windows and update geodesic information in their own memory space. As a result, all the read and write operations can be carried out simultaneously. Our method, named AWP, works for both exact (e.g., the CH algorithm) and approximate (e.g., the fast marching method) geodesic algorithms. Our implementation on various NVIDIA GPUs exhibit perfect linear speedup, i.e., doubling the computational power (i.e., FLOPS) doubles the speed. We prove that the AWP-CH algorithm runs in O(n(2)/min(C, n)) time, where n and C are the numbers of faces and cores, respectively. Evaluation on GTX Titan XP shows that AWP-CH empirically runs in n(p) time, p is an element of [1.25, 1.35], for real-world models with n <= 10(7) and anisotropy measure tau <= 2.0. Thanks to its perfect efficiency and the trend of increasing the number of processors in graphics hardware, we believe that the actual performance of AWP can be further improved in the near future. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Discrete geodesics
Autonomous wavefront propagation
The Chen-Han algorithm
The fast marching method
Parallel algorithm
Perfect efficiency
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computer-Aided Design
IF:
3.1
论文数:
3.1K
被引数:
6.4K

机构

T
tianjin university
学者数:
8.0W
论文数: 5.8W
被引数: 88
N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
引用论文

引用论文

O(N) implementation of the fast marching algorithm
err2006-03-01
err177
errOAAI
errYatziv, L; Bartesaghi, A; Sapiro, G
err分享
err收藏
Parallel Chen-Han (PCH) Algorithm for Discrete Geodesics
err2014-02-07
err39
errOAAI
errYing, Xiang; Xin, Shi-Qing; He, Ying
err分享
err收藏
Parallel Algorithms for Approximation of Distance Maps on Parametric Surfaces
err2008-11-04
err92
errOAAI
errWeber, Ofir; Devir, Yohai S.; Bronstein, Alexander M.; Bronstein, Michael M.; Kimmel, Ron
err分享
err收藏
Geodesics in Heat: A New Approach to Computing Distance Based on Heat Flow
err2013-10-08
err338
errOAAI
errCrane, Keenan; Weischedel, Clarisse; Wardetzky, Max
err分享
err收藏
学者 查看更多内容