|
Feature based hex meshing methodology: feature recognition and volume decomposition
Lu, Y., R. Gadh, T. J. Tautges
Computer Aided Design, Elsevier, Vol 33, Num 3, pp.221-232, March 2001
|
|
MESHING RESEARCH CORNER
|
The 8th International Meshing Roundtable Special Issue: Advances in Mesh Generation,
Computer Aided Design Volume 33, No. 3, March 2001
R. Gadh and Y. Lu
I-CARVE Lab, University of Wisconsin-Madison, Madison WI, USA
T. J. Tautges
Sandia National Laboratories, USA
E-mail: yong@smartcad.me.wisc.edu
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.
Contact author(s) or publisher for availability and copyright information on above referenced article
|