An approach to reducing the computational cost of constructing curvilinear grids
The author suggests a modification of a well-known method, which occupies a special place among the methods for constructing regular grids in domains with curvilinear boundaries. This method guarantees that, for given coordinates of the boundary nodes, all quadrangular cells of the grid are convex at each iteration step. It considerably reduces the computational cost of constructing grids with a large number of nodes for moving boundary problems.
scientific article; zbMATH DE number 1467884