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 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 OSTI2025

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

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

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

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

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

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

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗
DOE OSTI2025

Sharp front tracking with geometric interface reconstruction

Here, this paper presents a novel sharp front-tracking method designed to address limitations in classical front-tracking approaches, specifically their reliance on smooth interpolation kernels and extended stencils for coupling the front and fluid mesh. In contrast, the proposed method employs exclusively sharp, localized interpolation and spreading kernels, restricting the coupling to the interfacial fluid cells–those containing the interface/front. This localized coupling is achieved by integrating a divergence-preserving velocity interpolation method with a piecewise parabolic interface calculation (PPIC) and a polyhedron intersection algorithm to compute the indicator function and local interface curvature. Surface tension is computed using the Continuum Surface Force (CSF) method, maintaining consistency with the sharp representation. Additionally, we propose an efficient local roughness smoothing implementation to account for surface mesh undulations, which is easily applicable to any triangulated surface mesh. Building on our previous work, the primary innovation of this study lies in the localization of the coupling for both the indicator function and surface tension calculations. By reducing the interface thickness on the fluid mesh to a single cell, as opposed to the 4–5 cell spans typical in classical methods, the proposed sharp front-tracking method achieves a highly localized and accurate representation of the interface. This sharper representation mitigates parasitic currents and improves force balancing, making it particularly suitable for scenarios where the interface plays a critical role, such as microfluidics, fluid-fluid interactions, and fluid-structure interactions. The proposed method is comprehensively validated and tested on canonical interfacial flow problems, including stationary and translating Laplace equilibria, oscillating droplets, and rising bubbles. The presented results demonstrate that the sharp front-tracking method significantly outperforms the classical approach in terms of accuracy, stability, and computational efficiency. Notably, parasitic currents are reduced by approximately two orders of magnitude and stable results are obtained for parameter ranges where classical front tracking fails to converge.

42 ENGINEERING↗
DOE OSTI2025

BCFW tilings and cluster adjacency for the amplituhedron

In 2005, Britto, Cachazo, Feng, and Witten gave a recurrence (now known as the BCFW recurrence) for computing scattering amplitudes in N = 4 super Yang–Mills theory. Arkani-Hamed and Trnka subsequently introduced the amplituhedron to give a geometric interpretation of the BCFW recurrence. Arkani-Hamed and Trnka conjectured that each way of iterating the BCFW recurrence gives a “triangulation” or “tiling” of the m=4 amplituhedron. In this article, we prove the BCFW tiling conjecture of Arkani-Hamed and Trnka. We also prove the cluster adjacency conjecture for BCFW tiles of the amplituhedron, which says that facets of tiles are cut out by collections of compatible cluster variables for the Grassmannian Gr4,n. Moreover we show that each BCFW tile is the subset of the Grassmannian where certain cluster variables have particular signs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Dark matter substructure or source model systematics? A case study of cluster lens Abell S1063

Mapping the small-scale structure of the universe through gravitational lensing is a promising tool for probing the particle nature of dark matter. Curved Arc Basis (CAB) has been proposed as a local lensing formalism in galaxy clusters, with the potential to detect low-mass dark matter substructure. In this work, we analyse the cluster lens Abell S1063 in search of dark matter substructure with the CAB formalism, using multiband imaging data from James Webb Space Telescope ( JWST ). We use two different source modelling methods: shapelets and pixel-based source reconstruction based on Delaunay triangulation. We find that source modelling systematics from shapelets result in a disagreement between CAB parameters measured from different filters. Source modelling with Delaunay significantly alleviates this systematic, as seen in the improvement in agreement across filters. We also find that inadequate complexity in source modelling can result in convincing spurious detections of dark matter substructure from strong gravitational lenses, as seen by our $\Delta \text{BIC} > 20$ measurement of a $M \sim 10^{10}$ ${\rm M}_{\odot }$ subhalo with shapelets, a spurious detection that is not reproduced with Delaunay source modelling. We demonstrate that multiband analysis with different JWST filters is key for disentangling source and lens model systematics from dark matter substructure detections.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Dynamical dark energy from lattice quantum gravity

We study the behavior of the vacuum in Euclidean dynamical triangulations (EDT). Algorithmic improvements and better lattice spacing determinations allow us to test the properties of the emergent de Sitter geometries of our simulations to higher precision than previously possible. Although the agreement with de Sitter is good, the improved precision reveals deviations that can be interpreted as nontrivial vacuum dynamics, well described by a cosmological constant that runs with scale. The simulations show that the dominant running is quadratic and that the scale can be identified with the Hubble rate. Several key cross-checks support this picture, including consistent results across multiple lattice spacings and the fact that the null energy condition is not violated. The parameters of the running are fully determined by simulations, enabling predictions when extrapolated to the scales relevant for our Universe. This leads to a model for dark energy that is compatible with current observations, but which predicts deviations from the Standard Model of cosmology at the 𝒪⁡(10 −3 ) level in observables that could be tested with future improvements in precision measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Supersymmetric lattice theories on curved space

We show how to construct Hamiltonian lattice theories with one exact supersymmetry on arbitrary triangulations of curved space in any number of dimensions. Both bosons and fermions satisfy discrete Kähler-Dirac equations. The quantization of the fermions proceeds by imposing conventional anticommutation relations while the bosons require a modification of the usual canonical commutator. On regular lattices we construct parity, time reversal and translation-by-one (shift) symmetries. We argue that the latter are generically noninvertible symmetries. We also show how to couple these degrees of freedom to background gauge fields which leads to a theory with enhanced supersymmetry.

Anomalies↗
DOE OSTI2024

Localized Evaluation for Constructing Discrete Vector Fields

Topological abstractions offer a method to summarize the behavior of vector fields, but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach, which constructs a collection of pairs of simplices in the input mesh that satisfies criteria introduced by Forman's discrete Morse theory. While numerous approaches exist to compute pairs in the restricted case of the gradient of a scalar field, state-of-the-art algorithms for the general case of vector fields require expensive optimization procedures. This paper introduces a fast, novel approach for pairing simplices of two-dimensional, triangulated vector fields that do not vary in time. The key insight of our approach is that we can employ a local evaluation, inspired by the approach used to construct a discrete gradient field, where every simplex in a mesh is considered by no more than one of its vertices. Specifically, we observe that for any edge in the input mesh, we can uniquely assign an outward direction of flow. We can further expand this consistent notion of outward flow at each vertex, which corresponds to the concept of a downhill flow in the case of scalar fields. Working with outward flow enables a linear-time algorithm that processes the (outward) neighborhoods of each vertex one-by-one, similar to the approach used for scalar fields. Here, we couple our approach to constructing discrete vector fields with a method to extract, simplify, and visualize topological features. Empirical results on analytic and simulation data demonstrate drastic improvements in running time, produce features similar to the current state-of-the-art, and show the application of simplification to large, complex flows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Stereo Cameras for Clouds (STEREOCAM) Instrument Handbook

The three pairs of stereo camera setups aim to provide synchronized and stereo calibrated time series of images that can be used for 3D cloud mask reconstruction. Each camera pair is positioned at approximately 120 degrees from the other pair, with a 17o-19o pitch angle from the ground, and at 5-6 km distance from the U.S. Department of Energy (DOE) Central Facility at the Atmospheric Radiation Measurement (ARM) Climate Research Facility Southern Great Plains (SGP) observatory to cover the region from northeast, northwest, and southern views. Images from both cameras of the same stereo setup can be paired together to obtain 3D reconstruction by triangulation. 3D reconstructions from the ring of three stereo pairs can be combined together to generate a 3D mask from surrounding views. This handbook delivers all stereo reconstruction parameters of the cameras necessary to make 3D reconstructions from the stereo camera images.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Automatic Image Point Matching

Sparse Image Point Matching (SIPM) is a foundational technology for photo triangulation, structure from motion (SfM), Simultaneous Location and Mapping (SLAM), and data fusion. The goal of the matching is to automatically generate sets of image coordinates that identify the same feature across images. Ideally, the process should be robust to lighting, scale, perspective, and modality changes. The scope of the image matching topic in the field of remote sensing (RS) is enormous because of the variety of collection platforms, modalities, sensor types, applications, and subjects. In this work, we report the history of and assess the state of the art of visible-spectrum (panchromatic and color) image matching of the Earth’s surface. Work specific to large-format images (LFI) (e.g., metric aerial cameras and Earth-observing satellites) will be highlighted. However, the state of the art in this century will mostly be traced through machine vision research and benchmarks because research specific to LFI is rare.

97 MATHEMATICS AND COMPUTING↗