Unconstrained paving & plastering : a new idea for all-hexahedral mesh generation.
Unconstrained Plastering is a new algorithm with the goal of generating a conformal all-hexahedral mesh on any solid geometry assembly. Paving [1] has proven reliable for quadrilateral meshing on arbitrary surfaces. However, the 3D corollary, Plastering [2][3][4][5], is unable to resolve the unmeshed center voids due to being over-constrained by a pre-existing boundary mesh. Unconstrained Plastering attempts to leverage the benefits of Paving and Plastering, without the over-constrained nature of Plastering. Unconstrained Plastering uses advancing fronts to inwardly project unconstrained hexahedral layers from an unmeshed boundary. Only when three layers cross, is a hex element formed. Resolving the final voids is easier since closely spaced, randomly oriented quadrilaterals do not over-constrain the problem. Implementation has begun on Unconstrained Plastering, however, proof of its reliability is still forthcoming.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 948255
- Report Number(s):
- SAND2005-1792C; TRN: US200906%%210
- Resource Relation:
- Conference: Proposed for presentation at the 14th International Meshing Roundtable held September 11-14, 2005 in San Diego, CA.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Unconstrained plastering : all-hexahedral mesh generation via advancing front geometry decomposition (2004-2008).
Plastering: A new approach to automated, 3-D hexahedral mesh generation