Surface approximation by unstructured triangular meshes
Padron, Miguel A.; Suarez, Jose P.; Plaza, Angel
Numerical Grid Generation in Computational Field Simulations, The International Society of Grid Generation, pp.671-677, September 2000
Department of Mathematics and Department of Civil Engineering
University of Las Palmas de Gran Canaria
Spain, C. P. 35017
email: {aplaza, mpadron}@dma.ulpgc.es
Abstract
We present here a new method to the problem of surface approximation. The method takes as the input the domain geometry to generate the mesh as a set of connected triangles. For this goal we use refinement techniques and if neccessary the inverse derefinement algorithm. These algorithms are based on the 3D-SBR (3D-Skeleton-Based-Refinement) algorithm, developed by Plaza and Carey, is used for adaptive refinement of the discretized surface. With this algorithm we can generate and approximate fully automatically the triangular mesh on the surface. Besides the transition between elements of different sizes is assured to be smooth.
In the areas in which the surface is very regular, the 3D-SBD derefinement algorithm can be used. The idea is to have more amount of nodes and elements in those irregular regions and less where they are not neccessary.
Contact author(s) or publisher for availability and copyright information on above referenced article