Transfinite mappings and their application to grid generation

90Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The two essential ingredients of any boundary value problem are the field equations which describe the physics of the problem and a set of relations which specify the geometry of the problem domain. Mesh generators or grid generators are preprocessors whicd decompose the problem domain into a large number of interconnected finite elements or curvilinear finite difference stencils. A number of such techiques have been developed over the past decade to alleviate the frustation and reduce the time involved in the tedious manual subdividing of a complex-shaped region or 3-D structure into finite elements. Our purpose here is to describe how the techniques of bivariate and trivariate "blending function" interpolation, which were originally developed for and applied to geometric problems of computer-aided design of sculptured surface and 3-D solids, can be adapted and applied to the geometric problems of grid generation. In contrast to other techniques which require the numerical solution of complex partial differential equations (and, hence, a great deal of computing), the transfinite methods proposed herein are computationally inexpensive. © 1982.

Cite

CITATION STYLE

APA

Gordon, W. J., & Thiel, L. C. (1982). Transfinite mappings and their application to grid generation. Applied Mathematics and Computation, 1011(C), 171–233. https://doi.org/10.1016/0096-3003(82)90191-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free