z-logo
Premium
A parallel mesh generation algorithm based on the vertex label assignment scheme
Author(s) -
Cheng Fuhua,
Jaromczyk Jerzy W.,
Lin JunninRen,
Chang ShyueShian,
Lu JeiYeou
Publication year - 1989
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620280613
Subject(s) - t vertices , quadrilateral , polygon mesh , mesh generation , laplacian smoothing , vertex (graph theory) , triangle mesh , subdivision , algorithm , computer science , shared mesh , scheme (mathematics) , switched mesh , smoothness , mathematics , finite element method , theoretical computer science , graph , wireless mesh network , engineering , telecommunications , mathematical analysis , civil engineering , computer graphics (images) , wireless network , structural engineering , wireless
In this article a new mesh generation algorithm is presented. The algorithm is based on a new approach called the vertex label assignment scheme to provide the information for the mesh generation so that parallel processing becomes possible. The algorithm generates 2D meshes of quadrilaterals on the basis of individual faces; conformity and smoothness of the resultant mesh are automatically assured. Local and selective mesh‐refinements are also supported. A regular quadrilateral network which defines the geometry of the problem and an associated subdivision level assignment which specifies mesh density data on the network are the only input information.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here