Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “grid generation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Parallel grid generation algorithm for distributed memory computers

A parallel grid-generation algorithm and its implementation on the Intel iPSC/860 computer are described. The grid-generation scheme is based on an algebraic formulation of homotopic relations. Methods for utilizing the inherent parallelism of the grid-generation scheme are described, and implementation of multiple levELs of parallelism on multiple instruction multiple data machines are indicated. The algorithm is capable of providing near orthogonality and spacing control at solid boundaries while requiring minimal interprocessor communications. Results obtained on the Intel hypercube for a blended wing-body configuration are used to demonstrate the effectiveness of the algorithm. Fortran implementations bAsed on the native programming model of the iPSC/860 computer and the Express system of software tools are reported. Computational gains in execution time speed-up ratios are given.

Moitra, Stuti↗

Interactive surface grid generation

This paper describes a surface grid generation tool called S3D. It is the result of integrating a robust and widely applicable interpolation technique with the latest in workstation technology. Employing the use of a highly efficient and user-friendly graphical interface, S3D permits real-time interactive analyses of surface geometry data and facilitates the construction of surface grids for a wide range of applications in Computational Fluid Dynamics (CFD). The design objectives are for S3D to be stand-alone and easy to use so that CFD analysts can take a hands-on approach toward most if not all of their surface grid generation needs. Representative examples of S3D applications are presented in describing the various elements involved in the process.

Luh, Raymond Ching-Chung↗

TIGGERC: Turbomachinery interactive grid generator energy distributor and restart code

A two dimensional multi-block grid generator was developed for a new design and analysis system for studying multi-blade row turbomachinery problems with an axisymmetric viscous/inviscid 'average passage' through flow code. TIGGERC is a mouse driven, fully interactive grid generation program which can be used to modify boundary coordinates and grid packing. TIGGERC generates grids using a hyperbolic tangent or algebraic distribution of grid points on the block boundaries and the interior points of each block grid are distributed using a transfinite interpolation approach. TIGGERC generates a blocked axisymmetric H grid, C grid, I grid, or O grid for studying turbomachinery flow problems. TIGGERC was developed for operation on small high speed graphic workstations.

Miller, David P.↗

Workshop on Grid Generation and Related Areas

A collection of papers given at the Workshop on Grid Generation and Related Areas is presented. The purpose of this workshop was to assemble engineers and scientists who are currently working on grid generation for computational fluid dynamics (CFD), surface modeling, and related areas. The objectives were to provide an informal forum on grid generation and related topics, to assess user experience, to identify needs, and to help promote synergy among engineers and scientists working in this area. The workshop consisted of four sessions representative of grid generation and surface modeling research and application within NASA LeRC. Each session contained presentations and an open discussion period.

Source record↗

Incompressible and anelastic flow simulations on numerically generated grids

In the numerical simulation of incompressible and anelastic flows, it is necessary to solve an elliptic equation at each time step. When the boundaries of such flows are nonrectangular, it may be advantageous to solve the equations on a new, numerically generated coordinate grid, in which the property of orthogonality has been preserved. Flow equations in general curvilinear coordinates maintaining the conservative form are given for both anelastic models using the momentum equations, and for incompressible models, using the vorticity equation. The general problem of grid-generation in two dimensions is presented, and a quasi-conformal transformation technique is discussed in detail. Some examples of grids generated by this technique are exhibited. Three examples of the flow of a stratified fluid over obstacles are presented, in which the grid-generation permits some new results to be obtained.

Sharman, R. D.↗

TIGER: A user-friendly interactive grid generation system for complicated turbomachinery and axis-symmetric configurations

The issue of time efficiency in grid generation is addressed by developing a user friendly graphical interface for interactive/automatic construction of structured grids around complex turbomachinery/axis-symmetric configurations. The accuracy of geometry modeling and its fidelity is accomplished by adapting the nonuniform rational b-spline (NURBS) representation. A customized interactive grid generation code, TIGER, has been developed to facilitate the grid generation process for complicated internal, external, and internal-external turbomachinery fields simulations. The FORMS Library is utilized to build user-friendly graphical interface. The algorithm allows a user to redistribute grid points interactively on curves/surfaces using NURBS formulation with accurate geometric definition. TIGER's features include multiblock, multiduct/shroud, multiblade row, uneven blade count, and patched/overlapping block interfaces. It has been applied to generate grids for various complicated turbomachinery geometries, as well as rocket and missile configurations.

Shih, Ming H.↗

Unstructured Cartesian/prismatic grid generation for complex geometries

The generation of a hybrid grid system for discretizing complex three dimensional (3D) geometries is described. The primary grid system is an unstructured Cartesian grid automatically generated using recursive cell subdivision. This grid system is sufficient for computing Euler solutions about extremely complex 3D geometries. A secondary grid system, using triangular-prismatic elements, may be added for resolving the boundary layer region of viscous flows near surfaces of solid bodies. This paper describes the grid generation processes used to generate each grid type. Several example grids are shown, demonstrating the ability of the method to discretize complex geometries, with very little pre-processing required by the user.

Karman, Steve L., Jr.↗

Elliptic Volume Grid Generation for Viscous CFD Parametric Design Studies

This paper presents a robust method for the generation of zonal volume grids of design parametrics for aerodynamic configurations. The process utilizes simple algebraic techniques with parametric splines coupled with elliptic volume grid generation to generate isolated zonal grids for changes in body configuration needed to perform parametric design studies. Speed of the algorithm is maximized through the algebraic methods and reduced number of grid points to be regenerated for each design parametric without sacrificing grid quality and continuity within the volume domain. The method is directly applicable to grid reusability, because it modifies existing ow adapted volume grids and enables the user to restart the CFD solution process with an established flow field. Use of this zonal approach reduces computer usage time to create new volume grids for design parametric studies by an order of magnitude, as compared to current methods which require the regeneration of an entire volume grid. A sample configuration of a proposed Single Stage-to-Orbit Vehicle is used to illustrate an application of this method.

Alter, Stephen J.↗

Grid generation for general 2-D regions using hyperbolic equations

A method for applying a hyperbolic grid generation scheme to the construction of meshes in general 2-D regions has been developed. This approach, which follows the theory developed by Steger and Chaussee (1980) and the algorithm outlined by Kinsey and Barth (1984), is based on improving local grid control. This is accomplished by adding an angle control source term to the equations and using a new algorithm for computing the volume source term. These modifications lead to superior methods for fixing the 'local' problems of hyperbolic grid generation, namely, propagation of initial discontinuities and formation of grid shocks (crossing grid lines). More importantly, a method for solving the global problem of constraining the grid with more than one boundary (internal grid generation) has been developed. These algorithms have been implemented in an interactive grid generation program and the results for several geometries are presented and discussed.

Cordova, Jeffrey Q.↗

A comparison using APPL and PVM for a parallel implementation of an unstructured grid generation program

Efforts to parallelize the VGRIDSG unstructured surface grid generation program are described. The inherent parallel nature of the grid generation algorithm used in VGRIDSG was exploited on a cluster of Silicon Graphics IRIS 4D workstations using the message passing libraries Application Portable Parallel Library (APPL) and Parallel Virtual Machine (PVM). Comparisons of speed up are presented for generating the surface grid of a unit cube and a Mach 3.0 High Speed Civil Transport. It was concluded that for this application, both APPL and PVM give approximately the same performance, however, APPL is easier to use.

Arthur, Trey↗

A package for 3-D unstructured grid generation, finite-element flow solution and flow field visualization

A set of computer programs for 3-D unstructured grid generation, fluid flow calculations, and flow field visualization was developed. The grid generation program, called VGRID3D, generates grids over complex configurations using the advancing front method. In this method, the point and element generation is accomplished simultaneously, VPLOT3D is an interactive, menudriven pre- and post-processor graphics program for interpolation and display of unstructured grid data. The flow solver, VFLOW3D, is an Euler equation solver based on an explicit, two-step, Taylor-Galerkin algorithm which uses the Flux Corrected Transport (FCT) concept for a wriggle-free solution. Using these programs, increasingly complex 3-D configurations of interest to aerospace community were gridded including a complete Space Transportation System comprised of the space-shuttle orbitor, the solid-rocket boosters, and the external tank. Flow solutions were obtained on various configurations in subsonic, transonic, and supersonic flow regimes.

Parikh, Paresh↗

Algebraic grid generation using tensor product B-splines

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

Saunders, B. V.↗

Methods for prismatic/tetrahedral grid generation and adaptation

The present work involves generation of hybrid prismatic/tetrahedral grids for complex 3-D geometries including multi-body domains. The prisms cover the region close to each body's surface, while tetrahedra are created elsewhere. Two developments are presented for hybrid grid generation around complex 3-D geometries. The first is a new octree/advancing front type of method for generation of the tetrahedra of the hybrid mesh. The main feature of the present advancing front tetrahedra generator that is different from previous such methods is that it does not require the creation of a background mesh by the user for the determination of the grid-spacing and stretching parameters. These are determined via an automatically generated octree. The second development is a method for treating the narrow gaps in between different bodies in a multiply-connected domain. This method is applied to a two-element wing case. A High Speed Civil Transport (HSCT) type of aircraft geometry is considered. The generated hybrid grid required only 170 K tetrahedra instead of an estimated two million had a tetrahedral mesh been used in the prisms region as well. A solution adaptive scheme for viscous computations on hybrid grids is also presented. A hybrid grid adaptation scheme that employs both h-refinement and redistribution strategies is developed to provide optimum meshes for viscous flow computations. Grid refinement is a dual adaptation scheme that couples 3-D, isotropic division of tetrahedra and 2-D, directional division of prisms.

Kallinderis, Y.↗

Noniterative grid generation using parabolic difference equations for fuselage-wing flow calculations

A fast method for generating three-dimensional grids for fuselage-wing transonic flow calculations using parabolic difference equations is described. No iterative scheme is used in the three-dimensional sense; grids are generated from one grid surface to the next starting from the fuselage surface. The computational procedure is similar to the iterative solution of the two-dimensional heat conduction equation. The proposed method is at least 10 times faster than the elliptic grid generation method and has much smaller memory requirements. Results are presented for a fuselage and wing of NACA-0012 section and thickness ratio of 10 percent. Although only H-grids are demonstrated, the present technique should be applicable to C-grids and O-grids in three dimensions.

Nakamura, S.↗

Batch mode grid generation: An endangered species

Non-interactive grid generation schemes should thrive as emphasis shifts from development of numerical analysis and design methods to application of these tools to real engineering problems. A strong case is presented for the continued development and application of non-interactive geometry modeling methods. Guidelines, strategies, and techniques for developing and implementing these tools are presented using current non-interactive grid generation methods as examples. These schemes play an important role in the development of multidisciplinary analysis methods and some of these applications are also discussed.

Schuster, David M.↗

New Boundary Constraints for Elliptic Systems used in Grid Generation Problems

This paper discusses new boundary constraints for elliptic partial differential equations as used in grid generation problems in generalized curvilinear coordinate systems. These constraints, based on the principle of local conservation of thermal energy in the vicinity of the boundaries, are derived using the Green's Theorem. They uniquely determine the so called decay parameters in the source terms of these elliptic systems. These constraints' are designed for boundary clustered grids where large gradients in physical quantities need to be resolved adequately. It is observed that the present formulation also works satisfactorily for mild clustering. Therefore, a closure for the decay parameter specification for elliptic grid generation problems has been provided resulting in a fully automated elliptic grid generation technique. Thus, there is no need for a parametric study of these decay parameters since the new constraints fix them uniquely. It is also shown that for Neumann type boundary conditions, these boundary constraints uniquely determine the solution to the internal elliptic problem thus eliminating the non-uniqueness of the solution of an internal Neumann boundary value grid generation problem.

Kaul, Upender K.↗

EAGLEView: A surface and grid generation program and its data management

An old and proven grid generation code, the EAGLE grid generation package, is given an added dimension of a graphical interface and a real time data base manager. The Numerical Aerodynamic Simulation (NAS) Panel Library is used for the graphical user interface. Through the panels, EAGLEView constructs the EAGLE script command and sends it to EAGLE to be processed. After the object is created, the script is saved in a mini-buffer which can be edited and/or saved and reinterpreted. The graphical objects are set-up in a linked-list and can be selected or queried by pointing and clicking the mouse. The added graphical enhancement to the EAGLE system emphasizes the unique capability to construct field points around complex geometry and visualize the construction every step of the way.

Remotigue, M. G.↗

Interactive grid generation for turbomachinery flow field simulations

The control point form of algebraic grid generation presented provides the means that are needed to generate well structured grids for turbomachinery flow simulations. It uses a sparse collection of control points distributed over the flow domain. The shape and position of coordinate curves can be adjusted from these control points while the grid conforms precisely to all boundaries. An interactive program called TURBO, which uses the control point form, is being developed. Basic features of the code are discussed and sample grids are presented. A finite volume LU implicit scheme is used to simulate flow in a turbine cascade on the grid generated by the program.

Choo, Yung K.↗