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...

Descripción completa

Detalles Bibliográficos
Autores principales: Qi, Pian, Mei, Gang, Xu, Nengxiong, Tian, Hong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2020
Materias:
Computer Science
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

Internet

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