SMOOTHNESS AND CONVEX AREA FUNCTIONALS-REVISITED

Abstract

In this paper, we introduce two new functionals within the context of the variational grid generation problem: an area functional and a smoothness functional. Both of them are based on an improved adaptive algorithm which focuses on the most folded grid cells. It is shown that when they are minimized in order to generate smooth and convex grids on irregular planar regions the optimization process converges notably faster than it does with other functionals previously reported.