首页 | 本学科首页   官方微博 | 高级检索  
     


Meshing complexity: predicting meshing difficulty for single part CAD models
Authors:David R. White  Sunil Saigal  Steven J. Owen
Affiliation:(1) Department of Civil and Environmental Engineering, Carnegie Mellon University, Pittsburgh, PA 15213, USA;(2) Sandia National Laboratories, PO Box 5800, MS 0847, Albuquerque, NM, 87185-0847, USA;(3) Department of Civil and Environmental Engineering, University of South Florida, Tampa, FL 33620-5350, USA
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.
Keywords:Time to mesh  Mesh complexity  Blend detection  Geometry clean-up
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号