Boss recognition algorithm for application to finite element analysis. Issue 4 (7th June 2017)

• Record Type: Journal Article
• Authors: Wang, Ming-Hsuan; Lai, Jiing-Yih; Hsu, Chia-Hsiang; Tsai, Yao-Chen; Huang, Chung-Yi
• Is Part Of: Computer-aided design and applications. Volume 14:Issue 4(2017)
• Page Start: 450
• Page End: 463
• Publication Date: 2017-06-07
• Subjects: Boss recognition -- Feature recognition -- Meshing -- B-rep model; Computer-aided design -- Congresses; Computer-aided design -- Periodicals; Engineering design -- Data processing -- Congresses; Engineering design -- Periodicals; 620.00420285
• DOI: 10.1080/16864360.2016.1257187
• Languages: English
• ISSNs: 1686-4360

Abstract

ABSTRACT: In finite element analysis (FEA), computer-aided design (CAD) models must be converted into solid meshes so that the solver can perform the desired analysis and simulation. Hexahedral and prism meshes are better than tetrahedral meshes, but are inherently more complex and difficult to generate. The purpose of this study was to propose an approach based on feature recognition for generating better quality solid meshes for FEA applications. Particularly, this study focused on the development of a boss recognition algorithm, the output of boss data for meshing, and the development of a process for automatic boss meshing. The proposed boss recognition method contains three parts: the preliminary functions, the data base, and the boss recognition. The first two parts provide a framework that can be used for other types of feature recognition. The core of the boss recognition is the tube recognition, which involves five main steps of validation. The output data of a boss includes the rib, tube, and hole data, which record not only feature data, but also the meshing data that can be used for automatic meshing. The meshing of a boss is divided into rib meshing and tube meshing. Both hexahedral meshes and prism meshes may be used depending on the regularity and orthogonality of the shape. This paper provides a detailed description of the proposed algorithm and presents several examples to illustrate its feasibility. GRAPHICAL ABSTRACT: