Name
Abstract | ||
|---|---|---|
This paper proposes a method for predicting the complexity of meshing computer aided design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity refers to the relative level of effort required to generate a valid finite element mesh on a given CAD geometry. A function is proposed to approximate the meshing complexity for single part CAD models. The function is dependent on a user defined element size as well as on data extracted from the geometry and topology of the CAD part. Several geometry and topology measures are proposed, which both characterize the shape of the CAD part and detect configurations that complicate mesh generation. Based on a test suite of CAD models, the function is demonstrated to be accurate within a certain range of error. The solution proposed here is intended to provide managers and users of meshing software a method of predicting the difficulty in meshing a CAD model. This will enable them to make decisions about model simplification and analysis approaches prior to mesh generation. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s00366-005-0002-x | Eng. Comput. (Lond.) |
Keywords | Field | DocType |
valid finite element mesh,meshing complexity,mesh generation,meshing software,meshing computer,cad geometry,single part cad model,cad model,element size,cad part,meshing difficulty,finite element method,mathematical model,computer aided design | CAD,Test suite,Hexahedron,Computer science,Computer Aided Design,Image-based meshing,Theoretical computer science,Finite element method,Software,Mesh generation | Journal |
Volume | Issue | ISSN |
21 | 1 | 1435-5663 |
Citations | PageRank | References |
4 | 0.48 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David R. White | 1 | 631 | 41.35 |
| Sunil Saigal | 2 | 59 | 10.91 |
| Steven J. Owen | 3 | 440 | 49.16 |