Automatic mesh generation from solid models based on recursive spatial decompositions

This paper introduces a two-stage algorithm for the automatic conversion of solid models into finite element meshes. In Stage 1 the solid is approximated by a collection of variably sized cells generated by recursive spatial decomposition and stored in a logical tree. In Stage 2 the approximating cell structure, which includes cells that are wholly inside the solid (IN) as well as cells that are neither inside nor outside (NIO), is transformed into a finite element model. IN cells are directly mapped into finite elements while NIO cells are decomposed according to their topologically complexity through either template mapping or recursive element extraction. Although specifically designed for adaptive remeshing, the algorithm is of general use and can be implemented in any Solid Modelling System that supports Boolean operations on solids and maintains a complete boundary representation. Core algorithms for Stages i and 2 are rigorously developed to insure their applicability within a genuinely automatic procedure. Specific issues related to boundary evaluation and decomposition procedures are identified and discussed. The implementation of the algorithm into an experimental system based on the PADL-2 solid modeller is described. The paper concludes with a comparative study of existing meshing algorithms based on recursive spatial decompositions.

[1]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[2]  Requicha,et al.  Solid Modeling: A Historical Summary and Contemporary Assessment , 1982, IEEE Computer Graphics and Applications.

[3]  Yehuda E. Kalay.  Determining the spatial containment of a point in general polyhedra , 1982, Comput. Graph. Image Process..

[4]  I. Babuska,et al.  A‐posteriori error estimates for the finite element method , 1978 .

[5]  William H. Frey,et al.  An apporach to automatic three‐dimensional finite element mesh generation , 1985 .

[6]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[7]  K. R. Grice,et al.  Robust, geometrically based, automatic two‐dimensional mesh generation , 1987 .

[8]  Tony C. Woo,et al.  AN ALGORITHM FOR GENERATING SOLID ELEMENTS IN OBJECTS WITH HOLES , 1984 .

[9]  Mark S. Shephard,et al.  AUTOMATIC MESH GENERATION FOR THREE-DIMENSIONAL SOLIDS , 1985 .

[10]  Mark S. Shephard,et al.  Finite Element Mesh Generation for Use with Solid Modeling and Adaptive Analysis , 1984 .

[11]  Robert B. Tilove,et al.  Set Membership Classification: A Unified Approach to Geometric Intersection Problems , 1980, IEEE Transactions on Computers.

[12]  Mukul Saxena,et al.  Geometrical and topological issues in octree based automatic meshing , 1987 .

[13]  Aristides A. G. Requicha,et al.  Algorithms for computing the volume and other integral properties of solids. I. known methods and open issues , 1982, CACM.

[14]  Ivo Babuška,et al.  A posteriori error analysis and adaptive processes in the finite element method: Part I—error analysis , 1983 .

[15]  H. Voelcker,et al.  Solid modeling: current status and research directions , 1983, IEEE Computer Graphics and Applications.

[16]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[17]  Burkard Wordenweber,et al.  Finite-Element Analysis for the Naive User , 1984 .

[18]  A.A.G. Requicha,et al.  Boolean operations in solid modeling: Boundary evaluation and merging algorithms , 1985, Proceedings of the IEEE.

[19]  Mukul Saxena,et al.  A hierarchical structure for automatic meshing and adaptive FEM analysis , 1987 .

[20]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.