Engineering Papers⌕ Search

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

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↗

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↗

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↗

Local bilinear computation of Jacobi sets

Abstract We propose a novel method for the computation of Jacobi sets in 2D domains. The Jacobi set is a topological descriptor based on Morse theory that captures gradient alignments among multiple scalar fields, which is useful for multi-field visualization. Previous Jacobi set computations use piecewise linear approximations on triangulations that result in discretization artifacts like zig-zag patterns. In this paper, we utilize a local bilinear method to obtain a more precise approximation of Jacobi sets by preserving the topology and improving the geometry. Consequently, zig-zag patterns on edges are avoided, resulting in a smoother Jacobi set representation. Our experiments show a better convergence with increasing resolution compared to the piecewise linear method. We utilize this advantage with an efficient local subdivision scheme. Finally, our approach is evaluated qualitatively and quantitatively in comparison with previous methods for different mesh resolutions and across a number of synthetic and real-world examples.

97 MATHEMATICS AND COMPUTING↗

A Level Set Model for Structured Mesh Representation of Fibrous Preforms used in Composites Manufacturing

Here, a model for implicit representation of fibrous and woven preforms used for composites manufacturing is described. The method is based on a level set function defined on a structured mesh to implicitly capture the complex fiber and weave geometries. Since most software packages used to model woven preforms are based on unstructured mesh, a numerical model for transforming a discretized surface to a structured mesh representation and vice-a-versa is presented. Specific emphasis is on scalable computation of a level set function for large and complex 3D woven structures from a triangulated surface of the smallest unit (yarn). The model is applied to capture a periodic 3D layered 5-harness satin (5HS) weave geometry on a structured mesh. Geometric transformations needed to efficiently compute the level set function for the 3D structure on a high resolution mesh are described. Effects of mesh resolution on the geometric features such as number of resolved fibers, effective fiber size, and the surface area to volume ratio of the iso-surface are analyzed. Using the distance property of the level set function, an approach to evaluate the structure function resulting from transient evolving topology representing densification due to matrix phase depositions is also presented. The approach captures transition of the geometric characteristic from fiber governed at early stages of densification to yarn governed at the terminal stage.

36 MATERIALS SCIENCE↗

ARPIST: Provably accurate and stable numerical integration over spherical triangles

Numerical integration on spherical triangles, including the computation of their areas, is a core computation in geomathematics. The commonly used techniques sometimes suffer from instabilities and significant loss of accuracy. We describe a new algorithm, called ARPIST, for accurate and stable integration of functions on spherical triangles. ARPIST is based on an easy-to-implement transformation to the spherical triangle from its corresponding linear triangle via radial projection to achieve high accuracy and efficiency. More importantly, ARPIST overcomes potential instabilities in computing the Jacobian of the transformation, even for poorly shaped triangles that may occur at poles in regular longitude-latitude meshes, by avoiding potential catastrophic rounding errors. We compare our proposed technique with L’Huilier’s Theorem for computing the area of spherical triangles, and also compare it with the recently developed LSQST method (Beckmann et al., 2014) and a radial-basis-function-based technique (Reeger and Fornberg, 2016) for integration of smooth functions on spherical triangulations. In conclusion, our results show that ARPIST enables better or comparable accuracy over previous methods while being easier to implement, significantly faster, and more tolerant of poor element shapes.

97 MATHEMATICS AND COMPUTING↗

A proteogenomic portrait of lung squamous cell carcinoma

Lung squamous cell carcinoma (LSCC) remains a leading cause of cancer death with few therapeutic options. We characterized the proteogenomic landscape of LSCC, providing a deeper exposition of LSCC biology with potential therapeutic implications. We identify NSD3 as an alternative driver in FGFR1-amplified tumors and low-p63 tumors overexpressing the therapeutic target survivin. SOX2 is considered undruggable, but our analyses provide rationale for exploring chromatin modifiers such as LSD1 and EZH2 to target SOX2-overexpressing tumors. Our data support complex regulation of metabolic pathways by crosstalk between post-translational modifications including ubiquitylation. Numerous immune-related proteogenomic observations suggest directions for further investigation. Proteogenomic dissection of CDKN2A mutations argue for more nuanced assessment of RB1 protein expression and phosphorylation before declaring CDK4/6 inhibition unsuccessful. Finally, triangulation between LSCC, LUAD, and HNSCC identified both unique and common therapeutic vulnerabilities. These observations and proteogenomics data resources may guide research into the biology and treatment of LSCC.

60 APPLIED LIFE SCIENCES↗

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↗

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↗

Machine-to-machine variability of roughness and corrosion in additively manufactured 316L stainless steel

Numerous studies on the corrosion response of metal AM have been conducted. Nonetheless, the specimens being tested are commonly ground or polished to remove the outer as-built surface. If metal AM is truly going to be employed as a transformative technology that can produce complex shapes that do not require traditional machining, then the material needs to be evaluated in the as-built state. The reality is that AM alloys have shown significant inconsistencies regarding as-built surface texture, topology, and residual stress. One metric that has shown significant unpredictability in the literature is the susceptibility to localized corrosion of typically passive alloys, such as stainless steel (SS). There are a large number of studies that have attempted to understand the corrosion response of metal AM materials, but these studies are typically performed on materials that have been printed on a single machine and often mechanically polished to a smooth finish. This study compares the corrosion response of as-built AM, laser-beam powder bed fusion (LB-PBF), 316L SS parts that have been fabricated on five different machines. The majority of this work focused on understanding the susceptibility to localized corrosion of AM metals with respect to machine-dependent variables, namely surface roughness, and build angle. Surface roughness data was collected using scanning white light triangulation, laser scanning confocal microscopy, and coherence scanning interferometry. The results show that there is significant variability (p two-tail < 0.05) in the susceptibility to local corrosion initiation of LB-PBF 316L SS samples built on different machines. Surface oxides were probed with electron dispersive spectroscopy and revealed that variations in local corrosion susceptibility likely arise from differences in the stability of the passive film caused by chemical segregation, unique microstructure, and tortuous roughness features at the as-built surfaces. The variability of roughness and corrosion properties from test samples printed on different machines was corroborated by property measurements performed at five different testing sites, proving reproducibility of the data. Most importantly, this study shows that if the as-built surface layer is removed through grinding or electropolishing the machine-to-machine variation observed in the corrosion susceptibility is reduced.

36 MATERIALS SCIENCE↗

Vision-based inspection of prefabricated components using camera poses: Addressing inherent limitations of image-based 3D reconstruction

Modular construction can lead to additional cost overruns and delays when a defect is found on the construction site and is not easily repairable. Researchers have developed various methods that use image-based 3D reconstruction for quality assessment, but they have inherent limitations, such as inconsistency and dealing with surfaces with reflectivity and limited visual features. Therefore, this paper presents a vision-based quality assessment method using cameras for prefabricated components by addressing these limitations. Specifically, this paper proposes a novel quality inspection method with sub-millimeter accuracy using cameras focused on leveraging camera poses (as opposed to 3D point clouds that are often not consistent in quality) from the image-based 3D reconstruction. The 3D point estimation by computing triangulation was used for achieving accurate measurement. The proposed method is validated using six different variances and two case studies – an aluminum pipe with a reflective surface and a fabricated concrete column. Furthermore, the results demonstrate the accuracy and effectiveness of the proposed method.

42 ENGINEERING↗

Three‐Dimensional Broadband Interferometric Mapping and Polarization (BIMAP‐3D) Observations of Lightning Discharge Processes

Abstract Following on our earlier single‐station, 2‐dimensional (2D) broadband interferometric mapping and polarization (BIMAP) observations of lightning discharges, we recently deployed two BIMAP stations at Los Alamos National Laboratory to map the lightning sources and their polarization in full 3‐dimensional (3D) space (BIMAP‐3D). The two stations are separated by 11.5‐km and each station consists of four antenna sets (instead of three for the original BIMAP) that form a Y ‐shaped array for improved interferometric performance. In this paper, we report the BIMAP‐3D system design, a generalized and analytical 2D interferometry technique for noncoplanar antenna array, a two‐stage 3D mapping technique based on geometric triangulation and baseline‐based differential time of arrival, and a technique to reconstruct the polarization orientation in 3D space by combining the 2D polarization results from the two‐station observations. Along with description of the techniques, we demonstrate and discuss the initial lightning results, including 3D maps for a hybrid intracloud and cloud‐to‐ground flash and for a normal intracloud flash, development of abnormal K‐change leaders, and polarization signatures for a K‐change leader. We find that with the two‐stage 3D mapping techniques, the sources can be located to meters accuracy for a favorable event that occurs between the two stations. We also find the polarization vectors for the example K leader are mostly orthogonal to the leader channel after the full 3D polarization analysis. The main purpose of this paper is to report the BIMAP‐3D techniques and capabilities. Detailed analysis of more specific discharge processes will be reported in later studies.

54 ENVIRONMENTAL SCIENCES↗