Cargando…
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...
Autores principales: | Qi, Pian, Mei, Gang, Xu, Nengxiong, Tian, Hong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7306601/ https://www.ncbi.nlm.nih.gov/pubmed/32596136 http://dx.doi.org/10.1016/j.mex.2020.100954 |
Ejemplares similares
-
Accelerating adaptive inverse distance weighting interpolation algorithm on a graphics processing unit
por: Mei, Gang, et al.
Publicado: (2017) -
Method for generating high-quality tetrahedral meshes of geological models by utilizing CGAL
por: Wang, Bowen, et al.
Publicado: (2020) -
Partnering to Find Solutions: Metal Recyclers and Neighbors Plan for Better Environmental Health
por: Schmidt, Charles W.
Publicado: (2023) -
A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU
por: Mei, Gang, et al.
Publicado: (2018) -
Comparative investigation of parallel spatial interpolation algorithms for building large-scale digital elevation models
por: Tu, Jingzhi, et al.
Publicado: (2020)