Publicação:
A 2-D delaunay refinement algorithm using an initial prerefinement from the boundary mesh

Página do item simplificado
dc.contributor.authorSakamoto, Mauro Massayoshi
dc.contributor.authorCardoso, José Roberto
dc.contributor.authorMachado, José Márcio [UNESP]
dc.contributor.authorSalles, Maurício
dc.contributor.institutionUniversidade de São Paulo (USP)
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.contributor.institutionRWTH Aachen University
dc.date.accessioned2014-05-27T11:23:33Z
dc.date.available2014-05-27T11:23:33Z
dc.date.issued2008-06-01
dc.description.abstractAn improvement to the quality bidimensional Delaunay mesh generation algorithm, which combines the mesh refinement algorithms strategy of Ruppert and Shewchuk is proposed in this research. The developed technique uses diametral lenses criterion, introduced by L. P. Chew, with the purpose of eliminating the extremely obtuse triangles in the boundary mesh. This method splits the boundary segment and obtains an initial prerefinement, and thus reducing the number of necessary iterations to generate a high quality sequential triangulation. Moreover, it decreases the intensity of the communication and synchronization between subdomains in parallel mesh refinement. © 2008 IEEE.en
dc.description.affiliationLaboratório de Eletromagnetismo Aplicado Departamento de Engenharia de Energia e Automação Elétricas Universidade de São Paulo, CO 05508-900
dc.description.affiliationDepartamento de Ciências da Computação e Estatística Universidade Estadual Paulista, CO 15054-000
dc.description.affiliationInstitute of Electrical Machines RWTH Aachen University, CO D-52056
dc.description.affiliationUnespDepartamento de Ciências da Computação e Estatística Universidade Estadual Paulista, CO 15054-000
dc.format.extent1418-1421
dc.identifierhttp://dx.doi.org/10.1109/TMAG.2008.915856
dc.identifier.citationIEEE Transactions on Magnetics, v. 44, n. 6, p. 1418-1421, 2008.
dc.identifier.doi10.1109/TMAG.2008.915856
dc.identifier.issn0018-9464
dc.identifier.lattes2405706828751494
dc.identifier.scopus2-s2.0-44049106523
dc.identifier.urihttp://hdl.handle.net/11449/70422
dc.language.isoeng
dc.relation.ispartofIEEE Transactions on Magnetics
dc.relation.ispartofjcr1.467
dc.relation.ispartofsjr0,488
dc.rights.accessRightsAcesso restrito
dc.sourceScopus
dc.subjectComputational geometry
dc.subjectDelaunay triangulation
dc.subjectFinite-element methods (FEMs)
dc.subjectPrerefinement
dc.subjectBoundary mesh
dc.subjectParallel mesh refinement
dc.subjectAlgorithms
dc.subjectFinite element method
dc.subjectLenses
dc.subjectParallel processing systems
dc.subjectMesh generation
dc.titleA 2-D delaunay refinement algorithm using an initial prerefinement from the boundary meshen
dc.typeArtigo
dcterms.licensehttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
dspace.entity.typePublication
unesp.author.lattes2405706828751494
unesp.campusUniversidade Estadual Paulista (Unesp), Instituto de Biociências Letras e Ciências Exatas, São José do Rio Pretopt
unesp.departmentCiências da Computação e Estatística - IBILCEpt

Arquivos

Coleções

São José do Rio Preto - IBILCE - Instituto de Biociências, Letras e Ciências Exatas