carrier image

A New Meccano Technique for Adaptive 3-D Triangulations

Cascon, J.M., R. Montenegro, J.M. Escobar, E. Rodriguez and G. Montero

Proceedings, 16th International Meshing Roundtable, Springer-Verlag, pp.103-120, October 14-17 2007

IMR
PROCEEDINGS

16th International Meshing Roundtable
Seattle, Washington, U.S.A.
October 14-17, 2007

Department of Mathematics, Faculty of Sciences, University of Salamanca,Spain, casbar@usal.es
Institute for Intelligent Systems and Numerical Applications in Engineering, University of Las Palmas de Gran Canaria, Campus Universitario de Tafira, Las Palmas de G.C., Spain, rafa@dma.ulpgc.es, jescobar@dsc.ulpgc.es, barrera@dma.ulpgc.es, gustavo@dma.ulpgc.es

Abstract
This paper introduces a new automatic strategy for adaptive tetrahedral mesh generation. A local refinement/derefinement algorithm for nested triangulations and a simultaneous untangling and smoothing procedure are the main involved techniques. The mesh generator is applied to 3-D complex domains whose boundaries are projectable on external faces of a coarse object meccano composed of cuboid pieces. The domain surfaces must be given by a mapping between meccano surfaces and object boundary. This mapping can be defined by analytical or discrete functions. At present we have fixed mappings with orthogonal, cylindrical and radial projections, but any other one-to-one projection may be considered. The mesh generator starts from a coarse tetrahedral mesh which is automatically obtained by the subdivision of each hexahedra, of a meccano hexahedral mesh, into six tetrahedra. The main idea is to construct a sequence of nested meshes by refining only those tetrahedra which have a face on the meccano boundary. The virtual projection of meccano external faces defines a valid triangulation on the domain boundary. Then a 3-D local refinement/derefinement is carried out such that the approximation of domain surfaces verifies a given precision. Once this objective is reached, those nodes placed on the meccano boundary are really projected on their corresponding true boundary, and inner nodes are relocated using a suitable mapping. As the mesh topology is kept during node movement, poor quality or even inverted elements could appear in the resulting mesh. For this reason, we finally apply a mesh optimization procedure. The efficiency of the proposed technique is shown with several applications to complex objects.

Download Full Paper (PDF Format)


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