Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 55 records · Page 3

A Geometry-Driven Longitudal Topic Model

A simple and scalable framework for longitudinal analysis of Twitter data is developed that combines latent topic models with computational geometric methods. Dimensionality reduction tools from computational geometry are applied to learn the intrinsic manifold on which the latent, temporal topics reside. Then shortest path distances on the manifold are used to link together these topics. The proposed framework permits visualization of the low-dimensional embedding which provides clear interpretation of the complex, high-dimensional trajectories that may exist among latent topics. Practical application of the proposed framework is demonstrated through its ability to capture and effectively visualize natural progression of latent COVID-19 related topics learned from Twitter data. Interpretability of the trajectories is achieved by comparing to real-world events. In addition, the framework permits study of spatial variation in Twitter behavior for learned topics. The analysis demonstrates that the proposed framework is able to capture granular-level impact of COVID-19 on public discussions. We end by arguing that Twitter data, when analyzed within the proposed framework, can serve as a valuable supplementary data stream for COVID-related studies.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Computed and Experimental Flowfields of the RAH-66 Helicopter

This paper compares and evaluates numerical and experimental flowfields of the RAH-66 Comanche helicopter. The numerical predictions were obtained by solving the Thin-Layer Navier-Stokes equations. The computations use actuator disks to investigate the main and tail rotor effects upon the fuselage flowfield. The wind tunnel experiment was performed in the 14 x 22 foot facility located at NASA Langley. A suite of flow conditions, rotor thrusts and fuselage-rotor-tail configurations were tested. In addition, the tunnel model and the computational geometry were based upon the same CAD definition. Computations were performed for an isolated fuselage configuration and for a rotor on configuration. Comparisons between the measured and computed surface pressures show areas of correlation and some discrepancies. Local areas of poor computational grid-quality and local areas of geometry differences account for the differences. These calculations demonstrate the use of advanced computational fluid dynamic methodologies towards a flight vehicle currently under development. It serves as an important verification for future computed results.

vanDam, C. P.↗

An extension to V ORO ++ for multithreaded computation of Voronoi cells

V ORO ++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. V ORO ++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that it can achieve parallel efficiencies greater than 95% in many cases. Further, the multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million particles.

97 MATHEMATICS AND COMPUTING↗

High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets: N-body simulations, molecular dynamics codes, and LIDAR point clouds are just a few examples. Such computational geometry methods are common in data analysis and visualization; but as the scale of simulations and observations surpasses billions of particles, the existing serial and shared-memory algorithms no longer suffice. A distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this paper is a new parallel Delaunay and Voronoi tessellation algorithm that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include periodic and wall boundary conditions, comparison of our method using two popular serial libraries, and application to numerous science datasets.

97 MATHEMATICS AND COMPUTING↗

An Upgrade of the Aeroheating Software ''MINIVER''

Detailed computational modeling: CFO often used to create and execute computational domains. Increasing complexity when moving from 20 to 30 geometries. Computational time increased as finer grids are used (accuracy). Strong tool, but takes time to set up and run. MINIVER: Uses theoretical and empirical correlations. Orders of magnitude faster to set up and run. Not as accurate as CFO, but gives reasonable estimations. MINIVER's Drawbacks: Rigid command-line interface. Lackluster, unorganized documentation. No central control; multiple versions exist and have diverged.

Louderback, Pierce↗

Heat transfer and material flow during laser assisted multi-layer additive manufacturing

A three-dimensional, transient, heat transfer, and fluid flow model is developed for the laser assisted multilayer additive manufacturing process with coaxially fed austenitic stainless steel powder. Heat transfer between the laser beam and the powder particles is considered both during their flight between the nozzle and the growth surface and after they deposit on the surface. The geometry of the build layer obtained from independent experiments is compared with that obtained from the model. The spatial variation of melt geometry, cooling rate, and peak temperatures is examined in various layers. The computed cooling rates and solidification parameters are used to estimate the cell spacings and hardness in various layers of the structure. Good agreement is achieved between the computed geometry, cell spacings, and hardness with the corresponding independent experimental results.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient Delaunay Tessellation through K-D Tree Decomposition

Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly distribute points among processes and compare two strategies for picking split points between domain regions. Because resulting point distributions no longer satisfy the assumptions of existing parallel Delaunay algorithms, we develop a new parallel algorithm that adapts to its input and prove its correctness. We evaluate the new algorithm using two late-stage cosmology datasets. The new running times are up to 50 times faster using k-d tree compared with regular grid decomposition. Moreover, in the unbalanced data sets, decomposing the domain into a k-d tree is up to five times faster than decomposing it into a regular grid.

Morozov, Dmitriy↗

Geometric model and analysis of rod-like large space structures

The application of geometrical schemes to large sphere antenna reflectors was investigated. The purpose of these studies is to determine the shape and size of flat segmented surfaces which approximate general shells of revolution and in particular spherical and paraboloidal reflective surfaces. The extensive mathematical and computational geometry analyses of the reflector resulted in the development of a general purpose computer program. This program is capable of generating the complete design parameters of the dish and can meet stringent accuracy requirements. The computer program also includes a graphical self contained subroutine which graphically displays the required design.

Nayfeh, A. H.↗

A spectral metric for collider geometry

By quantifying the distance between two collider events, one can triangulate a metric space and reframe collider data analysis as computational geometry. One popular geometric approach is to first represent events as an energy flow on an idealized celestial sphere and then define the metric in terms of optimal transport in two dimensions. In this paper, we advocate for representing events in terms of a spectral function that encodes pairwise particle angles and products of particle energies, which enables a metric distance defined in terms of one-dimensional optimal transport. This approach has the advantage of automatically incorporating obvious isometries of the data, like rotations about the colliding beam axis. It also facilitates first-principles calculations, since there are simple closed-form expressions for optimal transport in one dimension. Up to isometries and event sets of measure zero, the spectral representation is unique, so the metric on the space of spectral functions is a metric on the space of events. At lowest order in perturbation theory in electron-positron collisions, our metric is simply the summed squared invariant masses of the two event hemispheres. Going to higher orders, we present predictions for the distribution of metric distances between jets in fixed-order and resummed perturbation theory as well as in parton-shower generators. Finally, we speculate on whether the spectral approach could furnish a useful metric on the space of quantum field theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗

High-Resolution X-Ray and Neutron Computed Tomography of an Engine Combustion Network Spray G Gasoline Injector

Given the importance of the fuel-injection process on the combustion and emissions performance of gasoline direct injected engines, there has been significant recent interest in understanding the fluid dynamics within the injector, particularly around the needle and through the nozzles. Furthermore, the pressure losses and transients that occur in the flow passages above the needle are also of interest. Simulations of these injectors typically use the nominal design geometry, which does not always match the production geometry. Computed tomography (CT) using x-ray and neutron sources can be used to obtain the real geometry from production injectors, but there are trade-offs in using these techniques. X-ray CT provides high resolution, but cannot penetrate through the thicker parts of the injector. Neutron CT has excellent penetrating power but lower resolution. Here, we present results from a joint effort to characterize a gasoline direct injector representative of the Spray G injector as defined by the Engine Combustion Network. High-resolution (1.2 to 3 µm) x-ray CT measurements from the Advanced Photon Source at Argonne National Laboratory were combined with moderate-resolution (40 µm) neutron CT measurements from the High Flux Isotope Reactor at Oak Ridge National Laboratory to generate a complete internal geometry for the injector. This effort combined the strengths of both facilities’ capabilities, with extremely fine spatially resolved features in the nozzles and injector tips and fine resolution of internal features of the needle along the length of injector. Analysis of the resulting surface model of the internal fluid flow volumes of the injector reveals how the internal cross-sectional area and nozzle hole geometry differs slightly from the design dimensions. A simplified numerical simulation of the internal flow shows how deviations from the design geometry can alter the flow inside the sac and holes. Our results of this study will provide computational modelers with very accurate solid and surface models for use in computational fluid dynamics studies and experimentalists with increased insight into the operating characteristics of their injectors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Preliminary Assessment of Step Effects on the BOLT Geometry in Mach 6 Flow

An infrared thermography measurement technique has been installed in the Langley Aerothermodynamic Laboratory. The system is calibrated for use with commercially available thermoplastics and ceramic materials, and to the surface temperature ranges when exposed to the facility hypersonic flow. Herein an uncertainty quantification is performed, revealing 5% surface temperature and 20% heat transfer uncertainty bands to two-sigma confidence. As a first application of the test measurement technique, an investigation was conducted to explore the correlation between the height of forward facing (FF) and rearward facing (RF) two-dimensional steps, free stream Reynolds number, and the onset of boundary layer transition from laminar to turbulent in Mach 6 flow on a 50% scale Boundary Layer Transition (BOLT) flight test vehicle geometry. Computational predictions were generated to identify potential x/L locations of transition onset for various flow conditions with a smooth outer mold line geometry and are compared to experimental results. The BOLT Step Test was conducted in the NASA Langley Aerothermodynamic Laboratory 20-inch Mach 6 wind tunnel at Reynolds numbers between 1.4 and 11.3 million conditions for various step heights. Data were collected using a developmental infrared thermography test technique and reduced to heat transfer for comparison with CFD solutions. This is a preliminary assessment of the developmental infrared thermography test technique used to acquire and reduce the experimental data. insight into the ongoing comparative analysis of the effects of FF and RF steps on boundary layer transition for the BOLT geometry in Mach 6 flow.

BOLT↗

A Preliminary Assessment of Step Effects on the BOLT Geometry in Mach 6 Flow

An infrared thermography measurement technique has been installed in the Langley Aerothermodynamic Laboratory. The system is calibrated for use with commercially available thermoplastics and ceramic materials, and to the surface temperature ranges when exposed to the facility hypersonic flow. Herein an uncertainty quantification is performed, revealing 5% surface temperature and 20% heat transfer uncertainty bands to two-sigma confidence. As a first application of the test measurement technique, an investigation was conducted to explore the correlation between the height of forward facing (FF) and rearward facing (RF) two-dimensional steps, free stream Reynolds number, and the onset of boundary layer transition from laminar to turbulent in Mach 6 flow on a 50% scale Boundary Layer Transition (BOLT) flight test vehicle geometry. Computational predictions were generated to identify potential x/L locations of transition onset for various flow conditions with a smooth outer mold line geometry and are compared to experimental results. The BOLT Step Test was conducted in the NASA Langley Aerothermodynamic Laboratory 20-inch Mach 6 wind tunnel at Reynolds numbers between 1.4 and 11.3 million conditions for various step heights. Data were collected using a developmental infrared thermography test technique and reduced to heat transfer for comparison with CFD solutions. This is a preliminary assessment of the developmental infrared thermography test technique used to acquire and reduce the experimental data. insight into the ongoing comparative analysis of the effects of FF and RF steps on boundary layer transition for the BOLT geometry in Mach 6 flow.

BOLT↗

GASP- General Aviation Synthesis Program. Volume 2: Geometry

The gross characteristics of an aircraft under study are specified to the subroutines SIZE. The principal quantities specified are both geometric (lengths and areas) and operational (altitude and Mach number). The sequence of computations carried out by SIZE is controlled by the parameter NPC which is passed into SIZE by COMMON. When NPC-0, the computation is initialized. Subsequently, NPC is set to 2 and the program advances through the geometric computations. Geometry models for the fuselage, wing, empennage, cabin pressurization, and nacelle area are examined.

Hague, D.↗

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.

Memarsadeghi, Nargess↗

Comparison of nested geometry treatments within GPU-based Monte Carlo neutron transport simulations of fission reactors

Monte Carlo (MC) neutron transport provides detailed estimates of radiological quantities within fission reactors. This involves tracking individual neutrons through a computational geometry. CPU-based MC codes use multiple polymorphic tracker types with different tracking algorithms to exploit the repeated configurations of reactors, but virtual function calls have high overhead on the GPU. The Shift MC code was modified to support GPU-based tracking with three strategies: dynamic polymorphism with virtual functions, static polymorphism, and a single tracker type with tree-based acceleration. On the Frontier supercomputer these methods achieve 77.8%, 91.2%, and 83.4%, respectively, of the tracking rate obtained using a specialized tracker optimized for rectilinear-grid-based reactors. This indicates that all three methods are suitable for typical reactor problems in which tracking does not dominate runtime. The flexibility of the single tracker method is highlighted with a hexagonal-grid microreactor problem, performed without hexagonal-grid-specific tracking routines, providing a 2.19× speedup over CPU execution.

97 MATHEMATICS AND COMPUTING↗

On the Interaction of CO and NH3 with BH3 and BF3

BH3CO, BF3CO, BH3NH3, and BF3NH3 have been studied using density functional theory (DFT). The computed geometries are in reasonable agreement with experiment. BF3CO is found to be weakly bound. The binding energies of BH3CO, BH3NH3 , and BF3NH3 have also been computed using the coupled cluster singles and doubles level of theory, including a perturbational estimate of the connected triples [CCSD(T)]. These CCSD(T) calculations are performed using correlation consistent polarized-valence triple-zeta basis sets. These are expected to be the most accurate binding energies to date. The DFT binding energies are in good agreement with those obtained at the CCSD(T) level. The bonding is analyzed using the constrained space orbital variation (CSOV) technique. In addition to analyzing the bonding in BH3CO, BH3NH3, and BF3NH3, the CSOV approach is used to study why the bonding in BF3CO is so weak.

Bauschlicher, Charles W., Jr.↗