Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh Topology”

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 19 records

Integrated Design Engineering Analysis (IDEA) Environment Automated Generation of Structured CFD Grids using Topology Methods

This report documents the work performed from March 2010 to March 2012. The Integrated Design and Engineering Analysis (IDEA) environment is a collaborative environment based on an object-oriented, multidisciplinary, distributed framework using the Adaptive Modeling Language (AML) as a framework and supporting the configuration design and parametric CFD grid generation. This report will focus on describing the work in the area of parametric CFD grid generation using novel concepts for defining the interaction between the mesh topology and the geometry in such a way as to separate the mesh topology from the geometric topology while maintaining the link between the mesh topology and the actual geometry.

Kamhawi, Hilmi N.↗

Finite octree meshing through topologically driven geometric operators

The octree technique is developed into the finite octree, and an overview is given. Modeler requirements are given. The octree discretization is discussed along with geometric communication operators. Geometric communication operators returning topological associativity and geometric communication operators returning spatial data are also discussed and illustrated. The advantages are given of the boundary representation and of geometric communication operators. The implementation plays an important role in the integration with a variety of geometric modelers. The capabilities of closed loop processes within a complete finite element system are presented.

Grice, Kurt R.↗

Discrete Data Transfer Technique for Fluid-Structure Interaction

This paper presents a general three-dimensional algorithm for data transfer between dissimilar meshes. The algorithm is suitable for applications of fluid-structure interaction and other high-fidelity multidisciplinary analysis and optimization. Because the algorithm is independent of the mesh topology, we can treat structured and unstructured meshes in the same manner. The algorithm is fast and accurate for transfer of scalar or vector fields between dissimilar surface meshes. The algorithm is also applicable for the integration of a scalar field (e.g., coefficients of pressure) on one mesh and injection of the resulting vectors (e.g., force vectors) onto another mesh. The author has implemented the algorithm in a C++ computer code. This paper contains a complete formulation of the algorithm with a few selected results.

Samareh, Jamshid A.↗

Ground signature extrapolation of three-dimensional near-field CFD predictions for several HSCT configurations

A CFD analysis of the near-field sonic boom environment of several low boom High Speed Civilian Transport (HSCT) concepts is presented. The CFD method utilizes a multi-block Euler marching code within the context of an innovative mesh topology that allows for the resolution of shock waves several body lengths from the aircraft. Three-dimensional pressure footprints at one body length below three-different low boom aircraft concepts are presented. Models of two concepts designed by NASA to cruise at Mach 2 and Mach 3 were built and tested in the wind tunnel. The third concept was designed by Boeing to cruise at Mach 1.7. Centerline and sideline samples of these footprints are then extrapolated to the ground using a linear waveform parameter method to estimate the ground signatures or sonic boom ground overpressure levels. The Mach 2 concept achieved its centerline design signature but indicated higher sideline booms due to the outboard wing crank of the configuration. Nacelles are also included on two of NASA's low boom concepts. Computations are carried out for both flow-through nacelles and nacelles with engine exhaust simulation. The flow-through nacelles with the assumption of zero spillage and zero inlet lip radius showed very little effect on the sonic boom signatures. On the other hand, it was shown that the engine exhaust plumes can have an effect on the levels of overpressure reaching the ground depending on the engine operating conditions. The results of this study indicate that engine integration into a low boom design should be given some attention.

Siclari, M. J.↗

A User's Manual for ROTTILT Solver: Tiltrotor Fountain Flow Field Prediction

A CFD solver has been developed to provide the time averaged details of the fountain flow typical for tiltrotor aircraft in hover. This Navier-Stokes solver, designated as ROTTILT, assumes the 3-D fountain flowfield to be steady and incompressible. The theoretical background is described in this manual. In order to enable the rotor trim solution in the presence of tiltrotor aircraft components such as wing, nacelle, and fuselage, the solver is coupled with a set of trim routines which are highly efficient in CPU and suitable for CFD analysis. The Cartesian grid technique utilized provides the user with a unique capability for insertion or elimination of any components of the bodies considered for a given tiltrotor aircraft configuration. The flowfield associated with either a semi or full-span configuration can be computed through user options in the ROTTILT input file. Full details associated with the numerical solution implemented in ROTTILT and assumptions are presented. A description of input surface mesh topology is provided in the appendices along with a listing of all preprocessor programs. Input variable definitions and default values are provided for the V22 aircraft. Limited predicted results using the coupled ROTTILT/WOPWOP program for the V22 in hover are made and compared with measurement. To visualize the V22 aircraft and predictions, a preprocessor graphics program GNU-PLOT3D was used. This program is described and example graphic results presented.

Tadghighi, Hormoz↗

A Geometry Based Infra-Structure for Computational Analysis and Design

The computational steps traditionally taken for most engineering analysis suites (computational fluid dynamics (CFD), structural analysis, heat transfer and etc.) are: (1) Surface Generation -- usually by employing a Computer Assisted Design (CAD) system; (2) Grid Generation -- preparing the volume for the simulation; (3) Flow Solver -- producing the results at the specified operational point; (4) Post-processing Visualization -- interactively attempting to understand the results. For structural analysis, integrated systems can be obtained from a number of commercial vendors. These vendors couple directly to a number of CAD systems and are executed from within the CAD Graphical User Interface (GUI). It should be noted that the structural analysis problem is more tractable than CFD; there are fewer mesh topologies used and the grids are not as fine (this problem space does not have the length scaling issues of fluids). For CFD, these steps have worked well in the past for simple steady-state simulations at the expense of much user interaction. The data was transmitted between phases via files. In most cases, the output from a CAD system could go to Initial Graphics Exchange Specification (IGES) or Standard Exchange Program (STEP) files. The output from Grid Generators and Solvers do not really have standards though there are a couple of file formats that can be used for a subset of the gridding (i.e. PLOT3D data formats). The user would have to patch up the data or translate from one format to another to move to the next step. Sometimes this could take days. Specifically the problems with this procedure are:(1) File based -- Information flows from one step to the next via data files with formats specified for that procedure. File standards, when they exist, are wholly inadequate. For example, geometry from CAD systems (transmitted via IGES files) is defined as disjoint surfaces and curves (as well as masses of other information of no interest for the Grid Generator). This is particularly onerous for modern CAD systems based on solid modeling. The part was a proper solid and in the translation to IGES has lost this important characteristic. STEP is another standard for CAD data that exists and supports the concept of a solid. The problem with STEP is that a solid modeling geometry kernel is required to query and manipulate the data within this type of file. (2) 'Good' Geometry. A bottleneck in getting results from a solver is the construction of proper geometry to be fed to the grid generator. With 'good' geometry a grid can be constructed in tens of minutes (even with a complex configuration) using unstructured techniques. Adroit multi-block methods are not far behind. This means that a million node steady-state solution can be computed on the order of hours (using current high performance computers) starting from this 'good' geometry. Unfortunately, the geometry usually transmitted from the CAD system is not 'good' in the grid generator sense. The grid generator needs smooth closed solid geometry. It can take a week (or more) of interaction with the CAD output (sometimes by hand) before the process can begin. One way Communication. (3) One-way Communication -- All information travels on from one phase to the next. This makes procedures like node adaptation difficult when attempting to add or move nodes that sit on bounding surfaces (when the actual surface data has been lost after the grid generation phase). Until this process can be automated, more complex problems such as multi-disciplinary analysis or using the above procedure for design becomes prohibitive. There is also no way to easily deal with this system in a modular manner. One can only replace the grid generator, for example, if the software reads and writes the same files. Instead of the serial approach to analysis as described above, CAPRI takes a geometry centric approach. This makes the actual geometry (not a discretized version) accessible to all phases of the analysis. The connection to the geometry is made through an Application Programming Interface (API) and NOT a file system. This API isolates the top-level applications (grid generators, solvers and visualization components) from the geometry engine. Also this allows the replacement of one geometry kernel with another, without effecting these top-level applications. For example, if UniGraphics is used as the CAD package then Parasolid (UG's own geometry engine) can be used for all geometric queries so that no solid geometry information is lost in a translation. This is much better than STEP because when the data is queried, the same software is executed as used in the CAD system. Therefore, one analyzes the exact part that is in the CAD system. CAPRI uses the same idea as the commercial structural analysis codes but does not specify control. Software components of the CAD system are used, but the analysis suite, not the CAD operator, specifies the control of the software session. This also means that the license issues (may be) minimized and individuals need not have to know how to operate a CAD system in order to run the suite.

Haimes, Robert↗

CAPRI: Using a Geometric Foundation for Computational Analysis and Design

CAPRI (Computational Analysis Programming Interface) is a software development tool intended to make computerized design, simulation and analysis faster and more efficient. The computational steps traditionally taken for most engineering analysis (Computational Fluid Dynamics (CFD), structural analysis, etc.) are: Surface Generation, usually by employing a Computer Aided Design (CAD) system; Grid Generation, preparing the volume for the simulation; Flow Solver, producing the results at the specified operational point; Post-processing Visualization, interactively attempting to understand the results. It should be noted that the structures problem is more tractable than CFD; there are fewer mesh topologies used and the grids are not as fine (this problem space does not have the length scaling issues of fluids). For CFD, these steps have worked well in the past for simple steady-state simulations at the expense of much user interaction. The data was transmitted between phases via files. In most cases, the output from a CAD system could go IGES files. The output from Grid Generators and Solvers do not really have standards though there are a couple of file formats that can be used for a subset of the gridding (i.e. PLOT3D) data formats and the upcoming CGNS). The user would have to patch up the data or translate from one format to another to move to the next step. Sometimes this could take days. Instead of the serial approach to analysis, CAPRI takes a geometry centric approach. CAPRI is a software building tool-kit that refers to two ideas: (1) A simplified, object-oriented, hierarchical view of a solid part integrating both geometry and topology definitions, and (2) programming access to this part or assembly and any attached data. The connection to the geometry is made through an Application Programming Interface (API) and not a file system.

Haimes, Robert↗

Spatial Convergence of Three Dimensional Turbulent Flows

Finite-volume and finite-element schemes, both implemented within the FUN3D flow solver, are evaluated for several test cases described on the Turbulence-Modeling Resource (TMR) web site. The cases include subsonic flow over a hemisphere cylinder, subsonic flow over a swept bump configuration, and supersonic flow in a square duct. The finite- volume and finite-element schemes are both used to obtain solutions for the first two cases, whereas only the finite-volume scheme is used for the supersonic duct. For the hemisphere cylinder, finite-element solutions obtained on tetrahedral meshes are compared with finite- volume solutions on mixed-element meshes. For the swept bump, finite-volume solutions have been obtained for both hexahedral and tetrahedral meshes and are compared with finite-element solutions obtained on tetrahedral meshes. For the hemisphere cylinder and the swept bump, solutions are obtained on a series of meshes with varying grid density and comparisons are made between drag coefficients, pressure distributions, velocity profiles, and profiles of the turbulence working variable. The square duct shows small variation due to element type or the spatial accuracy of turbulence model convection. It is demonstrated that the finite-element scheme on tetrahedral meshes yields similar accuracy as the finite- volume scheme on mixed-element and hexahedral grids, and demonstrates less sensitivity to the mesh topology (biased tetrahedral grids) than the finite-volume scheme.

Park, Michael A.↗

Numerical simulation of backward step and jet exhaust flows

Preparatory to a continuing study of efficient, high resolution flow structure capture on patched mesh systems, turbulent flowfield solutions for a tactical missile base flow problem are computed on two first level composite grids of differing topologies. One mesh is of the wraparound character and the other is a step mesh on the Cartesian topology. A simplified Baldwin-Lomax algebraic eddy viscosity model is applied in the wake region. Results for the two meshes are compared with each other and with other computations reported in the literature. The totality of results suggest both mesh topology and resolution are important factors in the accuracy of predictive results as well as turbulence modeling. Related to interests in high altitude laminar flows bluff bodies such as the AOTV, the paper also presents results from a solution from laminar flow over a backward facing step and makes comparison with the available classical experiment of Chapman, et al.

Lombard, C. K.↗

Optimized testing of meshes

Efficient testing techniques for two-dimensional mesh interconnection networks are presented. The tests cover faults in the arbitration logic of the switches; this includes an examination of fault detection in the data paths, routing, and control circuitry, including the conflict resolution capabilities of mesh interconnection networks using topological test methods. The proposed methods are not implementation specific and can be applied to any design with a mesh topology. The topology and behavior of the network are described and definitions are presented. The fault model is defined and parallel testing methods for the entire network are given.

Malek, Miroslaw↗

Emerging CFD technologies and aerospace vehicle design

With the recent focus on the needs of design and applications CFD, research groups have begun to address the traditional bottlenecks of grid generation and surface modeling. Now, a host of emerging technologies promise to shortcut or dramatically simplify the simulation process. This paper discusses the current status of these emerging technologies. It will argue that some tools are already available which can have positive impact on portions of the design cycle. However, in most cases, these tools need to be integrated into specific engineering systems and process cycles to be used effectively. The rapidly maturing status of unstructured and Cartesian approaches for inviscid simulations makes suggests the possibility of highly automated Euler-boundary layer simulations with application to loads estimation and even preliminary design. Similarly, technology is available to link block structured mesh generation algorithms with topology libraries to avoid tedious re-meshing of topologically similar configurations. Work in algorithmic based auto-blocking suggests that domain decomposition and point placement operations in multi-block mesh generation may be properly posed as problems in Computational Geometry, and following this approach may lead to robust algorithmic processes for automatic mesh generation.

Aftosmis, Michael J.↗

On numerically accurate finite element

A general criterion for testing a mesh with topologically similar repeat units is given, and the analysis shows that only a few conventional element types and arrangements are, or can be made suitable for computations in the fully plastic range. Further, a new variational principle, which can easily and simply be incorporated into an existing finite element program, is presented. This allows accurate computations to be made even for element designs that would not normally be suitable. Numerical results are given for three plane strain problems, namely pure bending of a beam, a thick-walled tube under pressure, and a deep double edge cracked tensile specimen. The effects of various element designs and of the new variational procedure are illustrated. Elastic-plastic computation at finite strain are discussed.

Nagtegaal, J. C.↗

On numerically accurate finite element solutions in the fully plastic range

A general criterion for testing a mesh with topologically similar repeat units is given, and it is shown that only a few conventional element types and arrangements are suitable for computations in the fully plastic range. Further, a new variational principle, which can easily be incorporated into an existing finite element program, is presented. This makes it possible to perform accurate computations even for element designs that would not normally be suitable. An appendix extends the discussion to elastic-plastic computation at finite strain.

Nagtegaal, J. C.↗

The Loci Multidisciplinary Simulation System

Contents include the following: 1. An overview of the Loci Multidisciplinary Simulation System. 2. Topologically adaptive mesh generation. 3. Multidisciplinary simulations using Loci with the CHEM chemically reacting flow solver.

Luke, Ed↗

Topological numbering of features on a mesh

Assume a nxn binary image is given containing horizontally convex features; i.e., for each feature, each of its row's pixels form an interval on that row. The problem of assigning topological numbers to such features is considered; i.e., assign a number to every feature f so that all features to the left of f have a smaller number assigned to them. This problem arises in solutions to the stereo matching problem. A parallel algorithm to solve the topological numbering problem in O(n) time on an nxn mesh of processors is presented. The key idea of the solution is to create a tree from which the topological numbers can be obtained even though the tree does not uniquely represent the to the left of relationship of the features.

Atallah, Mikhail J.↗

Automatic Mesh Generation of Hybrid Mesh on Valves in Multiple Positions in Feedline Systems

Fluid flow simulations through a valve often require evaluation of the valve in multiple opening positions. A mesh has to be generated for the valve for each position and compounding. The problem is the fact that the valve is typically part of a larger feedline system. In this paper, we propose to develop a system to create meshes for feedline systems with parametrically controlled valve openings. Herein we outline two approaches to generate the meshes for a valve in a feedline system at multiple positions. There are two issues that must be addressed. The first is the creation of the mesh on the valve for multiple positions. The second is the generation of the mesh for the total feedline system including the valve. For generation of the mesh on the valve, we will describe the use of topology matching and mesh generation parameter transfer. For generation of the total feedline system, we will describe two solutions that we have implemented. In both cases the valve is treated as a component in the feedline system. In the first method the geometry of the valve in the feedline system is replaced with a valve at a different opening position. Geometry is created to connect the valve to the feedline system. Then topology for the valve is created and the portion of the topology for the valve is topology matched to the standard valve in a different position. The mesh generation parameters are transferred and then the volume mesh for the whole feedline system is generated. The second method enables the user to generate the volume mesh on the valve in multiple open positions external to the feedline system, to insert it into the volume mesh of the feedline system, and to reduce the amount of computer time required for mesh generation because only two small volume meshes connecting the valve to the feedline mesh need to be updated.

Ross, Douglass H.↗

Geometrical and topological issues in octree based automatic meshing

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is discussed. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary representation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractor. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Saxena, Mukul↗

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↗