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 37 records · Page 2

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↗

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↗

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↗

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↗

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↗

High-throughput identification of novel heat tolerance genes via genome-wide pooled mutant screens in the model green alga Chlamydomonas reinhardtii

Different high temperatures adversely affect crop and algal yields with various responses in photosynthetic cells. The list of genes required for thermotolerance remains elusive. Additionally, it is unclear how carbon source availability affects heat responses in plants and algae. Here, we utilized the insertional, indexed, genome-saturating mutant library of the unicellular, eukaryotic green alga Chlamydomonas reinhardtii to perform genome-wide, quantitative, pooled screens under moderate (35°C) or acute (40°C) high temperatures with or without organic carbon sources. We identified heat-sensitive mutants based on quantitative growth rates and identified putative heat tolerance genes (HTGs). By triangulating HTGs with heat-induced transcripts or proteins in wildtype cultures and MapMan functional annotations, we presented a high/medium-confidence list of 933 Chlamydomonas genes with putative roles in heat tolerance. Triangulated HTGs include those with known thermotolerance roles and novel genes with little or no functional annotation. About 50% of these high-confidence HTGs in Chlamydomonas have orthologs in green lineage organisms, including crop species. Arabidopsis thaliana mutants deficient in the ortholog of a high-confidence Chlamydomonas HTG were also heat sensitive. This work expands our knowledge of heat responses in photosynthetic cells and provides engineering targets to improve thermotolerance in algae and crops.

59 BASIC BIOLOGICAL SCIENCES↗

MOOSE Framework Meshing Enhancements to Support Reactor Analysis

MOOSE-based physics codes require an input finite element mesh on which the physics solution is calculated, reported, and transferred to other physics codes. The use of difficult-touse, external licensed software is often required to generate high quality meshes for reactor geometries. High-fidelity geometry modeling also requires elaborate tracking of groups of elements for material property assignment and output reporting which can be considerably complex for the user to identify and maintain. Under the U.S. Department of Energy Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, several meshingrelated enhancements have been developed for the MOOSE framework to address user challenges in creating finite element meshes for advanced reactor geometries. MOOSE mesh generators have been developed to mesh hexagonal geometries (pins, ducted assemblies, and cores) commonly found in liquid-metal cooled fast reactor concepts. The mesh generator used for hexagonal pin cells is generic for regular polygons and therefore may also be used for Cartesian pin cells. Hexagonal pin cells can be stitched into ducted assemblies, and assemblies can be stitched together into a core. The user may specify region ids, region names, and other preferences on the mesh. This control is useful for later material mapping in the MOOSE-based physics codes input. A capability was also developed for meshing rotating control drums including determination of material volume fractions in each mesh element as a function of time. Control drum meshes may be stitched to other hexagonal assemblies to create a core configuration. Additional mesh generators were developed that wrap around the hexagonal meshing capabilities and utilize “extra element integer” ID values on each element. In regular Cartesian or hexagonal assemblies or cores, the bookkeeping of element groups for both material assignment and output reporting can now be automated through assignment of pin, assembly, core, axial and depletion id values stored as extra element integers. The extra element tags on the mesh greatly speed the reactor analyst’s efforts to map materials to meshes, track depletion zones, and parse output such as axial pin power distributions. At the highest level, pin, assembly, and core mesh generators (with this reactor terminology) have also been developed to easily generate regular Cartesian and hexagonal cores, including axial extrusion. These reactor geometry builders call upon the previously mentioned capabilities to produce analysis-ready 3D meshes including material assignments. Open source mesh triangulation capabilities were also investigated for integration into the MOOSE framework to address the need for meshing the core periphery region which extends from the irregular outer assembly border to a cylindrical boundary. Options are limited due to licensing constraints, and the recommendation is pursue building a native MOOSE Delaunay triangulator routine with full functionality. Finally, a series of verification problems were performed with NEAMS physics tools. All developed capabilities will be available in the new open-source “Reactor” module of the MOOSE framework, which is accessible to any MOOSE-based NEAMS physics tool.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Ising on $\mathbb{S}^2$-- The Affine Conjecture

We review the recent construction \cite{brower2024isingmodelmathbbs2} of the 2d Ising model on a triangulated sphere $\mathbb{S}^2$. Surprisingly, this led to a precise map of the lattice couplings to the target geometry in order to reach the conform field theory (CFT) in the continuum limit. For the integrable 2d Ising CFT, the map was found analytically \cite{Brower_2023}. Here we conjecture how this might be generalized. The discrete geometry is implemented by the piecewise flat triangulation introduced by Regge in 1960 for the Einstein Hilbert action \cite{Regge1961GeneralRW}. Then following our Ising example, we posit the existence of a smooth map of lattice couplings in affine parameters consistent with quantum correlators. A sequence of theoretical investigations and numerical simulations are recommended to test this conjecture. They begin with non-integrable CFT's -- the 2d $\phi^4$ theory on $\mathbb{S}^2$; the 3d Ising model on $\mathbb{S}^3$ and $\mathbb{R} \times \mathbb{S}^2$; QED3 on $\mathbb{R} \times \mathbb{S}^{2} $ as an intermediate step to 4d non-Abelian lattice gauge theory on $\mathbb{R} \times \mathbb{S}^3$.

Brower, Richard C. [Boston U.] (ORCID:000000028185↗

T RI M E ++: Multi-threaded triangular meshing in two dimensions

We present T RI M E ++, a multi-threaded software library designed for generating two-dimensional meshes for intricate geometric shapes using the Delaunay triangulation. Multi-threaded parallel computing is implemented throughout the meshing procedure, making it suitable for fast generation of large-scale meshes. Three iterative meshing algorithms are implemented: the DistMesh algorithm, the centroidal Voronoi diagram meshing, and a hybrid of the two. We compare the performance of the three meshing methods in T RI M E ++, and show that the hybrid method retains the advantages of the other two. The software library achieves significant parallel speedup when generating large-scale meshes containing between 10 4 to 10 7 points. T RI M E ++ can handle complicated geometries and generates adaptive meshes of high quality.

97 MATHEMATICS AND COMPUTING↗

Data-driven Event Identification in the U.S. Power Systems Based on 2D-OLPP and RUSBoosting Trees

Accurate event identification is an essential part of situation awareness ability for power system operators. Therefore, this work proposes an integrated event identification algorithm for power systems. First, to obtain and filter suitable inputs for event identification, an event detection trigger based on the rate of change of frequency (RoCoF) is presented. Then, the wave arrival time difference-based triangulation method considering the anisotropy of wave propagation speed is utilized to estimate the location of the detected event. Next, the two-dimensional orthogonal locality preserving projection (2D-OLPP)-based method, which is suitable for multiple types of measured data, is employed to achieve higher effectiveness in extracting the event features compared with traditional one-dimensional projection and principle component analysis (PCA). Finally, the random undersampling boosted (RUSBoosted) trees-based classifier, which can mitigate the data sample imbalance issue, is utilized to identify the type of the detected event. Furthermore, the proposed approach is demonstrated using the actual measurement data of U.S. power systems from FNET/GridEye. Comparison results show that the proposed event identification algorithm can achieve better performance than existing approaches.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Enhancing Early Systems R&D Capabilities with Systems —Theoretic Process Analysis

Systems engineering today faces a wide array of challenges, ranging from new operational environments to disruptive technological — necessitating approaches to improve research and development (R&D) efforts. Yet, emphasizing the Aristotelian argument that the “whole is greater than the sum of its parts” seems to offer a conceptual foundation creating new R&D solutions. Invoking systems theoretic concepts of emergence and hierarchy and analytic characteristics of traceability, rigor, and comprehensiveness is potentially beneficial for guiding R&D strategy and development to bridge the gap between theoretical problem spaces and engineering-based solutions. In response, this article describes systems–theoretic process analysis (STPA) as an example of one such approach to aid in early-systems R&D discussions. STPA—a ‘top-down’ process that abstracts real complex system operations into hierarchical control structures, functional control loops, and control actions—uses control loop logic to analyze how control actions (designed for desired system behaviors) may become violated and drive the complex system toward states of higher risk. By analyzing how needed controls are not provided (or out of sequence or stopped too soon) and unneeded controls are provided (or engaged too long), STPA can help early-system R&D discussions by exploring how requirements and desired actions interact to either mitigate or potentially increase states of risk that can lead to unacceptable losses. This article will demonstrate STPA's benefit for early-system R&D strategy and development discussion by describing such diverse use cases as cyber security, nuclear fuel transportation, and US electric grid performance. Together, the traceability, rigor, and comprehensiveness of STPA serve as useful tools for improving R&D strategy and development discussions. In conclusion, leveraging STPA as well as related systems engineering techniques can be helpful in early R&D planning and strategy development to better triangulate deeper theoretical meaning or evaluate empirical results to better inform systems engineering solutions.

42 ENGINEERING↗

History of the Beer Game

This article describes the history of the Beer Game. By triangulating information from literature, archival analysis, and interviews with experts in the field, the main changes in the game over its almost 70-year history are identified. The article discusses three aspects of the game: 1) its structure (phases of its history, stocks and flows, parameters, etc.); 2) the process for playing the game; and 3) the game debrief. The structure of the Beer Game, and the process for running it, have stabilized over the years into what is now a de facto standard approach. Additional work is needed in the game debrief, specifically in the clarification of key insights and messages (depending on the context of the use of the game), in how to communicate such messages to different audiences, and in the development of support materials for its delivery. © 2024 UChicago Argonne, LLC. System Dynamics Review published by John Wiley & Sons Ltd on behalf of System Dynamics Society.

97 MATHEMATICS AND COMPUTING↗

Coarse-grained fixed-point tensor networks and holographic reflected entropy in 3D gravity

We use the framework of fixed-point BCFT tensor networks to present a microscopic CFT derivation of the correspondence between reflected entropy (RE) and entanglement wedge cross section (EW) in AdS 3 /CFT 2 , for both bipartite and multipartite settings. These fixed-point tensor networks, obtained by triangulating Euclidean CFT path integrals, allow us to explicitly construct the canonical purification via cutting-and-gluing CFT path integrals. Employing modular flow in the large-c limit, we demonstrate that these intrinsic CFT manipulations reproduce bulk geometric prescriptions, without assuming the AdS/CFT dictionary. The emergence of bulk geometry is traced to coarse-graining over heavy states in the large-c limit. Universal coarse-grained BCFT data for compact 2D CFTs, through the relation to Liouville theory with ZZ boundary conditions, yields hyperbolic geometry on the Cauchy slice. The corresponding averaged replica partition functions reproduce all candidate EWs, arising from different averaging patterns, with the dominant one providing the correct RE and EW. In this way, many heuristic tensor-network intuitions in toy models are made precise and established directly from intrinsic CFT data.

AdS-CFT correspondence↗

Towards the Gravituhedron: new expressions for NMHV gravity amplitudes

In this paper, we present new expressions for n-point NMHV tree-level gravity amplitudes. We introduce a method of factorization diagrams which is a simple graphical representation of R-invariants in Yang-Mills theory. We define the gravity analogues which we call G-invariants, and expand the NMHV gravity amplitudes in terms of these objects. We provide explicit formulas of NMHV gravity amplitudes up to eight points in terms of G-invariants, and give the general definition for any number of points. We discuss the connection to BCFW representation, special behavior under large momentum shift, the role of momentum twistors and the intricate web of spurious poles cancelation. Because of the close connection between R-invariants and the (tree-level) Amplituhedron for Yang-Mills amplitudes, we speculate that the new expansion for gravity amplitudes should correspond to the triangulation of the putative Gravituhedron geometry.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A spectral metric for collider geometry

By quantifying the distance between two collider events, one can triangulate a metric space and reframe collider data analysis as computational geometry. One popular geometric approach is to first represent events as an energy flow on an idealized celestial sphere and then define the metric in terms of optimal transport in two dimensions. In this paper, we advocate for representing events in terms of a spectral function that encodes pairwise particle angles and products of particle energies, which enables a metric distance defined in terms of one-dimensional optimal transport. This approach has the advantage of automatically incorporating obvious isometries of the data, like rotations about the colliding beam axis. It also facilitates first-principles calculations, since there are simple closed-form expressions for optimal transport in one dimension. Up to isometries and event sets of measure zero, the spectral representation is unique, so the metric on the space of spectral functions is a metric on the space of events. At lowest order in perturbation theory in electron-positron collisions, our metric is simply the summed squared invariant masses of the two event hemispheres. Going to higher orders, we present predictions for the distribution of metric distances between jets in fixed-order and resummed perturbation theory as well as in parton-shower generators. Finally, we speculate on whether the spectral approach could furnish a useful metric on the space of quantum field theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Cluster bootstrap for cosmological correlators

We show that cosmological wavefunction coefficients associated with n-site chain and loop graphs for a cubic scalar theory in de Sitter spacetime have symbol alphabets given by subsets of A 2n−2 and B 2n−1 cluster variables, respectively, and satisfy the associated cluster adjacency properties. The key step in proving this is identifying a precise connection between graph “tubings” that appear in the kinematic flow equation and polygon “triangulations” that encode the combinatorics of cluster compatibility. Our results imply that cosmological wavefunction coefficients in a general power-law FRW cosmology satisfy cluster adjacency to all orders in the ϵ expansion around the de Sitter limit. We use this information as bootstrap input to show that de Sitter symbols for n ≤ 4 are uniquely determined by simple physical constraints.

differential and algebraic geometry↗

Open-closed 3d gravity as a random ensemble

We investigate an ensemble of boundary CFTs within the framework of a tensor model recently constructed to model 3d quantum gravity. The incorporation of CFT borders introduces new elements to the gravity theory. In particular, it leads to an open-closed extension of Virasoro TQFT, which in the classical limit gives rise to 3d gravity with tensionful end-of-the-world branes. It also provides predictions for off-shell manifolds with bordered asymptotic boundaries, such as the annulus wormhole. As an application, we construct a purely open variant of the tensor model to study a purely open bootstrap problem in the context of CFT triangulation. We also briefly discuss the extension to non-orientable CFTs.

AdS-CFT correspondence↗

Brill-Noether-general limit root bundles: absence of vector-like exotics in F-theory Standard Models

Root bundles appear prominently in studies of vector-like spectra of 4d F-theory compactifications. Of particular importance to phenomenology are the Quadrillion F-theory Standard Models (F-theory QSMs). In this work, we analyze a superset of the physical root bundles whose cohomologies encode the vector-like spectra for the matter representations ($3$, $2$) 1/6 , ($\overline{3}$, $1$) -2/3 and ($1$, $1$) 1 . For the family B 3 (Δ$^{°}_{4}$) consisting of $\mathcal{O}$(10 11 ) F-theory QSM geometries, we argue that more than 99.995% of the roots in this superset have no vector-like exotics. This indicates that absence of vector-like exotics in those representations is a very likely scenario in the O(10 11 ) QSM geometries B 3 (Δ$^{°}_{4}$). The QSM geometries come in families of toric 3-folds B 3 (Δ°) obtained from triangulations of certain 3-dimensional polytopes Δ°. The matter curves in X Σ $\large{ϵ}$ B 3 (Δ°) can be deformed to nodal curves which are the same for all spaces in B 3 (Δ°). Therefore, one can probe the vector-like spectra on the entire family B 3 (Δ°) from studies of a few nodal curves. We compute the cohomologies of all limit roots on these nodal curves. In our applications, for the majority of limit roots the cohomologies are determined by line bundle cohomology on rational tree-like curves. For this, we present a computer algorithm. The remaining limit roots, corresponding to circuit-like graphs, are handled by hand. The cohomologies are independent of the relative position of the nodes, except for a few circuits. On these jumping circuits, line bundle cohomologies can jump if nodes are specially aligned. This mirrors classical Brill-Noether jumps. B 3 (Δ°) admits a jumping circuit, but the root bundle constraints pick the canonical bundle and no jump happens.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗