Search NASA⌕ Search

SEARCH · Search NASA

Results for “Geometry meshing”

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 109 records · Page 6

Simulation of Complex Cracking in Plain Weave C/SiC Composite under Biaxial Loading

Finite element analysis is performed on a mesh, based on computed geometry of a plain weave C/SiC composite with assumed internal stacking, to reveal the pattern of internal damage due to biaxial normal cyclic loading. The simulation encompasses intertow matrix cracking, matrix cracking inside the tows, and separation at the tow-intertow matrix and tow-tow interfaces. All these dissipative behaviors are represented by traction-separation cohesive laws. Not aimed at quantitatively predicting the overall stress-strain relation, the simulation, however, does not take the actual process of fiber debonding into account. The fiber tows are represented by a simple rule-of-mixture model where the reinforcing phase is a hypothetical one-dimensional material. Numerical results indicate that for the plain weave C/SiC composite, 1) matrix-crack initiation sites are primarily determined by large intertow matrix voids and interlayer tow-tow contacts, 2) the pattern of internal damage strongly depends on the loading path and initial stress, 3) compressive loading inflicts virtually no damage evolution. KEY WORDS: ceramic matrix composite, plain weave, cohesive model, brittle failure, smeared crack model, progressive damage, meso-mechanical analysis, finite element.

Cheng, Ron-Bin↗

An ODE-Based Wall Model for Turbulent Flow Simulations

Fully automated meshing for Reynolds-Averaged Navier-Stokes Simulations, Mesh generation for complex geometry continues to be the biggest bottleneck in the RANS simulation process; Fully automated Cartesian methods routinely used for inviscid simulations about arbitrarily complex geometry; These methods lack of an obvious & robust way to achieve near wall anisotropy; Goal: Extend these methods for RANS simulation without sacrificing automation, at an affordable cost; Note: Nothing here is limited to Cartesian methods, and much becomes simpler in a body-fitted setting.

Wall Model↗

A Tutorial for Using the CGT Script Library to Generate and Assemble Overset Meshes

The purpose of this document is to introduce a new user to the procedures for overset CFD analysis by building scripts based on the CGT Script Library. Parameterized inputs are built into the steps of the process which include creation and manipulation of geometry, and surface and volume meshing. In preparation for performing computations in the flow solver, further steps are constructed for specification of inputs for domain connectivity, flow solver boundary conditions, and components for computation of aerodynamic forces/moments. The JCLV rocket will be used as an example geometry for this demonstration.

Script↗

Development of a Model Based Technique for Gear Diagnostics using the Wigner-Ville method

Imperfections in gear tooth geometry often result from errors in the manufacturing process or excessive material wear during operation. Such faults in the gear tooth geometry can result in large vibrations in the transmission system, and, in some cases, may lead to early failure of the gear transmission system. This report presents the study of the effects of imperfection in gear tooth geometry on the dynamic characteristics of a gear transmission system. The faults in the gear tooth geometry are modeled numerically as the deviation of the tooth profile from its original involute geometry. The changes in gear mesh stiffness due to various profile and pattern variations are evaluated numerically. The resulting changes in the mesh stiffness are incorporated into a computer code to simulate the dynamics of the gear transmission system. A parametric study is performed to examine the sensitivity of gear tooth geometry imperfections on the vibration of a gear transmission system. The parameters variations in this study consist of the magnitude of the imperfection, the pattern of the profile variation, and the total number of teeth affected. Numerical results from the dynamic simulations are examined in both the time and the frequency domains. A joint time-frequency analysis procedure using the Wigner-Ville Distribution is also introduced to identify the location of the damaged tooth from the vibration signature. Numerical simulations of the system dynamics with gear faults were compared to experimental results. An optimal tracker was introduced to quantify the level of damage in the gear mesh system. Conclusions are drawn from the results of this numerical study.

Choy, F.↗

Improvements to the LAURA Mesh Adaptation Algorithm

This paper describes recent improvements to the LAURA code that removes the requirementof unbroken body-normal lines when using the automated mesh adaptation algorithm inLAURA responsible for mesh alignment with shock and adjusting near-wall mesh spacing. Fornon-simple geometry, restricting block topologies such that blocks span the domain from thesurface wall boundaries to domain inflow boundary can be difficult or impossible. Removing thisrequirement enables novel block topologies that simplify the meshing workflow for LAURA users.The new adaptation algorithm implementation in LAURA is described and several examples ofthe adaptation are presented to demonstrate the efficacy of the adaptation algorithm.

LAURA↗

Improvements to the LAURA Mesh Adaptation Algorithm

This paper describes recent improvements to the LAURA code that removes the requirementof unbroken body-normal lines when using the automated mesh adaptation algorithm inLAURA responsible for mesh alignment with shock and adjusting near-wall mesh spacing. Fornon-simple geometry, restricting block topologies such that blocks span the domain from thesurface wall boundaries to domain inflow boundary can be difficult or impossible. Removing thisrequirement enables novel block topologies that simplify the meshing workflow for LAURA users.The new adaptation algorithm implementation in LAURA is described and several examples ofthe adaptation are presented to demonstrate the efficacy of the adaptation algorithm.

LAURA↗

Unstructured mesh generation and adaptivity

An overview of current unstructured mesh generation and adaptivity techniques is given. Basic building blocks taken from the field of computational geometry are first described. Various practical mesh generation techniques based on these algorithms are then constructed and illustrated with examples. Issues of adaptive meshing and stretched mesh generation for anisotropic problems are treated in subsequent sections. The presentation is organized in an education manner, for readers familiar with computational fluid dynamics, wishing to learn more about current unstructured mesh techniques.

Mavriplis, D. J.↗

Surface Generation and Cartesian Mesh Support

This document serves as the final report for the grant titled Surface Generation and Cartesian Mesh Support . This completed work was in algorithmic research into automatically generating surface triangulations from CAD geometries. NASA's OVERFLOW and Cart3D simulation packages use surface triangulations as an underlying geometry description and the ability to automatically generate these from CAD files (without translation) substantially reduces both the wall-clock time and expertise required to get geometry out of CAD and into mesh generation. This surface meshing was exercised greatly during the Shuttle investigation during the last year with success. The secondary efforts performed in this grant involve work on a visualization system cut-cell handling for Cartesian Meshes with embedded boundaries.

Haimes, Robert↗

AXAF VETA-I mirror encircled energy measurements and data reduction

The AXAF VETA-I mirror encircled energy was measured with a series of apertures and two flow gas proportional counters at five X-ray energies ranging from 0.28 to 2.3 keV. The proportional counter has a thin plastic window with an opaque wire mesh supporting grid. Depending on the counter position, this mesh can cause the X-ray transmission to vary as much as +/-9 percent, which directly translates into an error in the encircled energy. In order to correct this wire mesh effect, window scan measurements were made, in which the counter was scanned in both horizontal (Y) and vertical (Z) directions with the aperture fixed. Post VETA measurement of the VXDS setup were made to determine the exact geometry and position of the mesh grid. Computer models of the window mesh were developed to simulate the X-ray transmission based on this measurement. The window scan data were fitted to such mesh models and corrections were made. After this study, the mesh effect was well understood and the final results of the encircled energy were obtained with an uncertainty of less than 0.8 percent.

Zhao, Ping↗

AXAF VETA-I mirror encircled energy measurements and data reduction

The AXAF VETA-I mirror encircled energy was measured with a series of apertures and two flow gas proportional counters at five X-ray energies ranging from 0.28 to 2.3 keV. The proportional counter has a thin plastic window with an opaque wire mesh supporting grid. Depending on the counter position, this mesh can cause the X-ray transmission to vary as much as +/- 9 percent, which directly translates into an error in the encircled energy. In order to correct this wire mesh effect, window scan measurements were made, in which the counter was scanned in both horizontal (Y) and vertical (Z) directions with the aperture fixed. Post VETA measurement of the VXDS setup were made to determine the exact geometry and position of the mesh grid. Computer models of the window mesh were developed to simulate the X-ray transmission based on this measurement. The window scan data were fitted to such mesh models and corrections were made. After this study, the mesh effect was well understood and the final results of the encircled energy were obtained with an uncertainty of less than 0.8 percent.

Zhao, Ping↗

Two-dimensional mesh embedding for Galerkin B-spline methods

A number of advantages result from using B-splines as basis functions in a Galerkin method for solving partial differential equations. Among them are arbitrary order of accuracy and high resolution similar to that of compact schemes but without the aliasing error. This work develops another property, namely, the ability to treat semi-structured embedded or zonal meshes for two-dimensional geometries. This can drastically reduce the number of grid points in many applications. Both integer and non-integer refinement ratios are allowed. The report begins by developing an algorithm for choosing basis functions that yield the desired mesh resolution. These functions are suitable products of one-dimensional B-splines. Finally, test cases for linear scalar equations such as the Poisson and advection equation are presented. The scheme is conservative and has uniformly high order of accuracy throughout the domain.

Shariff, Karim↗

Near-field supersonic flow predictions by an adaptive unstructured tetrahedral grid solver

Applicability of a three-dimensional solution adaptive unstructured tetrahedral Euler flow solver about generic models for near-field sonic boom pressure signature predictions is evaluated. Comparisons of computational and experimental data demonstrates the capability of the method for predicting inviscid solutions useful for high speed calculations about simple 3-D geometries. The approach has promising features and results indicate potential for application to more complex configurations. The mesh generation is based on the advancing front technique, and steady state solutions of the Euler equations are achieved by explicit time integration. Spatial discretization uses the Taylor-Galerkin approach; an alternate time integration, based on the Runge-Kutta method, is also included. The solution-adaptive grid procedure is based on either remeshing or mesh refinement techniques. An alternative geometry-adaptive grid procedure has also been incorporated.

Djomehri, M. J.↗

Shape optimization of three-dimensional stamped and solid automotive components

The shape optimization of realistic, 3-D automotive components is discussed. The integration of the major parts of the total process: modeling, mesh generation, finite element and sensitivity analysis, and optimization are stressed. Stamped components and solid components are treated separately. For stamped parts a highly automated capability was developed. The problem description is based upon a parameterized boundary design element concept for the definition of the geometry. Automatic triangulation and adaptive mesh refinement are used to provide an automated analysis capability which requires only boundary data and takes into account sensitivity of the solution accuracy to boundary shape. For solid components a general extension of the 2-D boundary design element concept has not been achieved. In this case, the parameterized surface shape is provided using a generic modeling concept based upon isoparametric mapping patches which also serves as the mesh generator. Emphasis is placed upon the coupling of optimization with a commercially available finite element program. To do this it is necessary to modularize the program architecture and obtain shape design sensitivities using the material derivative approach so that only boundary solution data is needed.

Botkin, M. E.↗

Image Segmentation, Registration, Compression, and Matching

A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity/topology components of the generated models. The highly efficient triangular mesh compression compacts the connectivity information at the rate of 1.5-4 bits per vertex (on average for triangle meshes), while reducing the 3D geometry by 40-50 percent. Finally, taking into consideration the characteristics of 3D terrain data, and using the innovative, regularized binary decomposition mesh modeling, a multistage, pattern-drive modeling, and compression technique has been developed to provide an effective framework for compressing digital elevation model (DEM) surfaces, high-resolution aerial imagery, and other types of NASA data.

Yadegar, Jacob↗

Adaptive unstructured triangular mesh generation and flow solvers for the Navier-Stokes equations at high Reynolds number

A method for generating high quality unstructured triangular grids for high Reynolds number Navier-Stokes calculations about complex geometries is described. Careful attention is paid in the mesh generation process to resolving efficiently the disparate length scales which arise in these flows. First the surface mesh is constructed in a way which ensures that the geometry is faithfully represented. The volume mesh generation then proceeds in two phases thus allowing the viscous and inviscid regions of the flow to be meshed optimally. A solution-adaptive remeshing procedure which allows the mesh to adapt itself to flow features is also described. The procedure for tracking wakes and refinement criteria appropriate for shock detection are described. Although at present it has only been implemented in two dimensions, the grid generation process has been designed with the extension to three dimensions in mind. An implicit, higher-order, upwind method is also presented for computing compressible turbulent flows on these meshes. Two recently developed one-equation turbulence models have been implemented to simulate the effects of the fluid turbulence. Results for flow about a RAE 2822 airfoil and a Douglas three-element airfoil are presented which clearly show the improved resolution obtainable.

Ashford, Gregory A.↗

Large-Scale Parallel Unstructured Mesh Computations for 3D High-Lift Analysis

A complete "geometry to drag-polar" analysis capability for three-dimensional high-lift configurations is described. The approach is based on the use of unstructured meshes in order to enable rapid turnaround for complicated geometries which arise in high-lift configurations. Special attention is devoted to creating a capability for enabling analyses on highly resolved grids. Unstructured meshes of several million vertices are initially generated on a work-station, and subsequently refined on a supercomputer. The flow is solved on these refined meshes on large parallel computers using an unstructured agglomeration multigrid algorithm. Good prediction of lift and drag throughout the range of incidences is demonstrated on a transport take-off configuration using up to 24.7 million grid points. The feasibility of using this approach in a production environment on existing parallel machines is demonstrated, as well as the scalability of the solver on machines using up to 1450 processors.

Mavriplis, D. J.↗

Isoparametric 3-D Finite Element Mesh Generation Using Interactive Computer Graphics

An isoparametric 3-D finite element mesh generator was developed with direct interface to an interactive geometric modeler program called POLYGON. POLYGON defines the model geometry in terms of boundaries and mesh regions for the mesh generator. The mesh generator controls the mesh flow through the 2-dimensional spans of regions by using the topological data and defines the connectivity between regions. The program is menu driven and the user has a control of element density and biasing through the spans and can also apply boundary conditions, loads interactively.

Kayrak, C.↗

Large-Scale Parallel Unstructured Mesh Computations for 3D High-Lift Analysis

A complete "geometry to drag-polar" analysis capability for three-dimensional high-lift configurations is described. The approach is based on the use of unstructured meshes in order to enable rapid turnaround for complicated geometries which arise in high-lift con gurations. Special attention is devoted to creating a capability for enabling analyses on highly resolved grids. Unstructured meshes of several million vertices are initially generated on a work-station, and subsequently refined on a supercomputer. The flow is solved on these refined meshes on large parallel computers using an unstructured agglomeration multigrid algorithm. Good prediction of lift and drag throughout the range of incidences is demonstrated on a transport take-off configuration using up to 24.7 million grid points. The feasibility of using this approach in a production environment on existing parallel machines is demonstrated, as well as the scalability of the solver on machines using up to 1450 processors.

Mavriplis, D. J.↗