Journal Article10.1016/S0010-4485(00)00122-6
Feature based hex meshing methodology: feature recognition and volume decomposition ☆
82
TL;DR: In this article, a feature-based meshing methodology is proposed to automatically decompose a CAD model into hex meshable volumes, where each meshable portion is recognized as a meshing feature.
read more
Abstract: Considerable progress has been made on automatic hexahedral mesh generation in recent years. A few automated meshing algorithms (e.g. mapping, submapping, sweeping) have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on arbitrary 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 hex meshable volumes. There are four phases in this approach: Feature Determination to extract decomposition features; Cutting Surfaces Generation to form the cutting surfaces; Body Decomposition to get the imprinted volumes; and Meshing Algorithm Assignment to match volumes decomposed with appropriate meshing algorithms. This paper focuses on describing feature determination and volume decomposition; the last part has been described in another paper. The feature determination procedure is based on the CLoop feature recognition algorithm that is extended to be more general. Some decomposition and meshing results are demonstrated in the final section.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Automatic Scheme Selection for Toolkit Hex Meshing
TL;DR: This paper describes a new algorithm for detecting extruded or sweepable geometries that uses topological and local geometric information, and is more robust than feature recognition-based algorithms.
Software environment for CAD/CAE integration
TL;DR: A new software environment for CAD/CAE integration based on the mixed representation is presented in this paper, thus a set of necessary tools is associated to the mixed shape representation which contribute to reduce as much as possible the time of model preparation process.
63
Wrap-around operation to make multi-resolution model of part and assembly
Seungbum Koo,Kunwoo Lee +1 more
TL;DR: A method for simplifying boundary representation models, in which the wrapping of products using the plastic wrap in the kitchen has been imitated, and an overlap between parts exists and faces that cannot be seen from outside of the model exist is presented.
62
Special section on CAD/Graphics 2013: Feature-based simplification of boundary representation models using sequential iterative volume decomposition
Byung Chul Kim,Duhwan Mun +1 more
TL;DR: A feature-based simplification method of boundary representation (B-rep) models using sequential iterative volume decomposition is proposed, and it is verified that the proposed method successfully simplified B-rep models.
56
A Critical Review of Feature Recognition Techniques
TL;DR: A critical literature review of approaches to Feature Recognition, a technique to identify and extract application-specific information from input models for downstream engineering activities, is presented.
56
References
A Survey of Unstructured Mesh Generation Technology.
Steven J. Owen
- 01 Jan 1998
TL;DR: A brief survey of some of the fundamental algorithms in unstructured mesh generation is presented, including a discussion and categorization of triangle, tetrahedral, quadrilateral and hexahedral mesh generation methods currently in use in academia and industry.
634
Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part I—a framework for surface mesh optimization
TL;DR: In this paper, the authors extended structured mesh quality optimization methods to optimization of unstructured triangular, quadrilateral, and mixed finite element meshes using matrices and matrix norms.
The whisker weaving algorithm: a connectivity‐based method for constructing all‐hexahedral finite element meshes
TL;DR: This paper introduces a new algorithm called whisker weaving for constructing unstructured, all-hexahedral finite element meshes based on the Spatial Twist Continuum (STC), a global interpretation of the geometric dual of an all- hexahedral mesh.
Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part II—A framework for volume mesh optimization and the condition number of the Jacobian matrix
TL;DR: Three-dimensional unstructured tetrahedral and hexahedral finite element mesh optimization is studied from a theoretical perspective and by computer experiments to determine what objective functions are most effective in attaining valid, high quality meshes.
A grid-based algorithm for the generation of hexahedral element meshes
TL;DR: The algorithm was designed for use in the fem-simulation of metal forming processes where a remeshing must be done very often and can be used for meshing any geometry with hexahedral elements.
248