SEARCH · Engineering Papers

Results for “Delaunay triangulation”

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.

SourceResearch connectionFrom yearThrough year

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

43 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS2003

Three-Dimensional Morphological Analysis of ALH84001 Magnetite Using Electron Tomography

We report here the crystal morphologies of MV-1 and ALH84001 magnetites as calculated by back-projection using electron tomography. In the present study, we used a 300 keV TEM with a field emission gun (Tecnai F-30 from FEI Inc.), equipped with a 2048 x 2048 pixel CCD camera from Gatan Inc. to image magnetite crystals over tilt ranges of approx. +/- 72 deg in 2 deg tilt intervals. The images were aligned for back-projection, either manually, or through the use of fiducial 5 nm Au spheres affixed to the specimen prior to microscopy. Three-dimensional (3-D) reconstructions were computed using weighted back-projection of the tilted views. The tomograms were viewed and analyzed as a series of slices 1.0 nm thick, taken parallel to the specimen-supporting grid, using the IMOD software package. The shape of each magnetite crystal was determined by defining the external contour of a given magnetite in each slice and assembling a stack of these contours in 3-D. To aid in visualization, the stacked contour array was reduced to an optimal mesh by Delaunay triangulation. The surface normal to each of the triangles in the mesh was calculated and the triangle faces colored according to the orientation of that surface normal relative to the principal crystallographic axis of magnetite. Green surfaces correspond to {111} orientations, blue surfaces to {100} orientations, and red surfaces to {110} orientations. Triangles whose surface normal did not correspond to one of the principal axes were colored gray. Within the experimental and numerical uncertainties of the deconvolution, the tomographic reconstruction of both MV-1 and ALH84001 magnetites are equivalent and correspond to a truncated hexa-octahedral morphology.

Thomas-Keprta, Kathie L.↗

NASA NTRS2003

Computing Axisymmetric Jet Screech Tones using Unstructured Grids

The purpose of this paper is to show that computations with an aeroacoustic feedback loop, the jet screech noise, can be obtained using truly unstructured grid technology. Numerical results are presented for a nozzle with two different lip thicknesses which will be referred to in this paper as a thin and a thick lip nozzle respectively. The space-time conservation element and solution element (CE/SE) method is used to solve the conservation laws of the compressible axisymmetric Navier-Stokes equations. The equations are time marched to predict the unsteady flow and the near-field screech tone noise issuing from an underexpanded circular jet. The CE/SE method uses an unstructured grid based data structure. The unstructured grids for these calculations are generated based on the method of Delaunay triangulation. Comparisons of numerical results with available experimental data are shown for flows corresponding to several different jet Mach numbers. Generally good agreement is obtained in terms of flow physics, screech tone frequency, and sound pressure level.

Jorgenson, Philip C. E.↗

NASA NTRS2006

DCS-Neural-Network Program for Aircraft Control and Testing

A computer program implements a dynamic-cell-structure (DCS) artificial neural network that can perform such tasks as learning selected aerodynamic characteristics of an airplane from wind-tunnel test data and computing real-time stability and control derivatives of the airplane for use in feedback linearized control. A DCS neural network is one of several types of neural networks that can incorporate additional nodes in order to rapidly learn increasingly complex relationships between inputs and outputs. In the DCS neural network implemented by the present program, the insertion of nodes is based on accumulated error. A competitive Hebbian learning rule (a supervised-learning rule in which connection weights are adjusted to minimize differences between actual and desired outputs for training examples) is used. A Kohonen-style learning rule (derived from a relatively simple training algorithm, implements a Delaunay triangulation layout of neurons) is used to adjust node positions during training. Neighborhood topology determines which nodes are used to estimate new values. The network learns, starting with two nodes, and adds new nodes sequentially in locations chosen to maximize reductions in global error. At any given time during learning, the error becomes homogeneously distributed over all nodes.

Jorgensen, Charles C.↗

NASA NTRS2002

Superlative TINs

TIN is short for 'triangulated irregular network,' which is a piecewise planar model of a surface. If properly constructed, a TIN can be more than 30 times as efficient as a regular triangulation. In our project (a ground combat simulation to support U.S. Army training exercises), the TIN is used to represent the Earth's surface and is used primarily to determine whether line of sight is blocked by terrain. High efficiency requires accurate identification of ridgelines with as few triangles as possible. The work currently in progress is the implementation of a TINning process that we hope will produce superlative TINs. This presentation describes that process.

Triangulated Irregular Networks TIN Delaunay trian↗

DOE OSTI2024

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1993

Unstructured 3D Delaunay mesh generation applied to planes, trains and automobiles

Technical issues associated with domain-tessellation production, including initial boundary node triangulation and volume mesh refinement, are presented for the 'TGrid' 3D Delaunay unstructured grid generation program. The approach employed is noted to be capable of preserving predefined triangular surface facets in the final tessellation. The capabilities of the approach are demonstrated by generating grids about an entire fighter aircraft configuration, a train, and a wind tunnel model of an automobile.

Blake, Kenneth R.↗

NASA NTRS1985

Three-dimensional algorithms for grid restructuring in Free-Lagrangian calculations

Grid restructuring algorithms which lower the price of three-dimensional Free-Lagrange calculations are presented. The algorithms are first given for the case of planar triangulated surfaces embedded in and spanning a three-dimensional region. The tetrahedra generated by this technique form a Delaunay mesh if the interplane spacing is comparable to the resolution within the planes. The algorithm can therefore be used for efficient determinations of Voronoi connections for initial grids. Modifications of the algorithm for the case of closely spaced surfaces are demonstrated in the context of restructuring algorithms which can accommodate colliding surfaces. Then, the restriction to planar surfaces is removed and regular surfaces are examined. The basic algorithm is the same, with an additional operation to project the vertices of one surface onto another. Finally, vertices on the surface are allowed to migrate anywhere in space.

Fritts, M.↗