Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1974

Global satellite triangulation and trilateration results

Summary of the results of the Ohio State University geometric adjustment for the coordinates at 158 satellite tracking stations. In the solution the origin of the coordinate system is defined through the 'inner' adjustment procedure, whereas the orientation is through the Conventional International Origin and the Greenwich Mean Astronomical Meridian, both as defined by the Bureau International de l'Heure. The scale is implemented through Secor observations and weighted height constraints. Chord distances derived from C-band radar observations and from electronic distance measurements are also included, but they seem to have very little effect. The scale selected corresponds to a best fitting ellipsoid of a = 6,378,142 m and 1/f = 298.25. The average standard deviation of a single coordinate is 3.9 m.

Mueller, I. I.↗
NASA NTRS1996

Triangulation methods for automated docking

An automated docking system must have a reliable method for determining range and orientation of the passive (target) vehicle with respect to the active vehicle. This method must also provide accurate information on the rates of change of range to and orientation of the passive vehicle. The method must be accurate within required tolerances and capable of operating in real time. The method being developed at Marshall Space Flight Center employs a single TV camera, a laser illumination system and a target consisting, in its minimal configuration, of three retro-reflectors. Two of the retro-reflectors are mounted flush to the same surface, with the third retro-reflector mounted to a post fixed midway between the other two and jutting at a right angle from the surface. For redundancy, two additional retroreflectors are mounted on the surface on a line at right angles to the line containing the first two retro-reflectors, and equally spaced on either side of the post. The target vehicle will contain a large target for initial acquisition and several smaller targets for close range.

Bales, John W.↗
NASA NTRS2002

A Discontinuous Galerkin Discretization of the Eikonal Equation on Curved Piecewise Isoparametric Triangulated Manifolds

This viewgraph presentation provides information on optimizing the travel distance between two points on a curved surface. The presentation addresses the single source shortest path problem, fast algorithms for estimating the eikonal equation, fast schemes and barrier theorems, and the discontinuous Galerkin method, including hyperbolic causality, finite element method, scalars, and marching the discontinuous Galerkin Eikonal approximation.

Barth, TIm↗
NASA NTRS1997

Fast Optical Hazard Detection for Planetary Rovers Using Multiple Spot Laser Triangulation

A new laser-based optical sensor system that provides hazard detection for planetary rovers is presented. It is anticipated that the sensor can support safe travel at speeds up to 6cm/second for large (1m) rovers in full sunlight on Earth or Mars. The system overcomes limitations in an older design that require image differencing ot detect a laser stripe in full sun.

laser based optical sensor system planetary rovers↗
NASA NTRS2006

Reach Envelope and Field of Vision Quantification in Mark III Space Suit Using Delaunay Triangulation

The Science Crew Operations and Utility Testbed (SCOUT) project is focused on the development of a rover vehicle that can be utilized by two crewmembers during extra vehicular activities (EVAs) on the moon and Mars. The current SCOUT vehicle can transport two suited astronauts riding in open cockpit seats. Among the aspects currently being developed is the cockpit design and layout. This process includes the identification of possible locations for a socket to which a crewmember could connect a portable life support system (PLSS) for recharging power, air, and cooling while seated in the vehicle. The spaces in which controls and connectors may be situated within the vehicle are constrained by the reach and vision capabilities of the suited crewmembers. Accordingly, quantification of the volumes within which suited crewmembers can both see and reach relative to the vehicle represents important information during the design process.

Abercromby, Andrew F. J.↗
NASA NTRS1999

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

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

Saxena, N. K.↗
NASA NTRS1992

Three-dimensional unstructured grid generation via incremental insertion and local optimization

Algorithms for the generation of 3D unstructured surface and volume grids are discussed. These algorithms are based on incremental insertion and local optimization. The present algorithms are very general and permit local grid optimization based on various measures of grid quality. This is very important; unlike the 2D Delaunay triangulation, the 3D Delaunay triangulation appears not to have a lexicographic characterization of angularity. (The Delaunay triangulation is known to minimize that maximum containment sphere, but unfortunately this is not true lexicographically). Consequently, Delaunay triangulations in three-space can result in poorly shaped tetrahedral elements. Using the present algorithms, 3D meshes can be constructed which optimize a certain angle measure, albeit locally. We also discuss the combinatorial aspects of the algorithm as well as implementational details.

Barth, Timothy J.↗
NASA NTRS2005

Bias Reduction and Filter Convergence for Long Range Stereo

We are concerned here with improving long range stereo by filtering image sequences. Traditionally, measurement errors from stereo camera systems have been approximated as 3-D Gaussians, where the mean is derived by triangulation and the covariance by linearized error propagation. However, there are two problems that arise when filtering such 3-D measurements. First, stereo triangulation suffers from a range dependent statistical bias; when filtering this leads to over-estimating the true range. Second, filtering 3-D measurements derived via linearized error propagation leads to apparent filter divergence; the estimator is biased to under-estimate range. To address the first issue, we examine the statistical behavior of stereo triangulation and show how to remove the bias by series expansion. The solution to the second problem is to filter with image coordinates as measurements instead of triangulated 3-D coordinates.

robotics↗
DOE OSTI2022

Hybrid Curve Fitting For Reducing Motion Commands In Object Construction

Existing slicing software for additive manufacturing typically requires a triangulated mesh as its input. Triangulated meshes are approximate representations of exact CAD models. Despite the loss in dimensional accuracy, triangulated meshes are used because they are computationally easier to cross-section and offset than the exact geometry in CAD format. When a triangulated object is prepared, the resulting machine instructions include only linear motion commands. Numerous modern motion controllers can move in arc and spline motions; however, the absence of slicing software that supports curvature prevents these commands from being leveraged. To address this limitation, this paper presents a method for the hybrid reconstruction of arcs and splines as a post-processing step to traditional slicing. This method can greatly reduce the number of motion commands required to construct an object by printing smooth curved surfaces. This concise representation of tool-pathing allows for more even extrusion and is computed without a major impact on slicing time.

Wade, Charles↗
DOE OSTI2022

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fermions, quantum gravity, and holography in two dimensions

We study a model comprising N flavors of Kähler Dirac fermion propagating on a triangulated two-dimensional disk which is constrained to have a negative average bulk curvature. Dirichlet boundary conditions are chosen for the fermions. Quantum fluctuations of the geometry are included by summing over all possible triangulations consistent with these constraints. We show in the limit N → ∞ that the partition function is dominated by a regular triangulation of two-dimensional hyperbolic space. We use strong coupling expansions and Monte Carlo simulation to show that in this limit boundary correlators of the fermions have a power law dependence on boundary separation as one expects from holography. However, we argue that this behavior breaks down for any finite number of massive fields in the thermodynamic limit and quantum fluctuations of the bulk geometry drive the theory into a nonholographic phase. In contrast, for massless fermions, we find evidence that the boundary is conformal even for finite N . This is consistent with theoretical results in quantum Liouville theory. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
NASA NTRS1972

Basic research and data analysis for the National Geodetic Satellite Program

Investigations of triangulation nets and scaling are reported. Adjustment of the BC-4 worldwide geometric satellite triangulation net is described, along with procedures for correcting type II data and the contents of magnetic tapes containing data from the Pageos network. Computational steps for the further reduction of partially reduced satellite image plate coordinates are outlined. The problem of improving existing triangulation systems by means of satellite super-control points was studied. The SAO-69 geometric solution was scaled with C-band radar data, resulting in SAO and C-band adjustment compatible with one another in the Western Hemisphere. The North America solution NA-6, obtained from GEOS 1 data, was readjusted with new heights as constraints on all 30 optical stations and is referred to as the NA-8 solution.

Source record↗
NASA NTRS1999

Location and Geologic Setting for the Three U.S. Mars Landers

Super resolution of the horizon at both Viking landing sites has revealed "new" features we use for triangulation, similar to the approach used during the Mars Pathfinder Mission. We propose alternative landing site locations for both landers for which we believe the confidence is very high. Super resolution of VL-1 images also reveals some of the drift material at the site to consist of gravel-size deposits. Since our proposed location for VL-2 is NOT on the Mie ejecta blanket, the blocky surface around the lander may represent the meter-scale texture of "smooth palins" in the region. The Viking Lander panchromatic images typically offer more repeat coverage than does the IMP on Mars Pathfinder, due to the longer duration of these landed missions. Sub-pixel offsets, necessary for super resolution to work, appear to be attributable to thermal effects on the lander and settling of the lander over time. Due to the greater repeat coverage (particularly in the near and mid-fields) and all-panchromatic images, the gain in resolution by super resolution processing is better for Viking than it is with most IMP image sequences. This enhances the study of textural details near the lander and enables the identification rock and surface textures at greater distances from the lander. Discernment of stereo in super resolution im-ages is possible to great distances from the lander, but is limited by the non-rotating baseline between the two cameras and the shorter height of the cameras above the ground compared to IMP. With super resolution, details of horizon features, such as blockiness and crater rim shapes, may be better correlated with Orbiter images. A number of horizon features - craters and ridges - were identified at VL-1 during the misison, and a few hils and subtle ridges were identified at VL-2. We have added a few "new" horizon features for triangulation at the VL-2 landing site in Utopia Planitia. These features were used for independent triangulation with features visible in Viking Orbiter and MGS MOC images, though the actual location of VL-1 lies in a data dropout in the MOC image of the area. Additional information is contained in the original extended abstract.

Parker, T. J.↗