Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/49768
Campo DC Valoridioma
dc.contributor.authorPlaza, Angelen_US
dc.contributor.authorPadrón, Miguel A.en_US
dc.contributor.authorCarey, Graham F.en_US
dc.date.accessioned2018-11-24T10:32:59Z-
dc.date.available2018-11-24T10:32:59Z-
dc.date.issued2000en_US
dc.identifier.issn0168-9274en_US
dc.identifier.urihttp://hdl.handle.net/10553/49768-
dc.description.abstractIn the present study, a novel three-dimensional refinement/derefinement algorithm for nested tetrahedral grids based on bisection is presented. The algorithm is based on an adaptive refinement scheme and on an inverse algorithm introduced by the authors. These algorithms work first on the skeleton of the 3D triangulation, the set of the triangular faces. Both schemes are fully automatic. The refinement algorithm can be applied to any initial tetrahedral mesh without any preprocessing. The non-degeneracy of the meshes obtained by this algorithm has been experimentally shown. Similarly, the derefinement scheme can be used to get a coarser mesh from a sequence of nested tetrahedral meshes obtained by successive application of the refinement algorithm. In this case, the algorithm presents a self-improvement quality property: the minimum solid angle after derefining is not less than the minimum solid angle of the refined input mesh. The refinement and derefinement schemes can be easily combined to deal with time dependent problems. These combinations depend only on a few parameters that are fixed into the input data by the user. Here we present a simulation test case for these kind of problems. The main features of these algorithms are summarized at the end.en_US
dc.languageengen_US
dc.relation.ispartofApplied Numerical Mathematicsen_US
dc.sourceApplied Numerical Mathematics [ISSN 0168-9274], v. 32 (4), p. 401-418en_US
dc.subject120601 Construcción de algoritmosen_US
dc.subject.otherMesh refinementen_US
dc.subject.otherDerefinementen_US
dc.subject.other3D bisectionen_US
dc.subject.otherTetrahedraen_US
dc.subject.otherAdaptivityen_US
dc.title3D refinement/derefinement algorithm for solving evolution problemsen_US
dc.typeinfo:eu-repo/semantics/Articlees
dc.typeArticlees
dc.identifier.doi10.1016/S0168-9274(99)00060-4
dc.identifier.scopus0034174205-
dc.contributor.authorscopusid7006613647-
dc.contributor.authorscopusid6603825227-
dc.contributor.authorscopusid24517624600-
dc.description.lastpage418-
dc.identifier.issue4-
dc.description.firstpage401-
dc.relation.volume32-
dc.investigacionCienciasen_US
dc.type2Artículoen_US
dc.date.coverdateEnero 2000
dc.identifier.ulpgces
dc.description.jcr0,805
dc.description.jcrqQ2
dc.description.scieSCIE
item.grantfulltextnone-
item.fulltextSin texto completo-
crisitem.author.deptGIR IUMA: Matemáticas, Gráficos y Computación-
crisitem.author.deptIU de Microelectrónica Aplicada-
crisitem.author.deptDepartamento de Matemáticas-
crisitem.author.deptGIR IUMA: Matemáticas, Gráficos y Computación-
crisitem.author.deptIU de Microelectrónica Aplicada-
crisitem.author.deptDepartamento de Ingeniería Civil-
crisitem.author.orcid0000-0002-5077-6531-
crisitem.author.orcid0000-0001-5493-3090-
crisitem.author.parentorgIU de Microelectrónica Aplicada-
crisitem.author.parentorgIU de Microelectrónica Aplicada-
crisitem.author.fullNamePlaza De La Hoz, Ángel-
crisitem.author.fullNamePadrón Medina, Miguel Ángel-
Colección:Artículos
Vista resumida

Citas SCOPUSTM   

22
actualizado el 24-mar-2024

Visitas

74
actualizado el 16-mar-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.