A parallel solution to finding nodal neighbors in generic meshes
In this paper we specifically present a parallel solution to finding the one-ring neighboring nodes and elements for each vertex in generic meshes. The finding of nodal neighbors is computationally straightforward but expensive for large meshes. To improve the efficiency, the parallelism is adopted...
Main Authors: | Pian Qi, Gang Mei, Nengxiong Xu, Hong Tian |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2020-01-01
|
Series: | MethodsX |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2215016120301746 |
Similar Items
-
Designing Parallel Adaptive Laplacian Smoothing for Improving Tetrahedral Mesh Quality on the GPU
by: Ning Xi, et al.
Published: (2021-06-01) -
Neighbor Discovery for IPv6 over BLE Mesh Networks
by: Bingqing Luo, et al.
Published: (2020-03-01) -
Multi-prediction particle filter for efficient parallelized implementation
by: Chu Chun-Yuan, et al.
Published: (2011-01-01) -
GPU-Accelerated 3D Mesh Deformation for Optimization Based on the Finite Element Method
by: A. Lamecki, et al.
Published: (2017-12-01) -
Accurate Global Point Cloud Registration Using GPU-Based Parallel Angular Radon Spectrum
by: Ernesto Fontana, et al.
Published: (2023-10-01)