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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

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↗
DOE OSTI2024

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↗
DOE OSTI2024

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↗
DOE OSTI2023

Toddler home math environment: Triangulating multi-method assessments in a U.S. Sample

Introduction Current research has documented the home math environment (HME) of preschoolers and kindergarteners. Very few studies, however, have explored the number and spatial activities in which parents engage with children during their toddler years. Methods This study examined the HME of 157 toddlers using several methodologies, including surveys, time diaries, and observations of math talk. Further, it examined correlations within and across data sources to identify areas of convergence and triangulation, and correlated HME measures with measures of toddlers’ number and spatial skills. Results Findings showed that, in general, uses of different types of math activities, including both number and spatial, were intercorrelated within method. Across methods, there was high intercorrelation between the frequency of math activities reported on parent surveys and the diversity of types of math activities endorsed in time diary interviews. Parent math talk gleaned from semi-structured interviews functioned as a separate aspect of the HME; different types of math talk shared few intercorrelations with engagement in math activities as reported in either surveys or time diaries. Finally, several HME measures positively correlated with toddlers’ math skills. Discussion Given extant research demonstrating that both math activities and math talk predict children’s math skills, our results stress the need for multimethod studies that differentiate among these HME opportunities.

Miller, Portia↗
DOE OSTI2022

Practical Event Location Estimation Algorithm for Power Transmission System Based on Triangulation and Oscillation Intensity

Event location in power systems is quite essential information for system operators to enhance control-room situational awareness capability. Therefore, it is of great importance to develop an event location estimation algorithm for transmission systems with high accuracy. With the development of wide-area measurement system (WAMS) such as FNET/GridEye, and the synchrophasor measurement devices (SMDs) such as frequency disturbance recorders (FDRs), the synchronous measurement data including frequency, voltage amplitude and phase angle can be collected and used for event location estimation. First, the phase angle and rate of change of frequency (RoCoF) trajectories are respectively used for determining two sets of wave arrival time associated with each FDR. Then, a convolutional neural network (CNN) is utilized to determine the wave arrival order to select the more suitable set of wave arrival times for a given case and to perform corresponding modifications. Next, the oscillation intensity associated with each FDR is determined based on phase angle trajectories in the center of inertia (COI) coordinate system. Finally, the multiple criteria for event location estimation are represented. In conclusion, case studies and comparisons between the proposed and previous algorithms using actual and confirmed cases in U.S. power systems are performed to demonstrate the effectiveness and improvement of the proposed algorithm in practical applications.

frequency disturbance recorder (FDR)↗
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↗
DOE OSTI2022

Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP

Point set registration algorithms such as Iterative Closest Point (ICP) are commonly utilized in time-constrained environments like robotics. Finding the nearest neighbor of a point in a reference 3D point set is a common operation in ICP and frequently consumes at least 90% of the computation time. We introduce a novel approach to performing the distance-based nearest neighbor step based on Delaunay triangulation. This greedy algorithm finds the nearest neighbor of a query point by traversing the edges of the Delaunay triangulation created from a reference 3D point set. Our work integrates the Delaunay traversal into the correspondences search of ICP and exploits the iterative aspect of ICP by caching previous correspondences to expedite each iteration. An algorithmic analysis and comparison is conducted showing an order of magnitude speedup for both serial and vector processor implementation.

3d point cloud processing↗