Search NASA⌕ Search

SEARCH · Search NASA

Results for “Surface 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.

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

At least 55 records · Page 3

On the Use of CAD-Native Predicates and Geometry in Surface Meshing

Several paradigms for accessing CAD geometry during surface meshing for CFD are discussed. File translation, inconsistent geometry engines and non-native point construction are all identified as sources of non-robustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing. The native approach is demonstrated through an algorithm for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique specially developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space. The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. The algorithm terminates after achieving a prespecified measure of mesh quality and produces a triangulation such that no angle is less than a given angle bound, a or greater than pi - 2alpha. This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to the output triangulations for a variety of CAD parts, the discussion presents related theoretical results which assert the existence of such an angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.

Aftosmis, M. J.↗

Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design variables such as the free stream parameters and the planform shape of an isolated wing. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Factors under consideration include the computation of mesh sensitivities that provide a reliable approximation of the objective function gradient, as well as the computation of surface shape sensitivities based on a direct-CAD interface. We present detailed gradient verification studies and then focus on a shape optimization problem for an Apollo-like reentry vehicle. The goal of the optimization is to enhance the lift-to-drag ratio of the capsule by modifying the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design.

Nemec, Marian↗

Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry

Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach. Thereafter, we focus on a shape optimization problem for an Apollo-like reentry capsule. The optimization seeks to enhance the lift-to-drag ratio of the capsule by modifyjing the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design. This abstract presents only a brief outline of the numerical method and results; full details will be given in the final paper.

Nemec, Marian↗

Circles and triangles, the NLSM and Tr(Φ 3 )

A surprising connection has recently been made between the amplitudes for Tr(Φ 3 ) theory and the non-linear sigma model (NLSM). A simple shift of kinematic variables naturally suggested by the associahedron/stringy representation of Tr(Φ 3 ) theory yields pion amplitudes at all loops. In this note we provide an elementary motivation and proof for this link going in the opposite direction, starting from the non-linear sigma model and discovering its formulation as a sum over triangulations of surfaces with simple numerator factors. This uses an ancient connection between “circles” and “triangles”, interpreting the equation y = $\sqrt{1 – x^2}$ both as parametrizing points a circle as well as generating the number of triangulations of polygons. A further simplification of the numerator factors exposes them as arising from the kinematically shifted Tr(Φ3) theory, and gives rise to novel tropical representations of NLSM amplitudes. The connection to Tr(Φ 3 ) theory defines a natural notion of “surface-soft limit” intrinsic to curves on surfaces. Remarkably, with this definition, the soft limit of pion amplitudes vanishes directly at the level of the integrand, via obvious pairwise cancellations. We also give simple, explicit expressions for the multi-soft factors for tree and loop-level integrands in the limit as any number of pions are taken “surface-soft”.

Scattering Amplitudes↗

An Anisotropic Scale-Invariant Unstructured Mesh Generator Auitable for Volumetric Imaging Data

Mesh generation algorithms must consider the computational physics schemes to be adopted insomuch as tessellation should attempt to minimize discretization error metrics a priori, while placing elements judiciously yet economically. Basing local element size and shape on local geometric feature size is a promising approach, as the underlying physics may either be scale-invariant or may vary with scale in a predictable way. We present a boundary-fitted scale-invariant unstructured tetrahedral mesh generation algorithm that enables registration of element size to local geometric scale, given a triangulated mesh surface. The resulting tetrahedra are well-shaped and nearly orthogonal to the boundary. Unlike previous feature-based approaches, our algorithm does not require a background mesh, nor does it rely on the medial-axis. In contrast, as a first step, our algorithm produces a gradientlimited feature-size field over the input surface based on efficient ray casting. We illustrate how this field can be used to produce quality grids for computational fluid dynamics based simulations of challenging, topologically complex surfaces derived from magnetic resonance images. The algorithm is implemented in the Pacific Northwest National Laboratory (PNNL) version of the Los Alamos grid toolbox LaGriT[6].

36 MATERIALS SCIENCE↗

Unstructured surface grid generation

Viewgraphs on unstructured surface grid generation are presented. Topics covered include: requirements for curves, surfaces, solids, and text; surface approximation; triangulation; advancing; projection; mapping; and parametric curves.

Jamshid Samareh-Abolhassani↗

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.↗

On the Use of CAD-Native Predicates and Geometry in Surface Meshing

Several paradigms for accessing computer-aided design (CAD) geometry during surface meshing for computational fluid dynamics are discussed. File translation, inconsistent geometry engines, and nonnative point construction are all identified as sources of nonrobustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing.

Aftosmis, M. J.↗

Martian surface coordinates

Methods and results are presented for primary and secondary triangulation of the Martian surface. The primary network is based on multiphotograph stereophotogrammetry in which the pictures are rotated around fixed centers; these centers are provided as spacecraft stations from the tracking data. The computations use the latest Mars spin axis determined by Mariner 9 experiments and the new first meridian passing through a small crater, Airy-O, seen on Mariner 9 imagery. The secondary triangulation is performed in the map plane using rectified pictures as map fragments, assumed to be of correct shape. Primary positions are given.

Davies, M. E.↗

NMTRI v 1.0

This code consists of Matlab routines which enable the user to perform non-manifold surface reconstruction via triangulation from high dimensional point cloud data. The code was based on an algorithm originally developed in [Freedman (2007), An Incremental Algorithm for Reconstruction of Surfaces of Arbitrary Codimension Computational Geometry: Theory and Applications, 36(2):106-116]. This algorithm has been modified to accommodate non-manifold surface according to the work described in [S. Martin and J.-P. Watson (2009), Non-Manifold Surface Reconstruction from High Dimensional Point Cloud DataSAND #5272610].The motivation for developing the code was a point cloud describing the molecular conformation space of cyclooctane (C8H16). Cyclooctane conformation space was represented using points in 72 dimensions (3 coordinates for each molecule). The code was used to triangulate the point cloud and thereby study the geometry and topology of cyclooctane. Futures applications are envisioned for peptides and proteins.

Martin, Shawn↗

NMTRI v 1.0

This code consists of Matlab routines which enable the user to perform non-manifold surface reconstruction via triangulation from high dimensional point cloud data. The code was based on an algorithm originally developed in [Freedman (2007), An Incremental Algorithm for Reconstruction of Surfaces of Arbitrary Codimension Computational Geometry: Theory and Applications, 36(2):106-116]. This algorithm has been modified to accommodate non-manifold surface according to the work described in [S. Martin and J.-P. Watson (2009), Non-Manifold Surface Reconstruction from High Dimensional Point Cloud DataSAND #5272610].The motivation for developing the code was a point cloud describing the molecular conformation space of cyclooctane (C8H16). Cyclooctane conformation space was represented using points in 72 dimensions (3 coordinates for each molecule). The code was used to triangulate the point cloud and thereby study the geometry and topology of cyclooctane. Futures applications are envisioned for peptides and proteins.

Martin, Shawn↗

Generation of three-dimensional unstructured grids by the advancing-front method

The generation of three-dimensional unstructured grids using the advancing-front technique is described. While this generation technique has been shown to be effective for the generation of unstructured grids in two dimensions, its extension to three-dimensional regions required the development of surface definition software and sophisticated data structures to avoid excessive CPU-time overheads for the search operations involved. After obtaining an initial triangulation of the surfaces, tetrahedrons are generated by successively deleting faces from the generation front. Details of the mesh generation algorithm are given, together with examples and timings.

Lohner, Rainald↗

Martian surface coordinates.

This paper presents methods and results for primary and secondary triangulation of the Martian surface. The primary network is based on multiphotograph stereophotogrammetry in which the pictures are rotated around fixed centers; these centers are provided as spacecraft stations from the tracking data. The computations use the latest Mars spin axis determined by Mariner 9 experiments and the new first meridian passing through a small crater, Airy-0, seen on Mariner 9 imagery. The secondary triangulation is performed in the map plane using rectified pictures as map fragments, assumed to be of correct shape. In this paper, 1205 primary positions are given.

Davies, M. E.↗

Quality Control by Artificial Vision

Computational technology has fundamentally changed many aspects of our lives. One clear evidence is the development of artificial-vision systems, which have effectively automated many manual tasks ranging from quality inspection to quantitative assessment. In many cases, these machine-vision systems are even preferred over manual ones due to their repeatability and high precision. Such advantages come from significant research efforts in advancing sensor technology, illumination, computational hardware, and image-processing algorithms. Similar to the Special Section on Quality Control by Artificial Vision published two years ago in Volume 17, Issue 3 of the Journal of Electronic Imaging, the present one invited papers relevant to fundamental technology improvements to foster quality control by artificial vision, and fine-tuned the technology for specific applications. We aim to balance both theoretical and applied work pertinent to this special section theme. Consequently, we have seven high-quality papers resulting from the stringent peer-reviewing process in place at the Journal of Electronic Imaging. Some of the papers contain extended treatment of the authors work presented at the SPIE Image Processing: Machine Vision Applications conference and the International Conference on Quality Control by Artificial Vision. On the broad application side, Liu et al. propose an unsupervised texture image segmentation scheme. Using a multilayer data condensation spectral clustering algorithm together with wavelet transform, they demonstrate the effectiveness of their approach on both texture and synthetic aperture radar images. A problem related to image segmentation is image extraction. For this, O'Leary et al. investigate the theory of polynomial moments and show how these moments can be compared to classical filters. They also show how to use the discrete polynomial-basis functions for the extraction of 3-D embossed digits, demonstrating superiority over Fourier-basis functions for this task. Image registration is another important task for machine vision. Bingham and Arrowood investigate the implementation and results in applying Fourier phase matching for projection registration, with a particular focus on nondestructive testing using computed tomography. Readers interested in enriching their arsenal of image-processing algorithms for machine-vision tasks should find these papers enriching. Meanwhile, we have four papers dealing with more specific machine-vision tasks. The first one, Yahiaoui et al., is quantitative in nature, using machine vision for real-time passenger counting. Occulsion is a common problem in counting objects and people, and they circumvent this issue with a dense stereovision system, achieving 97 to 99% accuracy in their tests. On the other hand, the second paper by Oswald-Tranta et al. focuses on thermographic crack detection. An infrared camera is used to detect inhomogeneities, which may indicate surface cracks. They describe the various steps in developing fully automated testing equipment aimed at a high throughput. Another paper describing an inspection system is Molleda et al., which handles flatness inspection of rolled products. They employ optical-laser triangulation and 3-D surface reconstruction for this task, showing how these can be achieved in real time. Last but not least, Presles et al. propose a way to monitor the particle-size distribution of batch crystallization processes. This is achieved through a new in situ imaging probe and image-analysis methods. While it is unlikely any reader may be working on these four specific problems at the same time, we are confident that readers will find these papers inspiring and potentially helpful to their own machine-vision system developments.

99 GENERAL AND MISCELLANEOUS↗

Optical fiber sensors for damage analysis in aerospace materials

Under this grant, fiber optic sensors were investigated for use in the nondestructive evaluation of aging aircraft. Specifically, optical fiber sensors for detection and location of impacts on a surface, and for detection of corrosion in metals were developed. The use of neural networks was investigated for determining impact location by processing the output of a network of fiberoptic strain sensors distributed on a surface. This approach employs triangulation to determine location by comparing the arrival times at several sensors, of the acoustic signal generated by the impact. For this study, a neural network simulator running on a personal computer was used to train a network using a back-propagation algorithm. Fiber optic extrinsic Fabry-Perot interferometer (EFPI) strain sensors are attached to or embedded in the surface, so that stress waves emanating from an impact can be detected. The ability of the network to determine impact location by time-or-arrival of acoustic signals was assessed by comparing network outputs with actual experimental results using impacts on a panel instrumented with optical fiber sensors. Using the neural network to process the sensor outputs, the impact location can be inferred to centimeter range accuracy directly from the arrival time data. In addition, the network can be trained to determine impact location, regardless of material anisotropy. Results demonstrate that a back-propagation network identifies impact location for an anisotropic graphite/bismaleimide plate with the same accuracy as that for an isotropic aluminum plate. Two different approaches were investigated for the development of fiber optic sensors for corrosion detection in metals, both utilizing optical fiber sensors with metal coatings. In the first approach, an extrinsic Fabry-Perot interferometric fiber optic strain sensor was placed under tensile stress, and while in the resulting strained position, a thick coating of metal was applied. Due to an increase in the quantity of material, the sensor does not return to its original position upon removal of the applied stress, and some residual strain is maintained within the sensor element. As the metal thickness decreases due to corrosion, this strain is released, providing the sensing mechanism for corrosion detection. In the second approach, photosensitive optical fibers with long period Bragg gratings in the core were coated with metal. The Bragg gratings serve to couple core modes at discrete wavelengths to cladding modes. Since cladding modes interact with the metal coating surrounding the fiber cladding, the specific wavelengths coupled from core to cladding depend on the refractive index of the metal coating. Therefore, as the metal corrodes, the resulting change in index of the coating may be measured by measuring the change in wavelength of the coupled mode. Results demonstrate that both approaches can be successfully used to track the loss in metal coating on the optical fiber sensors due to corrosion.

Schindler, Paul↗

Enhanced Optical Head Tracking for Cranial Radiation Therapy: Supporting Surface Registration by Cutaneous Structures

Purpose: To support surface registration in cranial radiation therapy by structural information. The risk for spatial ambiguities is minimized by using tissue thickness variations predicted from backscattered near-infrared (NIR) light from the forehead. Methods and Materials: In a pilot study we recorded NIR surface scans by laser triangulation from 30 volunteers of different skin type. A ground truth for the soft-tissue thickness was segmented from MR scans. After initially matching the NIR scans to the MR reference, Gaussian processes were trained to predict tissue thicknesses from NIR backscatter. Moreover, motion starting from this initial registration was simulated by 5000 random transformations of the NIR scan away from the MR reference. Re-registration to the MR scan was compared with and without tissue thickness support. Results: By adding prior knowledge to the backscatter features, such as incident angle and neighborhood information in the scanning grid, we showed that tissue thickness can be predicted with mean errors of <0.2 mm, irrespective of the skin type. With this additional information, the average registration error improved from 3.4 mm to 0.48 mm by a factor of 7. Misalignments of more than 1 mm were almost thoroughly (98.9%) pushed below 1 mm. Conclusions: For almost all cases tissue-enhanced matching achieved better results than purely spatial registration. Ambiguities can be minimized if the cutaneous structures do not agree. This valuable support for surface registration increases tracking robustness and avoids misalignment of tumor targets far from the registration site.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

PHYSICS OF ECLIPSING BINARIES. II. TOWARD THE INCREASED MODEL FIDELITY

The precision of photometric and spectroscopic observations has been systematically improved in the last decade, mostly thanks to space-borne photometric missions and ground-based spectrographs dedicated to finding exoplanets. The field of eclipsing binary stars strongly benefited from this development. Eclipsing binaries serve as critical tools for determining fundamental stellar properties (masses, radii, temperatures, and luminosities), yet the models are not capable of reproducing observed data well, either because of the missing physics or because of insufficient precision. This led to a predicament where radiative and dynamical effects, insofar buried in noise, started showing up routinely in the data, but were not accounted for in the models. PHOEBE (PHysics Of Eclipsing BinariEs; http://phoebe-project.org) is an open source modeling code for computing theoretical light and radial velocity curves that addresses both problems by incorporating missing physics and by increasing the computational fidelity. In particular, we discuss triangulation as a superior surface discretization algorithm, meshing of rotating single stars, light travel time effects, advanced phase computation, volume conservation in eccentric orbits, and improved computation of local intensity across the stellar surfaces that includes the photon-weighted mode, the enhanced limb darkening treatment, the better reflection treatment, and Doppler boosting. Here we present the concepts on which PHOEBE is built and proofs of concept that demonstrate the increased model fidelity.

79 ASTRONOMY AND ASTROPHYSICS↗