Premium
Mesh data structure selection for mesh generation and FEA applications
Author(s) -
Garimella Rao V.
Publication year - 2002
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.509
Subject(s) - polygon mesh , hexahedron , computer science , mesh generation , data structure , ranking (information retrieval) , t vertices , finite element method , theoretical computer science , selection (genetic algorithm) , measure (data warehouse) , computational science , algorithm , mathematical optimization , data mining , mathematics , information retrieval , engineering , structural engineering , artificial intelligence , computer graphics (images) , programming language
The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd.