A 2-D Delaunay Refinement Algorithm Using an Initial Prerefinement From the Boundary Mesh

• Published in: IEEE transactions on magnetics Vol. 44; no. 6; pp. 1418 - 1421
• Main Authors: Sakamoto, M.M., Cardoso, J.R., Machado, J.M., Salles, M.
• Format: Journal Article Conference Proceeding
• Language: English
• Published: New York, NY IEEE 01.06.2008; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Boundaries; Computational geometry; Costs; Criteria; Cross-disciplinary physics: materials science; rheology; Delaunay triangulation; Exact sciences and technology; Finite element methods; finite-element methods (FEMs); Geometry; Lenses; Magnetism; Materials science; Mathematical analysis; Mesh generation; Other topics in materials science; Parallel processing; Physics; prerefinement; Process control; Refining; Segments; Strategy; Synchronization; Triangles; Geometry; Finite element method; Computational geometry; prerefinement; finite-element methods (FEMs); Delaunay triangulation; Modelling; Magnetic properties
• DOI: 10.1109/TMAG.2008.915856
• ISSN: 0018-9464

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.