carrier image

Polyhedral Mesh Generation

Oaks, Wayne and Stefano Paoletti

Proceedings, 9th International Meshing Roundtable, Sandia National Laboratories, pp.57-67, October 2000

INTERNATIONAL
MESHING
ROUNTABLE

9th International Meshing Roundtable
October 2-5, 2000, New Orlean Louisiana

Wayne Oaks and Stefano Paoletti
adapco Ltd, 60 Broadhollow Road, Melville 11747 New York, USA
Email: wayne@adapco.com

Abstract
A new methodology to generate a hex-dominant mesh is presented. From a closed surface and an initial all-hex mesh that contains the closed surface, the proposed algorithm generates, by intersection, a new mostly-hex mesh that includes polyhedra located at the boundary of the geometrical domain. The polyhedra may be used as cells if the field simulation solver supports them or be decomposed into hexahedra and pyramids using a generalized mid-point-subdivision technique. This methodology is currently used to provide hex-dominant automatic mesh generation in the preprocessor pro*** END NOTES *** "Borden, Michael, Steven Benzley, Scott A. Mitchell, David R. White and Ray Meyers", "The Cleave and Fill Tool: An All-Hexahedral Refinement Algorithm for Swept Meshes", "Proceedings, 9th International Meshing Roundtable", "Sandia National Laboratories", 0,0,"October","2000","69-76", "imr9/borden00.ps.gz", "hexahedra, refinement, sweeping, cleave and fill" *** BEGIN NOTES *** 9th International Meshing Roundtable
October 2-5, 2000, New Orleans, Louisiana

Michael Borden and Steven Benzley
Brigham Young University, Provo UT, USA
Email: bordmic@et.byu.edu, seb@byu.edu
Scott A. Mitchell, David R. White and Ray Meyers
Sandia National Laboratories, Albuquerque, NM, USA
Email: samitch@sandia.gov, drwhite@sandia.gov, rjmeyer@sandia.gov

Abstract
Sweeping algorithms provide the ability to generate all hexahedral meshes on a wide variety of three-dimensional bodies. The work presented here provides a method to refine these meshes by first defining a path through either the source or the target mesh and next by locating the sweeping layer to initiate the refinement. A major contribution of this work is the ability to automatically find a minimal distance path through the target or source mesh. The refinement is accomplished by using the pil]owing procedure as proposed by Mitchell. [1]

Download Full Paper (PDF)


Contact author(s) or publisher for availability and copyright information on above referenced article