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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.