Volume Decomposition and Feature Recognition for Hexahedral Mesh Generation
نویسندگان
چکیده
Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on more general geometry, a combination of the well-established algorithms is ready to take on classes of complicated geometry. By partitioning the entire geometry into meshable pieces matched with appropriate meshing algorithms, the original geometry becomes meshable and may achieve better mesh quality. Each meshable portion is recognized as a meshing feature. This paper, which is a part of the feature based meshing methodology, presents the work on shape recognition and volume decomposition to automatically decompose a CAD model into meshable volumes. There are four phases in this approach: Feature Determination to extract decomposition features, Cutting Surfaces Generation to form the “tailored” cutting surfaces, Body Decomposition to get the imprinted volumes, and Meshing Algorithm Assignment to match volumes decomposed with appropriate meshing algorithms. The feature determination procedure is based on the CLoop feature recognition algorithm that is extended to be more general. Results are demonstrated over several parts with complicated topology and geometry.
منابع مشابه
Feature Recognition Applications in Mesh Generation'
The use of feature recognition as part of an overall decomposition-based hexahedral meshing approach is described in this paper. Our meshing approach consists of feature recognition, using a c-loop or hybrid c-loop method, and the use of cutting surfaces to decompose the solid model. These steps are part of an iterative process, which proceeds either until no more features can be recognized or ...
متن کاملAutomatic scheme selection for toolkit hex meshing
Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50 per cent of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that the...
متن کاملAutomatic Hexahedral Mesh Generation by Recursive Convex and Swept Volume Decomposition
In this paper we present a recursive volume decomposition method for automatically decomposing complex shaped objects with both protrusions and depressions into simpler sub-objects for automatic hexahedral mesh generation. The sub-volumes after decomposition are classified into either convex or swept volumes. For a convex volume, it is mapped to a collection of hexahedral objects. On the other ...
متن کاملAutomated Hexahedral Mesh Generation by Swept Volume Decomposition and Recomposition
In this paper a method is presented to generate uniform hexahedral meshes automatically. In this method, a solid model with complex geometry is decomposed into swept volumes with simpler geometry. A sweepable face on the solid model is selected as the generator face to generate a swept volume. Each generator face is specified with node density and a quadrilateral mesh is generated from it. Then...
متن کاملSheet-Based Hexahedral Mesh Generation
Historically, hexahedral finite element mesh generation has required significant geometric decomposition with the resulting consequence that generating hexahedral meshes can be extremely difficult to perform and automate and the process often takes several orders of magnitude longer in time to complete than current methods for generating tetrahedral meshes. In this work, we present methods for ...
متن کامل