Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Contour tree”

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.

17 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Distributed Hierarchical Contour Trees

Contour trees are a significant tool for data analysis as they capture both local and global variation. However, their utility has been limited by scalability, in particular for distributed computation and storage. We report a distributed data structure for storing the contour tree of a data set distributed on a cluster, based on a fan-in hierarchy, and an algorithm for computing it based on the boundary tree that represents only the superarcs of a contour tree that involve contours that cross boundaries between blocks. This allows us to limit the communication cost for contour tree computation to the complexity of the block boundaries rather than of the entire data set.

Carr, Hamish A↗
DOE OSTI2021

Optimization and Augmentation for Data Parallel Contour Trees

Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. Furthermore, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration

Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale using highperformance computing. To address this challenge, recent work has introduced distributed hierarchical contour trees for distributed computation and storage of contour trees. However, effective use of these distributed structures in analysis and visualization requires subsequent computation of geometric properties and branch decomposition to support contour extraction and exploration. In this work, we introduce distributed algorithms for augmentation, hypersweeps, and branch decomposition that enable parallel computation of geometric properties, and support the use of distributed contour trees as query structures for scientific exploration. Finally, we evaluate the parallel performance of these algorithms and apply them to identify and extract important contours for scientific visualization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗
DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization

In topological data analysis and visualization, topological descriptors such as persistence diagrams, merge trees, contour trees, Reeb graphs, and Morse–Smale complexes play an essential role in capturing the shape of scalar field data. Herein we present a state–of–the–art report on scalar field comparison using topological descriptors. We provide a taxonomy of existing approaches based on visualization tasks associated with three categories of data: single fields, time–varying fields, and ensembles. These tasks include symmetry detection, periodicity detection, key event/feature detection, feature tracking, clustering, and structure statistics. Our main contributions include the formulation of a set of desirable mathematical and computational properties of comparative measures, and the classification of visualization tasks and applications that are enabled by these measures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

TopoSZ: Preserving Topology in Error-Bounded Lossy Compression

Existing error-bounded lossy compression techniques control the pointwise error during compression to guarantee the integrity of the decompressed data. However, they typically do not explicitly preserve the topological features in data. When performing post hoc analysis with decompressed data using topological methods, preserving topology in the compression process to obtain topologically consistent and correct scientific insights is desirable. In this paper, we introduce TopoSZ, an error-bounded lossy compression method that preserves the topological features in 2D and 3D scalar fields. Specifically, we aim to preserve the types and locations of local extrema as well as the level set relations among critical points captured by contour trees in the decompressed data. The main idea is to derive topological constraints from contour-tree-induced segmentation from the data domain, and incorporate such constraints with a customized error-controlled quantization strategy from the SZ compressor (version 1.4). In conclusion, our method allows users to control the pointwise error and the loss of topological features during the compression process with a global error bound and a persistence threshold.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Lorentzian contours for tree-level string amplitudes

We engineer compact contours on the moduli spaces of genus-zero Riemann surfaces that achieve analytic continuation from Euclidean to Lorentzian worldsheets. These generalized Pochhammer contours are based on the combinatorics of associahedra and make the analytic properties of tree-level amplitudes entirely manifest for any number and type of external strings. We use them in practice to perform first numerical computations of open and closed string amplitudes directly in the physical kinematics for n=4,5,6,7,8,9 n = 4 , 5 , 6 , 7 , 8 , 9 . We provide a code that allows anyone to do such computations.

Physics↗
DOE OSTI2025

Cuts and contours

The traditional formulation of string amplitudes via worldsheet integrals provides a parametrization of the moduli space that fails to expose the complete singularity structure of the amplitudes. This problem is solved by the positive parametrization of string amplitudes given by surfaceology. In this work, we use this formalism to study a number of properties of string amplitudes at tree-level and one-loop. We introduce several global prescriptions for an integration contour for which the integrals are finite everywhere in kinematic space. At tree-level, this is done in two ways: one directly implements the Feynman iε to analytically continue from Euclidean to Lorentzian worldsheets; the other is a generalization of the closed Pochhammer contour to arbitrary number of points. At loop-level, we present a systematic way of extracting cuts directly from the worldsheet integrand. This provides a powerful set of unitarity constraints, which we use to test the consistency of different “stringy” UV regularizations of field theory amplitudes. In addition, we identify the massive threshold expansion of the integrand, which allows us to reduce the problem to a finite set of Feynman integrals in Schwinger parametrization and provide a straightforward contour prescription reminiscent of its field-theory version.

Bosonic Strings↗
DOE OSTI2025

Smooth splitting and zeros from on-shell recursion

We describe a new approach to understanding the origins of recently discovered “hidden zeros” and “smooth splitting” of tree-level amplitudes in Tr ϕ 3 , Non-Linear Sigma Model (NLSM), Yang-Mill-Scalar (YMS) and the special Galileon. Introducing a new type of linear shift in kinematic space we demonstrate that the mysterious splitting formulae follow from a simple contour integration argument in the style of on-shell recursion. The argument makes use of only standard notions of tree-level factorization on propagators, but assumes improved UV behavior in the form of the absence of a residue at infinity. In the case of Tr ϕ 3 and NLSM this is proven by identifying our shift as a special case of a more general construction called a g-vector shift; in the case of YMS it remains an unproven conjecture. This recursive perspective leads to numerous new results: we derive generalizations of the splitting formulae on more relaxed near-zero kinematics, including interesting new kinematic limits in which the amplitude splits into a triple-product; we also demonstrate that the uncolored special Galileon model has improved UV scaling and hence also splits. We also investigate the possible realization of hidden zeros in four dimensions. The conditions under which the dimensionality constraints are compatible with zero kinematics is investigated in detail for Tr ϕ 3 and YMS; for the latter we find they can be realized only with certain restrictions on external helicity states. The realizable 4d zeros are proven by a similar recursive argument based on BCFW and is found to generalize to a new class of intrinsically 4d “helicity zeros” present in all sectors of YM and also gravity.

effective field theories↗
DOE OSTI2020

Scattering equations in AdS: scalar correlators in arbitrary dimensions

We introduce a bosonic ambitwistor string theory in AdS space. Even though the theory is anomalous at the quantum level, one can nevertheless use it in the classical limit to derive a novel formula for correlation functions of boundary CFT operators in arbitrary space-time dimensions. The resulting construction can be treated as a natural extension of the CHY formalism for the flat-space S-matrix, as it similarly expresses tree-level amplitudes in AdS as integrals over the moduli space of Riemann spheres with punctures. These integrals localize on an operator-valued version of scattering equations, which we derive directly from the ambitwistor string action on a coset manifold. As a testing ground for this formalism we focus on the simplest case of ambitwistor string coupled to two cur- rent algebras, which gives bi-adjoint scalar correlators in AdS. In order to evaluate them directly, we make use of a series of contour deformations on the moduli space of punctured Riemann spheres and check that the result agrees with tree level Witten diagram computations to all multiplicity. We also initiate the study of eigenfunctions of scattering equations in AdS, which interpolate between conformal partial waves in different OPE channels, and point out a connection to an elliptic deformation of the Calogero-Sutherland model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Exploring gauge-fixing conditions with gradient-based optimization

Lattice gauge fixing is required to compute gauge-variant quantities, for example those used in RI-MOM renormalization schemes or as objects of comparison for model calculations. Recently, gauge-variant quantities have also been found to be more amenable to signal-to-noise optimization using contour deformations. These applications motivate systematic parameterization and exploration of gauge-fixing schemes. This work introduces a differentiable parameterization of gauge fixing which is broad enough to cover Landau gauge, Coulomb gauge, and maximal tree gauges. The adjoint state method allows gradient-based optimization to select gauge-fixing schemes that minimize an arbitrary target loss function.

Detmold, William↗
DOE OSTI2024

A double copy from twisted (co)homology at genus one

We study the twisted (co)homology of a family of genus-one integrals — the so called Riemann-Wirtinger integrals. These integrals are closely related to one-loop string amplitudes in chiral splitting where one leaves the loop-momentum, modulus and all but one puncture un-integrated. While not actual one-loop string integrals, they share many properties and are simple enough that the associated twisted (co)homologies have been completely characterized [1]. Using intersection numbers — an inner product on the vector space of allowed differential forms — we derive the Gauss-Manin connection for two bases of the twisted cohomology providing an independent check of [2]. We also use the intersection index — an inner product on the vector space of allowed contours — to derive a double-copy formula for the closed-string analogues of Riemann-Wirtinger integrals (one-dimensional integrals over the torus). Similar to the celebrated KLT formula between open- and closed-string tree-level amplitudes, these intersection indices form a genus-one KLT-like kernel defining bilinears in meromorphic Riemann-Wirtinger integrals that are equal to their complex counterparts.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Loop amplitudes monodromy relations and color-kinematics duality

Color-kinematics duality is a remarkable conjectured property of gauge theory which, together with double copy, is at the heart of a wealth of new developments in scattering amplitudes. So far, its validity has been verified in most cases only empirically, with limited ab initio understanding beyond tree-level. In this paper we provide initial steps in a first-principle understanding of color-kinematics duality and double-copy at loop level, through a detailed analysis of the field-theory limit of the monodromy relations of string theory at one loop. In this limit, we dissect the type of Feynman graphs generated and the relations they obey. We find that graphs with contact-terms are unavoidable and are generated in the field theory limit of “bulk” contours which do not have a standard physical interpretation in string perturbation theory. We show how they are related to ambiguities in the definition of the loop momentum and that their role is precisely to cancel those ambiguities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Shadow of a laser beam

Light, being massless, casts no shadow; under ordinary circumstances, photons pass right through each other unimpeded. Here, we demonstrate a laser beam acting like an object — the beam casts a shadow upon a surface when the beam is illuminated by another light source. We observe a regular shadow in the sense it can be seen by the naked eye, it follows the contours of the surface it falls on, and it follows the position and shape of the object (the laser beam). Specifically, we use a nonlinear optical process involving four atomic levels of ruby. We are able to control the intensity of a transmitted laser beam by applying another perpendicular laser beam. We experimentally measure the dependence of the contrast of the shadow on the power of the laser beam, finding a maximum of approximately 22%, similar to that of a shadow of a tree on a sunny day. We provide a theoretical model that predicts the contrast of the shadow. This work opens new possibilities for fabrication, imaging, and illumination.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

On unitarity of tree-level string amplitudes

Four-particle tree-level scattering amplitudes in string theory are magically consistent with unitarity, reflected in the non-trivial fact that beneath the critical dimension, the residues of the amplitudes on massive poles can be expanded in partial waves with all positive coefficients. While this follows (rather indirectly) from the no-ghost theorem, the simplicity of the statement and its fundamental importance for the physical consistency of string theory begs for a more direct and elementary understanding. In this note we take a step in this direction by presenting a new expression for the partial wave coefficients of string amplitudes, given by surprisingly simple double/triple contour integrals for open/closed strings. This representation allows us to directly prove unitarity of all superstring theories in D ≤ 6 spacetime dimensions, and can also be used to determine various asymptotics of the partial waves at large mass levels.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Low-Cost Aero Technology Demonstrations

The main focus of this work was to demonstrate the use of polymeric additive manufacturing (AM) to create tooling for both preforming and consolidation. Polymeric tooling was utilized where both modest and higher pressures are used for part consolidation. The key focus for the AM tooling development was for fabrication of complex structures such as ducting, C-channel stiffened skins, and airfoils where conventional male tooling would typically be trapped in the cured part. The AM tooling was evaluated for use as a tool master used to fabricate and re-shape deformable/re-formable mandrels based on SpinTech’s shape memory composite technology known as Smart Tooling. The AM tooling was also evaluated for use as a mold for composite infusion and consolidation. Key performance parameters were tracked for project schedule completion with each step comprising of “art to part” cycle time, cost, and model fidelity for dimensions, performance, and cost. The primary focus of this demonstration was to determine if a 50% cost reduction was achievable, for each AM tooling-set, as compared to conventional processes. UDRI leveraged project partner SpinTech, who manufactures tools and parts in these categories and thus provided a baseline regarding current best practices and provided valuable feedback during the entirety of this demonstration. This demonstration primarily focused on the use of AM tooling for fabrication of three composite component structures which are typically utilized in aircraft and comprise salient geometric features of broad interest. These components are often tooling intensive and have features requiring extraction of male tools which are usually trapped by the geometry. The three structures selected by the team included: 1) A one-piece airfoil shell comprised of compound contours where male tooling would be trapped unless the part were manufactured in two halves as is typically the case. 2) A one-piece duct used for air handling, comprised of compound contours where male tooling would be trapped unless the part were manufactured in two halves, or a washout mandrel were to be used. 3) A co-cured C-channel stiffened skin where typically C-channels would be individually manufactured and then bonded to a cured skin. The demonstration was comprised of three main tasks: • Task 1: AM Tool Feasibility Study – ensure the AM tooling meets the performance requirements as specified by SpinTech to match baseline performance. • Task 2: Complex Tool Demonstration – Fabricate tooling, preforms, and parts representative of an airfoil and duct. • Task 3: Large Aerostructure Fabrication Demonstration – Fabricate tooling, preforms, and part representative of a C-channel stiffened skin. With the conclusion of this project, a decision tree was developed to determine the key considerations necessary to determine if use of AM tooling for the three selected structures was able to attain the same quality as historically achieved on metallic tooling, while providing a significant cost reduction.

36 MATERIALS SCIENCE↗