Search NASA⌕ Search

SEARCH · Search NASA

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

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.

Barth, Timothy J.↗

A Triangulation Method for Identifying Hydrostratigraphic Locations of Well Screens

A method to identify the hydrostratigraphic location of well screens was developed using triangulation with known locations. This method was applied to all of the monitor wells being used to develop the new GSA groundwater model. Results from this method are closely aligned with those from an alternate method which uses a mesh surface.

58 GEOSCIENCES↗

Alphavirus Particles Can Assemble with an Alternate Triangulation Number

Alphaviruses are spherical, enveloped RNA viruses primarily transmitted by mosquitoes, and cause significant arthritogenic and neurotropic disease in humans and livestock. Previous reports have shown that—in contrast to prototypical icosahedral viruses—alphaviruses incorporate frequent defects, and these may serve important functions in the viral life cycle. We confirm the genus-wide pleomorphism in live viral particles and extend our understanding of alphavirus assembly through the discovery of an alternate architecture of Eastern equine encephalitis virus (EEEV) particles. The alternate T = 3 icosahedral architecture differs in triangulation number from the classic T = 4 icosahedral organization that typifies alphaviruses, but the alternate architecture maintains the quasi-equivalence relationship of asymmetric units. The fusion spike glycoproteins are more loosely apposed in the T = 3 form with corresponding changes in the underlying capsid protein lattice. This alternate architecture could potentially be exploited in engineering alphavirus-based particles for delivery of alphaviral or other RNA.

59 BASIC BIOLOGICAL SCIENCES↗

Representing Solar Active Regions with Triangulations

The solar chromosphere consists of three classes which contribute differently to ultraviolet radiation reaching the earth. We describe a data set of solar images, means of segmenting the images into the constituent classes, and novel high-level representation for compact objects based on a triangulation spatial 'membership function'.

Triangulation chromosphere Markov chain Monte Carl↗

A DELAUNAY TRIANGULATION APPROACH FOR SEGMENTING CLUMPS OF NUCLEI

Cell-based fluorescence imaging assays have the potential to generate massive amount of data, which requires detailed quantitative analysis. Often, as a result of fixation, labeled nuclei overlap and create a clump of cells. However, it is important to quantify phenotypic read out on a cell-by-cell basis. In this paper, we propose a novel method for decomposing clumps of nuclei using high-level geometric constraints that are derived from low-level features of maximum curvature computed along the contour of each clump. Points of maximum curvature are used as vertices for Delaunay triangulation (DT), which provides a setof edge hypotheses for decomposing a clump of nuclei. Each hypothesis is subsequently tested against a constraint satisfaction network for a near optimum decomposition. The proposed method is compared with other traditional techniques such as the watershed method with/without markers. The experimental results show that our approach can overcome the deficiencies of the traditional methods and is very effective in separating severely touching nuclei.

60 APPLIED LIFE SCIENCES↗

Sign flip triangulations of the amplituhedron

We present new triangulations of the m = 4 amplituhedron relevant for scattering amplitudes in planar N = 4 super-Yang-Mills, obtained directly from the combinatorial definition of the geometry. Using the “sign flip” characterization of the amplituhedron, we reproduce the canonical forms for the all-multiplicity next-tomaximally helicity violating (NMHV) and next-to-next-to-maximally helicity violating (N2MHV) tree-level as well as the NMHV one-loop cases, without using any input from traditional amplitudes methods. Our results provide strong evidence for the equivalence of the original definition of the amplituhedron [1] and the topological one [2], and suggest a new path forward for computing higher loop amplitudes geometrically. In particular, we realize the NMHV one-loop amplituhedron as the intersection of two amplituhedra of lower dimensionality, which is reflected in the novel structure of the corresponding canonical form.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Restrictions on Measurement of Roughness of Textile Fabrics by Laser Triangulation: A Phenomenological Approach

Laser triangulation method is one of the methods used for contactless measurement of roughness of textile fabrics. Method is based on measurement of distance between the sensor and the object by imaging the light scattered from the surface. However, experimental results, especially for high values of roughness, show a strong dependence to duration of exposure time to laser pulses. Use of very short exposure times and long exposures times causes appearance on the surface of the scanned textile of pixels with Active peak heights. The number of Active peaks increases with decrease of exposure time down to 0.1 ms, and increases with increase of exposure time up to 100 ms. Appearance of Active peaks leads to nonrealistic increase of roughness of the surface both for short exposure times and long exposure times reaching a minimum somewhere in the region of medium exposure times, 1 to 2 ms. The above effect suggests a careful analysis of experimental data and, also, becomes an important restriction to the method. In this paper we attempt to make a phenomenological approach to the mechanisms leading to these effects. We suppose that effect is related both to scattering properties of scanned surface and to physical parameters of CCD sensors. The first factor becomes more important in the region of long exposure times, while second factor becomes more important in the region of short exposure times.

36 MATERIALS SCIENCE↗

GEOMETRIC TRIANGULATION OF IMAGING OBSERVATIONS TO TRACK CORONAL MASS EJECTIONS CONTINUOUSLY OUT TO 1 AU

We describe a geometric triangulation technique, based on time-elongation maps constructed from imaging observations, to track coronal mass ejections (CMEs) continuously in the heliosphere and predict their impact on the Earth. Taking advantage of stereoscopic imaging observations from the Solar Terrestrial Relations Observatory, this technique can determine the propagation direction and radial distance of CMEs from their birth in the corona all the way to 1 AU. The efficacy of the method is demonstrated by its application to the 2008 December 12 CME, which manifests as a magnetic cloud (MC) from in situ measurements at the Earth. The predicted arrival time and radial velocity at the Earth are well confirmed by the in situ observations around the MC. Our method reveals non-radial motions and velocity changes of the CME over large distances in the heliosphere. It also associates the flux-rope structure measured in situ with the dark cavity of the CME in imaging observations. Implementation of the technique, which is expected to be a routine possibility in the future, may indicate a substantial advance in CME studies as well as space weather forecasting.

79 ASTRONOMY AND ASTROPHYSICS↗

TRIANGULATION OF THE INTERSTELLAR MAGNETIC FIELD

Determining the direction of the local interstellar magnetic field (LISMF) is important for understanding the heliosphere’s global structure, the properties of the interstellar medium, and the propagation of cosmic rays in the local galactic medium. Measurements of interstellar neutral atoms by Ulysses for He and by SOHO/SWAN for H provided some of the first observational insights into the LISMF direction. Because secondary neutral H is partially deflected by the interstellar flow in the outer heliosheath and this deflection is influenced by the LISMF, the relative deflection of H versus He provides a plane—the so-called B–V plane in which the LISMF direction should lie. Interstellar Boundary Explorer (IBEX) subsequently discovered a ribbon, the center of which is conjectured to be the LISMF direction. The most recent He velocity measurements from IBEX and those from Ulysses yield a B–V plane with uncertainty limits that contain the centers of the IBEX ribbon at 0.7–2.7 keV. The possibility that Voyager 1 has moved into the outer heliosheath now suggests that Voyager 1's direct observations provide another independent determination of the LISMF. We show that LISMF direction measured by Voyager 1 is >40° off from the IBEX ribbon center and the B–V plane. Taking into account the temporal gradient of the field direction measured by Voyager 1, we extrapolate to a field direction that passes directly through the IBEX ribbon center (0.7–2.7 keV) and the B–V plane, allowing us to triangulate the LISMF direction and estimate the gradient scale size of the magnetic field.

79 ASTRONOMY AND ASTROPHYSICS↗

Improved algorithm for dynamical triangulations and simulations of finer lattices

We introduce a new algorithm for the simulation of Euclidean dynamical triangulations that mimics the Metropolis-Hastings algorithm, but where all proposed moves are accepted. This rejection-free algorithm allows for the factorization of local and global terms in the action, a condition needed for efficient simulation of theories with global terms, while still maintaining detailed balance. We test our algorithm on the 2 d Ising model, and against results for EDT obtained with standard Metropolis. Our new algorithm allows us to simulate EDT at finer lattice spacings than previously possible, and we find geometries that resemble semiclassical Euclidean de Sitter space in agreement with earlier results at coarser lattices. The agreement between lattice data and the classical de Sitter solution continues to get better as the lattice spacing decreases. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Triangulation Made Easy

We describe a simple and efficient algorithm for two-view triangulation of 3D points from approximate 2D matches based on minimizing the L2 reprojection error. Our iterative algorithm improves on the one by Kanatani et al. by ensuring that in each iteration the epipolar constraint is satisfied. In the case where the two cameras are pointed in the same direction, the method provably converges to an optimal solution in exactly two iterations. For more general camera poses, two iterations are sufficient to achieve convergence to machine precision, which we exploit to devise a fast, non-iterative method. The resulting algorithm amounts to little more than solving a quadratic equation, and involves a fixed, small number of simple matrixvector operations and no conditional branches. We demonstrate that the method computes solutions that agree to very high precision with those of Hartley and Sturm's original polynomial method, though achieves higher numerical stability and 1-4 orders of magnitude greater speed.

99 GENERAL AND MISCELLANEOUS↗

Simultaneous hierarchical segmentation and vectorization of satellite images through combined data sampling and anisotropic triangulation

The automatic detection, recognition , and segmentation of object classes in remote sensed images is of crucial importance for scene interpretation and understanding. However, it is a difficult task because of the high variability of satellite data. Indeed, the observed scenes usually exhibit a high degree of complexity, where complexity refers to the large variety of pictorial representations of objects with the same semantic meaning and also to the extensive amount of available det.ails. Therefore, there is still a strong demand for robust techniques for automatic information extraction and interpretation of satellite images. In parallel, there is a growing interest in techniques that can extract vector features directly from such imagery. In this paper, we investigate the problem of automatic hierarchical segmentation and vectorization of multispectral satellite images. We propose a new algorithm composed of the following steps: (i) a non-uniform sampling scheme extracting most salient pixels in the image, (ii) an anisotropic triangulation constrained by the sampled pixels taking into account both strength and directionality of local structures present in the image, (iii) a polygonal grouping scheme merging, through techniques based on perceptual information , the obtained segments to a smaller quantity of superior vectorial objects. Besides its computational efficiency, this approach provides a meaningful polygonal representation for subsequent image analysis and/or interpretation.

47 OTHER INSTRUMENTATION↗

Surface Triangulation for CSG in Mercury

Visualization routines for rendering complicated geometries are very useful for engineers and scientists who are trying to build 3D prototypes of their designs. A common way to rapidly add interesting features to a 3D model is through the use of a concept called Constructive Solid Geometry. CSG uses compositions of the boolean set operations to manipulate basic geometric primitives to form more complicated objects. The most common boolean operations employed are union, intersection, and subtraction. Most computer-aided design software packages contain some sort of ability visualize CSG. The typical workflow for the user is as follows: The user specifies the individual primitive components, the user arbitrarily combines each of these primitives with boolean operations, the software generates a CSG tree structure which normally stores these solids implicitly with their defining equation, the tree is traversed and a general algorithm is applied to render the appropriate geometry onto the screen. Algorithms for visualizing CSG have been extensively developed for over a decade. Points sampled from the implicit solids are typically used as input by variations of algorithms like marching cubes and point-cloud surface reconstruction. Here, we explain a surface triangulation method from the graphics community that is being used for surface visualization in the framework of a Monte-Carlo neutron transport code called Mercury.

97 MATHEMATICS AND COMPUTING↗

Triangulations using Phototheodolites

A year before a nuclear test was performed, EG&G would develop a photo plan in which a bomb’s intended point of detonation and all camera positions would be specified. During some of the earlier Operations at the Nevada Test Site, a large number of the nuclear tests were airdrops. Anticipating that the Air Force might miss the intended ground zeros (GZs), EG&G would setup phototheodolites stations at two or more locations that were ~90 degrees apart. The cameras at these stations were special cameras (referred to as phototheodolites or cinetheodolites) that were aimed at the intended ground zero. The cameras were triggered shortly after the detonation in order to capture the fireball at a very early stage. These photographs were then analyzed using a triangulation method to determine the bomb’s actual location and its height of burst (HOB).

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Analysis of Covariance Intersection For Triangulation

In this document I will discuss different implementations of Covariance Intersection (CI) for object triangulation as well as the robustness of CI. For CI methods we will compare the performance of different methods and discuss edge cases which must be considered. For robustness we will focus on the impact of removing sensors on the final fused estimate. Here we look at factors which influence the final fused covariance matrix.

97 MATHEMATICS AND COMPUTING↗