Identificador persistente para citar o vincular este elemento:
http://hdl.handle.net/10553/54264
Título: | Graph-based data structures for skeleton-based refinement algorithms | Autores/as: | Suarez, JP Carey, G. F. Plaza, A |
Clasificación UNESCO: | 120601 Construcción de algoritmos | Palabras clave: | Mesh refinement Skeleton Data structures Edge bisection |
Fecha de publicación: | 2001 | Publicación seriada: | Communications in Numerical Methods in Engineering | Resumen: | In this paper, we discuss a class of adaptive re0nement algorithms for generating unstructured meshesin two and three dimensions. We focus on skeleton-based re0nement (SBR )algorithms as proposedby Plaza and Carey (Appl. Numer. Math.2000;32:195 )and provide an extension that involves theintroduction of the graph of the skeleton for meshes consisting of simplex cells. By the use of datastructures derived from the graph of the skeleton, we reformulate the SBR scheme and devise a morenatural and consistent approach for this class of adaptive re0nement algorithms. As an illustrativecase, we discuss in detail the graphs for 2D re0nement of triangulations and for 3D we propose acorresponding new face-based data structure for tetrahedra. Experiments using the 2D algorithm andexploring the properties of the associated graph are provided. | URI: | http://hdl.handle.net/10553/54264 | ISSN: | 1069-8299 | DOI: | 10.1002/cnm.460 | Fuente: | Communications In Numerical Methods In Engineering [ISSN 1069-8299], v. 17 (12), p. 903-910 |
Colección: | Artículos |
Citas SCOPUSTM
13
actualizado el 15-dic-2024
Citas de WEB OF SCIENCETM
Citations
12
actualizado el 15-dic-2024
Visitas
128
actualizado el 23-nov-2024
Google ScholarTM
Verifica
Altmetric
Comparte
Exporta metadatos
Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.