Unconstrained Paving & Plastering: A New Idea for All Hexahedral Mesh Generation

  • Matthew L. Staten
  • Steven J. Owen
  • Ted D. Blacker
Conference paper

Summary

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.

Keywords

mesh generation hexahedra plastering sweeping paving 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. D. Blacker, M. B. Stephenson. “Paving: A New Approach to Automated Quadrilateral Mesh Generation”, International Journal for Numerical Methods in Engineering, 32, 811–847 (1991).CrossRefGoogle Scholar
  2. 2.
    S. A. Canann, “Plastering: A New Approach to Automated 3-D Hexahedral Mesh Generation”, American Institute of Aeronautics and Astronics (1992).Google Scholar
  3. 3.
    J. Hipp, R. Lober, “Plastering: All-Hexahedral Mesh Generation Through Connectivity Resolution”, Proc. 3rd International meshing Roundtable (1994).Google Scholar
  4. 4.
    S. A. Canann, “Plastering and Optismoothing: New Approaches to Automated 3D Hexahedral Mesh Generation and Mesh Smoothing”, Ph.D. Dissertation, Brigham Young University, Provo, Utah, USA (1991).Google Scholar
  5. 5.
    T. D. Blacker, R. J. Meyers, “Seams and Wedges in Plastering: A 3D Hexahedral Mesh Generation Algorithm”, Engineering With Computers, 2, 83–93 (1993).CrossRefGoogle Scholar
  6. 6.
    P.-L. George, H. Borouchaki, “Delaunay Triangulation and Meshing: Application to Finite Elements”, © Editions HERMES, Paris, 1998.Google Scholar
  7. 7.
    S. J. Owen, M. L. Staten, S. A. Canann, S. Siagal, “Q-Morph: An Indirect Approach to Advancing Fron Quad Meshing”, International Journal for Numerical Methods in Engineering, 44, 1317–1340 (1999).CrossRefGoogle Scholar
  8. 8.
    D. R. White, P. Kinney, “Redesign of the Paving Algorithm: Robustness Enhancements through Element by Element Meshing”, Proc. 6th Int. Meshing Roundtable, 323–335 (1997).Google Scholar
  9. 9.
    D. Dewhirst, S. Vangavolu, H. Wattrick, “The Combination of Hexahedral and Tetrahedral Meshing Algorithms”, Proc. 4th International Meshing Roundtable, 291–304 (1995).Google Scholar
  10. 10.
    R. Meyers, T. Tautges, P. Tuchinsky, “The ‘Hex-Tet’ Hex-Dominant Meshing Algorithm as Implemented in CUBIT”, Proc. 7th International Meshing Roundtable, 151–158 (1998).Google Scholar
  11. 11.
    S. J. Owen, S. Canann, S. Siagal, “Pyramid Elements for Maintaining Tetrahedra to Hexahedra Conformability”, Trends in Unstructured Mesh Generation, AMD Vol 220, 123–129, ASME (1997).Google Scholar
  12. 12.
    R. W. Leland, D. Melander, R. Meyers, S. Mitchell, T. Tautges, “The Geode Algorithm: Combining Hex/Tet Plastering, Dicing and Transition Elements for Automatic, All-Hex Mesh Generation”, Proc 7th International Meshing Roundtable, 515–521 (1998).Google Scholar
  13. 13.
    S. J. Owen, “Non-Simplical Unstructured Mesh Generation”, Ph.D. Dissertation, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA (1999).Google Scholar
  14. 14.
    T. J. Tautges, T. Blacker, S. Mitchell, “The Whisker-Weaving Algorithm: A Connectivity Based Method for Constructing All-Hexahedral Finite Element Meshes”, International Journal for Numerical Methods in Engineering, 39, 3327–3349 (1996).MathSciNetCrossRefGoogle Scholar
  15. 15.
    P. Murdoch, S. Benzley, “The Spatial Twist Continuum”, Proc. 4th International Meshing Roundtable, 243–251 (1995).Google Scholar
  16. 16.
    N. T. Folwell, S. A. Mitchell, “Reliable Whisker Weaving via Curve Contraction,” Proc. 7th International Meshing Roundtable, 365–378 (1998).Google Scholar
  17. 17.
    R. Schneiders, R. Schindler, R. Weiler, “Octree-Based Generation of Hexahedral Element Meshes”, Proc. 5th International Meshing Roundtable, 205–217 (1996).Google Scholar
  18. 18.
    P. Kraft, “Automatic Remeshing with Hexahedral Elements: Problems, Solutions and Applications”, Proc. 8th International Meshing Roundtable, 357–368 (1999).Google Scholar
  19. 19.
    G. D. Dhondt, “Unstructured 20-Node Brick Element Meshing”, Proc. 8th International Meshing Roundtable, 369–376 (1999).Google Scholar
  20. 20.
    T. D. Blacker, “The Cooper Tool”, Proc. 5th International Meshing Roundtable, 13–29 (1996).Google Scholar
  21. 21.
    Mingwu Lai, “Automatic Hexahedral Mesh Generation by Generalized Multiple Source to Multiple Target Sweeping”, Ph.D. Dissertation, Brigham Young University, Provo, Utah, USA (1998).Google Scholar
  22. 22.
    M. L. Staten, S. Canann, S. Owen, “BMSweep: Locating Interior Nodes During Sweeping”, Proc. 7th International Meshing Roundtable, 7–18 (1998).Google Scholar
  23. 23.
    T. S. Li, R. M. McKeag, C. G. Armstrong, “Hexahedral Meshing Using Midpoint Subdivision and Integer Programming”, Computer Methods in Applied Mechanics and Engineering, Vol 124, Issue 1-2, 171–193 (1995).CrossRefGoogle Scholar
  24. 24.
    D. R. White, L. Mingwu, S. Benzley, “Automated Hexahedral Mesh Generation by Virtual Decomposition”, Proc. 4th International Meshing Roundtable, 165–176 (1995).Google Scholar
  25. 25.
    D. R. White, “Automatic, Quadrilateral and Hexahedral Meshing of Pseudo-Cartesian Geometries using Virtual Subdivision”, Master’s Thesis, Brigham Young University, Provo, Utah, USA (1996).Google Scholar
  26. 26.
    M Bern, D. Eppstein, “Flipping Cubical Meshes,” Proc. 10th International Meshing Roundtable, 19–29 (2001).Google Scholar
  27. 27.
    P. Knupp and S. A. Mitchell, “Integration of mesh optimization with 3D all-hex mesh generation,” Tech. Rep. SAND99-2852, Sandia National Laboratories, 1999, http://citeseer.ist.psu.edu/knupp99integration.html.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Matthew L. Staten
    • 1
  • Steven J. Owen
    • 1
  • Ted D. Blacker
    • 1
  1. 1.Sandia National LaboratoriesAlbuquerqueUSA

Personalised recommendations