| Abstract: | 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. |
