On Delaunay refinement for curved geometries
Adriano C. Lisboa, R.R. Saldanha, Renato Cardoso Mesquita, Ricardo H. C. Takahashi · COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering · 2010
Abstract — A mesh refinement algorithm that deals with curved geome-tries is a key feature for adaptive mesh generators, so that points are in-serted properly in the curved pieces instead of in linear approximations of them. This paper investigates the extension of Delaunay refinement algorithms to work directly with a curved geometry in arbitrary di-mensional spaces based on ideas of the Bowyer-Watson algorithm and Ruppert algorithm. I.