Engineering PapersSearch

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

Triangulation of multistation camera data to locate a curved line in space

A method is described for finding the location of a curved line in space from local azimuth as a function of elevation data obtained at several observation sites. A least-squares criterion is used to insure the best fit to the data. The method is applicable to the triangulation of an object having no identifiable structural features, provided its width is very small compared with its length so as to approximate a line in space. The method was implemented with a digital computer program and was successfully applied to data obtained from photographs of a barium ion cloud which traced out the earth's magnetic field line at very high altitudes.

Fricke, C. L.

Analytical expressions for position error in triangulation solution of point in space for several station configurations

Analytical expressions are derived to first order for the rms position error in the triangulation solution of a point object in space for several ideal observation-station configurations. These expressions provide insights into the nature of the dependence of the rms position error on certain of the experimental parameters involved. The station geometries examined are: (1) the configuration of two arbitrarily located stations; (2) the symmetrical circular configuration of two or more stations with equal elevation angles; and (3) the circular configuration of more than two stations with equal elevation angles, when one of the stations is permitted to drift around the circle from its position of symmetry. The expressions for the rms position error are expressed as functions of the rms line-of-sight errors, the total number of stations of interest, and the elevation angles.

Long, S. A. T.

Effects of various experimental parameters on errors in triangulation solution of elongated object in space

The effects of various experimental parameters on the displacement errors in the triangulation solution of an elongated object in space due to pointing uncertainties in the lines of sight have been determined. These parameters were the number and location of observation stations, the object's location in latitude and longitude, and the spacing of the input data points on the azimuth-elevation image traces. The displacement errors due to uncertainties in the coordinates of a moving station have been determined as functions of the number and location of the stations. The effects of incorporating the input data from additional cameras at one of the stations were also investigated.

Long, S. A. T.

Earth parameters from global satellite triangulation and trilateration

Results obtained from 159-station global satellite triangulation and trilateration (including Baker-Nunn, BC-4, PC-1000 camera observations, SECOR, C-Band radar and EDM distance measurements) indicate differences in the semidiameter and orientation of the earth compared to results obtained from dynamic satellite solutions. Geoidal undulations obtained can be made consistent with dynamically determined ones at the expense of slight changes in the currently accepted parameters defining the gravity field of the level ellipsoid.

Mueller, I. I.

Satellite triangulation in Europe from WEST and ISAGEX data

Observational data that was acquired during the West European Satellite Triangulation (WEST) program and the International Satellite Geodesy Experiment (ISAGEX) campaign was obtained for the purpose of performing a geometric solution to improve the present values of coordinates of the European stations in the OSU WN14 solutions, adding some new stations and assessing the quality of the WN14 solution with the help of the additional data available. The status of the data as received, the preprocessing required and the preliminary tests carried out for the initial screening of the data are described. The adjustment computations carried out and the results of the adjustments are discussed.

Leick, A.

Sequential triangulation of orbital photography

The feasibility of structuring the satellite photogrammetric triangulation as an iterative Extended Kalman estimation algorithm is demonstrated. Comparative numerical results of the sequential against batch estimation algorithm are presented. Difficulty of accurately modeling of the attitude motion is overcome by utilizing the on-board angular rate measurements. Solutions of the differential equations and the evaluation of state transition matrix are carried out numerically.

Rajan, M.

A linear photodiode array employed in a short range laser triangulation obstacle avoidance sensor

An opto-electronic receiver incorporating a multi-element linear photodiode array as a component of a laser-triangulation rangefinder was developed as an obstacle avoidance sensor for a Martian roving vehicle. The detector can resolve the angle of laser return in 1.5 deg increments within a field of view of 30 deg and a range of five meters. A second receiver with a 1024 elements over 60 deg and a 3 meter range is also documented. Design criteria, circuit operation, schematics, experimental results and calibration procedures are discussed.

Odenthal, J. P.

Three dimensional mesh generation by triangulation of arbitrary point sets

A method for generating an unstructured mesh is described. The approach is quite general and joins an arbitrary set of points to produce a covering of three dimensional space by tetrahedra. After removing the tetrahedra that connect surface points, a mesh suitable for a finite element based flow solver is obtained. Details of the triangulation algorithm are provided together with an analysis of the algorithm efficiency and validity.

Baker, Timothy J.

Adaptive mesh generation for viscous flows using Delaunay triangulation

A method for generating an unstructured triangular mesh in two dimensions, suitable for computing high Reynolds number flows over arbitrary configurations is presented. The method is based on a Delaunay triangulation, which is performed in a locally stretched space, in order to obtain very high aspect ratio triangles in the boundary layer and the wake regions. It is shown how the method can be coupled with an unstructured Navier-Stokes solver to produce a solution adaptive mesh generation procedure for viscous flows.

Mavriplis, Dimitri J.

Adaptive mesh generation for viscous flows using Delaunay triangulation

A method for generating an unstructured triangular mesh in two dimensions, suitable for computing high Reynolds number flows over arbitrary configurations is presented. The method is based on a Delaunay triangulation, which is performed in a locally stretched space, in order to obtain very high aspect ratio triangles in the boundary layer and the wake regions. It is shown how the method can be coupled with an unstructured Navier-Stokes solver to produce a solution adaptive mesh generation procedure for viscous flows.

Mavriplis, Dimitri J.

Adaptive mesh generation for viscous flows using Delaunay triangulation

A method for generating an unstructured triangular mesh in two dimensions, suitable for computing high Reynolds number flows over arbitrary configurations is presented. The method is based on a Delaunay triangulation, which is performed in a locally stretched space, in order to obtain very high aspect ratio triangles in the boundary layer and the wake regions. It is shown how the method can be coupled with an unstructured Navier-Stokes solver to produce a solution adaptive mesh generation procedure for viscous flows.

Mavriplis, Dimitri J.

Advancing-Front Algorithm For Delaunay Triangulation

Efficient algorithm performs Delaunay triangulation to generate unstructured grids for use in computing two-dimensional flows. Once grid generated, one can optionally call upon additional subalgorithm that removes diagonal lines from quadrilateral cells nearly rectangular. Resulting approximately rectangular grid reduces cost per iteration of flow-computing algorithm.

Merriam, Marshal L.

Global positioning system reoccupation of early triangulation sites - Tectonic deformation of the Southern Coast Ranges

We study tectonic deformation in the Southern Coast Range, California. We use triangulation and astronomic azimuth data collected since 1875, trilateration since 1970, and global positioning system data collected from 1986 to 1987. Two modeling techniques have been used. An elastic block-fault model is applied to study the tectonic motion of the San Andreas Fault and the San Gregorio-Hosgri Fault. Station velocities are modeled to study regional deformations. Results show that the regional deformation is predominantly controlled by deep strike-slip motion along the San Andreas Fault, at a rate of 33 +/- 2 mm/yr. Deep slip along the San Gregorio-Hosgri Fault is about 0-4 mm/yr, assuming a locked suit to a depth of 20 km. Convergence normal to the San Andreas Fault in the Southern Coast Ranges is not greater than 0.02 microrad/yr.

Shen, Zheng-Kang

Parallel implementation of an algorithm for Delaunay triangulation

The theory and practice of implementing Tanemura's algorithm for 3D Delaunay triangulation on Intel's Gamma prototype, a 128 processor MIMD computer, is described. Efficient implementation of Tanemura's algorithm on a conventional, vector processing supercomputer is problematic. It does not vectorize to any significant degree and requires indirect addressing. Efficient implementation on a parallel architecture is possible, however. Speeds in excess of 20 times a single processor Cray Y-MP are realized on 128 processors of the Intel Gamma prototype.

Merriam, Marshal L.

Parallel implementation of an algorithm for Delaunay triangulation

This work concerns the theory and practice of implementing Tanemura's algorithm for 3D Delaunay triangulation on Intel's Gamma prototype, a 128 processor MIMD computer. Tanemura's algorithm does not vectorize to any significant degree and requires indirect addressing. Efficient implementation on a conventional, vector processing, supercomputer is problematic. Efficient implementation on a parallel architecture is possible, however. In this work, speeds in excess of 8 times a single processor Cray Y-mp are realized on 128 processors of the Intel Gamma prototype.

Merriam, Marshall L.

Advanced Triangulation Displacement Sensors

Advanced optoelectronic triangulation displacement sensors undergoing development. Highly miniaturized, more stable, more accurate, and relatively easy to use. Incorporate wideband electronic circuits suitable for real-time monitoring and control of displacements. Measurements expected to be accurate to within nanometers. In principle, sensors mass-produced at relatively low unit cost. Potential applications numerous. Possible industrial application in measuring runout of rotating shaft or other moving part during fabrication in "zero-defect" manufacturing system, in which measured runout automatically corrected.

Poteet, Wade M.

Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation

We propose a new algorithm for computing the Riemann mapping of the unit disk to a polygon, also known as the Schwarz-Christoffel transformation. The new algorithm, CRDT, is based on cross-ratios of the prevertices, and also on cross-ratios of quadrilaterals in a Delaunay triangulation of the polygon. The CRDT algorithm produces an accurate representation of the Riemann mapping even in the presence of arbitrary long, thin regions in the polygon, unlike any previous conformal mapping algorithm. We believe that CRDT can never fail to converge to the correct Riemann mapping, but the correctness and convergence proof depend on conjectures that we have so far not been able to prove. We demonstrate convergence with computational experiments. The Riemann mapping has applications to problems in two-dimensional potential theory and to finite-difference mesh generation. We use CRDT to produce a mapping and solve a boundary value problem on long, thin regions for which no other algorithm can solve these problems.

Driscoll, Tobin A.

Diffusion Characteristics of Upwind Schemes on Unstructured Triangulations

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and dimensionally-split finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the dimensionally-split finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2-3 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a 20-25 speedup over finite volume.

Wood, William A.