Boundary refinement in n-dimensional Delaunay-meshing
Imre Sebestyén, A. Vagvolgyi, S. Gyimóthy · IEEE Transactions on Magnetics · 2000
A practical and robust mesh refinement algorithm was developed for simplex meshes based on the point insertion method. The algorithm fully exploits the n-dimensional phenomenon of simplex elements, and focuses on boundary refinement as the most general case. The resulting mesh is a constrained Delaunay-type. The algorithm was successfully tested on 3D and 4D problems. Also a data structure was developed for the efficient implementation of the algorithm.