Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational geometry”

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 127 records · Page 7

Aircraft geometry verification with enhanced computer-generated displays

A method for visual verification of aerodynamic geometries using computer-generated, color-shaded images is described. The mathematical models representing aircraft geometries are created for use in theoretical aerodynamic analyses and in computer-aided manufacturing. The aerodynamic shapes are defined using parametric bi-cubic splined patches. This mathematical representation is then used as input to an algorithm that generates a color-shaded image of the geometry. A discussion of the techniques used in the mathematical representation of the geometry and in the rendering of the color-shaded display is presented. The results include examples of color-shaded displays, which are contrasted with wire-frame-type displays. The examples also show the use of mapped surface pressures in terms of color-shaded images of V/STOL fighter/attack aircraft and advanced turboprop aircraft.

Cozzolongo, J. V.↗

An approach for management of geometry data

The strategies for managing Integrated Programs for Aerospace Design (IPAD) computer-based geometry are described. The computer model of geometry is the basis for communication, manipulation, and analysis of shape information. IPAD's data base system makes this information available to all authorized departments in a company. A discussion of the data structures and algorithms required to support geometry in IPIP (IPAD's data base management system) is presented. Through the use of IPIP's data definition language, the structure of the geometry components is defined. The data manipulation language is the vehicle by which a user defines an instance of the geometry. The manipulation language also allows a user to edit, query, and manage the geometry. The selection of canonical forms is a very important part of the IPAD geometry. IPAD has a canonical form for each entity and provides transformations to alternate forms; in particular, IPAD will provide a transformation to the ANSI standard. The DBMS schemas required to support IPAD geometry are explained.

Dube, R. P.↗

Rapid Geometry Creation for Computer-Aided Engineering Parametric Analyses: A Case Study Using ComGeom2 for Launch Abort System Design

ComGeom2, a tool developed to generate Common Geometry representation for multidisciplinary analysis, has been used to create a large set of geometries for use in a design study requiring analysis by two computational codes. This paper describes the process used to generate the large number of configurations and suggests ways to further automate the process and make it more efficient for future studies. The design geometry for this study is the launch abort system of the NASA Crew Launch Vehicle.

Hawke, Veronica↗

An Efficient Algorithm for Mapping Imaging Data to 3D Unstructured Grids in Computational Biomechanics

Geometries for organ scale and multiscale simulations of organ function are now routinely derived from imaging data. However, medical images may also contain spatially heterogeneous information other than geometry that are relevant to such simulations either as initial conditions or in the form of model parameters. In this manuscript, we present an algorithm for the efficient and robust mapping of such data to imaging based unstructured polyhedral grids in parallel. We then illustrate the application of our mapping algorithm to three different mapping problems: 1) the mapping of MRI diffusion tensor data to an unstuctured ventricular grid; 2) the mapping of serial cyro-section histology data to an unstructured mouse brain grid; and 3) the mapping of CT-derived volumetric strain data to an unstructured multiscale lung grid. Execution times and parallel performance are reported for each case.

Einstein, Daniel R.↗

Design geometry and design/off-design performance computer codes for compressors and turbines

This report summarizes some NASA Lewis (i.e., government owned) computer codes capable of being used for airbreathing propulsion system studies to determine the design geometry and to predict the design/off-design performance of compressors and turbines. These are not CFD codes; velocity-diagram energy and continuity computations are performed fore and aft of the blade rows using meanline, spanline, or streamline analyses. Losses are provided by empirical methods. Both axial-flow and radial-flow configurations are included.

Glassman, Arthur J.↗

Evaluation and optimization of the performance of frame geometries for lithium-ion battery application by computer simulation

Tailoring battery geometries is essential for many applications, as geometry influences the delivered capacity value. Two geometries, frame and conventional, have been studied and, for a given scan rate of 330C, the square frame shows a capacity value of 305,52 Ahm{sup −2}, which is 527 times higher than the one for the conventional geometry for a constant the area of all components.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Taylor states in stellarators: A fast high-order boundary integral solver

We present a boundary integral equation solver for computing Taylor relaxed states in non-axisymmetric solid and shell-like toroidal geometries. The computation of Taylor states in these geometries is a key element for the calculation of stepped pressure stellarator equilibria. The integral representation of the magnetic field in this work is based on the generalized Debye source formulation, and results in a well-conditioned second-kind boundary integral equation. The integral equation solver is based on a spectral discretization of the geometry and unknowns, and the computation of the associated weakly-singular integrals is performed with high-order quadrature based on a partition of unity. The resulting scheme for applying the integral operator is then coupled with an iterative solver and suitable preconditioners. Several numerical examples are provided to demonstrate the accuracy and efficiency of our method, and a direct comparison with the leading code in the field is reported.

97 MATHEMATICS AND COMPUTING↗

Computational Icing Analysis on NASA’s SIDRM Geometry to Investigate Collection Efficiency

Computational icing analysis results were compared to experimental icing tunnel data including aerothermal (e.g. dry air) and supercooled water droplet rime-ice conditions from tests conducted in early 2022 at the NASA Icing Research Tunnel (IRT). The Simulated Intercompressor Duct Research Model (SIDRM) test article was used in this study, and its geometry represents the inter-compressor duct region of a turbofan engine. The test article’s purpose is to study the physics of supercooled water icing and ice crystal icing. This study compared three different icing codes: FENSAP-ICE (Eulerian approach), LEWICE3D (Lagrangian approach), and GlennICE (Lagrangian approach). All three icing codes were conducted on SIDRM’s complex body flow-field and compared to different experimental supercooled water rime runs. The test article instrumentation (pressure taps, thermocouples, etc.) and 3D laser scans of final ice shapes were used to compare against the different icing code simulations. The overall objectives are to understand how the icing codes handle capturing collection efficiency on the complex test article’s unheated surfaces. In the aerothermal cases, pressure tap readings matched the CFD results, but dry air CFD underpredicted thermocouple readings. Collection efficiency results from all three icing codes matched well together on the main body leading edge, main body slope, and the strut leading edges. All three icing codes underpredicted the final ice shape using a single-shot constant ice density approach, with more difficulty coming from the strut leading edge ice shape due to the swept wing like flow field. NASA’s overall goal for this effort is to develop computational icing tools to assist in the design and certification of engines for flight in icing conditions.

Supercooled icing, SIDRM, aerodynamics, computatio↗

AFE base flow computations

Hypersonic wake flows behind the Aeroassist Flight Experiment (AFE) geometry are analyzed using two Navier-Stokes flow solvers. Many of the AFE wake features observed in ballistic-range shadowgraphs are simulated using a simple, two-dimensional semicylinder geometry at moderate angles of attack. At free-stream conditions corresponding to a Hypersonic Free Flight Facility (HFFF) AFE experiment, the three-dimensional base flow for the AFE geometry is computed using an ideal-gas, Navier-Stokes solver. The computed results agree reasonably well with the shadowgraphs taken at the HFFF. An ideal-gas and a nonequilibrium Navier-Stokes solver have been coupled and applied to the complete flow around the AFE vehicle at the free-stream conditions corresponding to a nomial trajectory point. Limitations of the coupled ideal-gas and nonequilibrium solution are discussed. The nonequilibrium base flow solution is analyzed for the wake radiation and the radiation profiles along various lines of sight are compared. Finally, the wake unsteadiness is predicted using experimental correlations and the numerical solutions. An adaptive grid code, SAGE, has been used in all the simulations to enhance the solution accuracy. The grid adaptation is found to be necessary in obtaining base flow solutions with accurate flow features.

Venkatapathy, Ethiraj↗

The design and fabrication of two portal vein flow phantoms by different methods

Purpose: This study outlines the design and fabrication techniques for two portal vein flow phantoms. Methods: A materials study was performed as a precursor to this phantom fabrication effort and the desired material properties are restated for continuity. A three-dimensional portal vein pattern was created from the Visual Human database. The portal vein pattern was used to fabricate two flow phantoms by different methods with identical interior surface geometry using computer aided design software tools and rapid prototyping techniques. One portal flow phantom was fabricated within a solid block of clear silicone for use on a table with Ultrasound or within medical imaging systems such as MRI, CT, PET, or SPECT. The other portal flow phantom was fabricated as a thin walled tubular latex structure for use in water tanks with Ultrasound imaging. Both phantoms were evaluated for usability and durability. Results: Both phantoms were fabricated successfully and passed durability criteria for flow testing in the next project phase. Conclusions: The fabrication methods and materials employed for the study yielded durable portal vein phantoms.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing with many challenging associated problems. Hex meshes vary from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges be adjacent to four hexes each. Edges failing this criteria are singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. Hex meshes with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. In conclusion, with this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.

97 MATHEMATICS AND COMPUTING↗

Scalable Contour Tree Computation by Data Parallel Peak Pruning

As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Furthermore, we report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lg t) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.

97 MATHEMATICS AND COMPUTING↗

11.5 micron emission from smokes computed using finite cloud geometry

This study presents the infrared radiative transport properties of smoke produced by brush fires under conditions when the smoke is confined to a finite horizontal area and the usual plane parallel model for radiative transfer in an absorbing and scattering medium may not be valid. The transport model is a three-dimensional version of the two-stream approximation applied to finite cuboidal clouds of water, carbon and silicates with known optical properties; assumptions are made regarding the particle size distribution of the polydispersion.

Harshvardhan, MR.↗

Improving Ligand Geometry in Protein Data Bank Structures Computationally

Information about the three‐dimensional structures of complex biological molecules is an indispensable research tool for many fields of study, including biology, chemistry, pharmacology, and computer science. The Protein Data Bank (PDB) is an public digital archive providing access to structures of nucleic acids, proteins, and large macromolecular machines determined experimentally by X‐ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, and 3‐dimensional electron microscopy (3DEM). PDB structures undergo validation for structural plausibility upon their deposition into the PDB using the program Mogul, which cross references each deposited structure against similar data in the Cambridge Structural Database (CSD). Ligands associated with PDB structures are a common source of structural inaccuracy. In this study, a programmatic pipeline was developed to determine if ligand geometric accuracy could be improved using known computational tools. Ligands with dubious geometry were identified through a Python mining code. A sample set of the identified structures was remodeled into minimum energy conformations using the molecular dynamics program AMBER and then fit to the original experimental density maps using the molecular modeling program Coot. The refined models were compared to the original models in the PDB as well as to similar structures in the CSD using the deposition statistical validation server. Preliminary results suggest that the pipeline effectively identifies and improves ligand structures that possess inaccurate geometry. This method can be used to evaluate and improve the accuracy of specific ligands in structures both archived and pending deposition. Support or Funding Information This work was supported by an NSF REU and the RCSB PDB [NSF (DBI‐1338415), NIH, and DOE.] This abstract is from the Experimental Biology 2019 Meeting. There is no full text article associated with this abstract published in The FASEB Journal .

Miller, Beck↗