A 2-D delaunay refinement algorithm using an initial prerefinement from the boundary mesh
Nenhuma Miniatura disponível
Data
2008-06-01
Autores
Sakamoto, Mauro Massayoshi
Cardoso, José Roberto
Machado, José Márcio [UNESP]
Salles, Maurício
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
An 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.
Descrição
Palavras-chave
Computational geometry, Delaunay triangulation, Finite-element methods (FEMs), Prerefinement, Boundary mesh, Parallel mesh refinement, Algorithms, Finite element method, Lenses, Parallel processing systems, Mesh generation
Como citar
IEEE Transactions on Magnetics, v. 44, n. 6, p. 1418-1421, 2008.