Topics in Computational Geometry
Explore the source record for details and available documents.
Zolnowsky, J.↗
SEARCH · Search NASA
Results for “Computational geometry”
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.
Computing Geometry as a Mathematician in an Engineering Laboratory.
Abstract not provided.
Mitchell, Scott↗
Fluctuating Hydrodynamic Methods for Fluid-Structure Interactions in Confined Channel Geometries
Computational methods are developed for the study of fluid-structure interactions subject to thermal fluctuations when conned within channels having slit-like geometry. The methods take into account the hydrodynamic coupling and diusivity of microstructures when influenced by their proximity to no-slip walls. We develop stochastic numerical methods subject to no-slip boundary conditions using a staggered nite volume discretization. We show that by imposing an exact fluctuation-dissipation condition to discretize the stochastic driving elds combined with using an exact projection method to enforce incompressibility is sucient to ensure results consistent with statistical mechanics. We demonstrate our methods by investigating how the proximity of ellipsoidal colloids to the channel wall eects their active hydrodynamic responses and passive diusivity. We also study the collective dynamics of a large number of particles by considering the intermediate scattering functions for the relaxation of density fluctuations. We expect our introduced stochastic computational methods to be applicable broadly to applications in which confinement effects play an important role in the dynamics of microstructures subject to hydrodynamic coupling and thermal fluctuations. uctuations.
Wang, Yaohong↗
Landau Singularities Revisited: Computational Algebraic Geometry for Feynman Integrals
We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the standard model in dimensional regularization. After highlighting issues in the textbook treatment of Landau singularities, we develop an algorithm for classifying and computing them using techniques from computational algebraic geometry. We introduce an algebraic variety called the principal Landau determinant, which captures the singularities even in the presence of massless particles or UV/IR divergences. We illustrate this for 114 example diagrams, including a cutting-edge 2-loop 5-point nonplanar QCD process with multiple mass scales. Published by the American Physical Society 2024
Physics↗
Fast and accurate normalization of vectors and quaternions
We present fast and accurate ways to normalize two and three-dimensional vectors and quaternions and compute their length. Our approach is an adaptation of ideas used in the linear algebra library LAPACK, and we believe that the computational geometry and computer-aided design communities are not aware of the possibility of speeding up these fundamental operations in the robust way proposed here.
97 MATHEMATICS AND COMPUTING↗
Fast and Accurate Intersections on a Sphere
We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.
Environmental sciences↗
Community-Driven Methods for Open and Reproducible Software Tools for Analyzing Datasets from Atom Probe Microscopy
Atom probe tomography, and related methods, probe the three-dimensional architecture of a material. The software tools that microscopists use, and how these tools are connected into workflows, makes a substantial contribution to the accuracy and precision of such a material characterization experiment. Typically, we adapt methods from other communities like mathematics, data science, computational geometry, artificial intelligence, or scientific computing. We also realize that improving on research data management is a challenge when it comes to align with the FAIR data stewardship principles. Faced with this global challenge, we are convinced that collaborating is useful. Here, we report the results and challenges with an inter-laboratory call for developing test cases for several types of atom probe software tools. The results support why defining detailed recipes of software workflows and sharing these recipes is necessary and rewarding: Open source tools and (meta)data exchange can help to make our day-to-day data processing tasks become more efficient, the training of new users and knowledge transfer become easier, and assist us with automated quantification of uncertainties to gain access to substantiated results.
36 MATERIALS SCIENCE↗
A Geometry-Driven Longitudal Topic Model
A simple and scalable framework for longitudinal analysis of Twitter data is developed that combines latent topic models with computational geometric methods. Dimensionality reduction tools from computational geometry are applied to learn the intrinsic manifold on which the latent, temporal topics reside. Then shortest path distances on the manifold are used to link together these topics. The proposed framework permits visualization of the low-dimensional embedding which provides clear interpretation of the complex, high-dimensional trajectories that may exist among latent topics. Practical application of the proposed framework is demonstrated through its ability to capture and effectively visualize natural progression of latent COVID-19 related topics learned from Twitter data. Interpretability of the trajectories is achieved by comparing to real-world events. In addition, the framework permits study of spatial variation in Twitter behavior for learned topics. The analysis demonstrates that the proposed framework is able to capture granular-level impact of COVID-19 on public discussions. We end by arguing that Twitter data, when analyzed within the proposed framework, can serve as a valuable supplementary data stream for COVID-related studies.
97 MATHEMATICS AND COMPUTING↗
An extension to V ORO ++ for multithreaded computation of Voronoi cells
V ORO ++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. V ORO ++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that it can achieve parallel efficiencies greater than 95% in many cases. Further, the multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million particles.
97 MATHEMATICS AND COMPUTING↗
Efficient Delaunay Tessellation through K-D Tree Decomposition
Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly distribute points among processes and compare two strategies for picking split points between domain regions. Because resulting point distributions no longer satisfy the assumptions of existing parallel Delaunay algorithms, we develop a new parallel algorithm that adapts to its input and prove its correctness. We evaluate the new algorithm using two late-stage cosmology datasets. The new running times are up to 50 times faster using k-d tree compared with regular grid decomposition. Moreover, in the unbalanced data sets, decomposing the domain into a k-d tree is up to five times faster than decomposing it into a regular grid.
Morozov, Dmitriy↗
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↗
A massively-parallel, unstructured overset method for mesh connectivity
Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.
97 MATHEMATICS AND COMPUTING↗
Comparison of nested geometry treatments within GPU-based Monte Carlo neutron transport simulations of fission reactors
Monte Carlo (MC) neutron transport provides detailed estimates of radiological quantities within fission reactors. This involves tracking individual neutrons through a computational geometry. CPU-based MC codes use multiple polymorphic tracker types with different tracking algorithms to exploit the repeated configurations of reactors, but virtual function calls have high overhead on the GPU. The Shift MC code was modified to support GPU-based tracking with three strategies: dynamic polymorphism with virtual functions, static polymorphism, and a single tracker type with tree-based acceleration. On the Frontier supercomputer these methods achieve 77.8%, 91.2%, and 83.4%, respectively, of the tracking rate obtained using a specialized tracker optimized for rectilinear-grid-based reactors. This indicates that all three methods are suitable for typical reactor problems in which tracking does not dominate runtime. The flexibility of the single tracker method is highlighted with a hexagonal-grid microreactor problem, performed without hexagonal-grid-specific tracking routines, providing a 2.19× speedup over CPU execution.
97 MATHEMATICS AND COMPUTING↗
Kinetics of particles with short-range interactions
Self-assembly is one of the grand challenges of the 21st century – as the devices and materials we would like to build become too complex or small-scale for top-down manufacturing to be efficient, it is increasingly important to find ways to create these through bottom-up, dynamical approaches. Many particles used in self-assembly have very short-ranged attractive interactions, making simulations expensive or impossible. This proposal develops a set of conceptual and computational tools to study the dynamics of self-assembly for particles with short-ranged interactions, harnessing ideas in differential and computational geometry, and stochastic analysis, to accelerate simulations.
74 ATOMIC AND MOLECULAR PHYSICS↗
A tensor train-based isogeometric solver for large-scale 3D poisson problems
We introduce a three-dimensional (3D), fully tensor train (TT) assembled isogeometric analysis (IGA) framework, TT-IGA, for solving partial differential equations (PDEs). Our method reformulates IGA discrete operators into TT format, enabling efficient compression and computation. Geometry evaluations use the original NURBS description at sampling points and TT approximation is applied to geometry-derived coefficient fields and discrete operators. We demonstrate the effectiveness of the proposed TT-IGA framework on the three-dimensional Poisson equation, achieving substantial reductions in memory and computational cost without compromising solution quality.
97 MATHEMATICS AND COMPUTING↗
Simulations of the effects of proppant placement on the conductivity and mechanical stability of hydraulic fractures
Here, we generate a wide range of models of proppant-packed fractures using discrete element simulations, and measure fracture conductivity using finite element flow simulations. This allows for a controlled computational study of proppant structure and its relationship to fracture conductivity and stress in the proppant pack. For homogeneous multi-layered packings, we observe the expected increase in fracture conductivity with increasing fracture aperture, while the stress on the proppant pack remains nearly constant. This is consistent with the expected behavior in conventional proppant-packed fractures, but the present work offers a novel quantitative analysis with an explicit geometric representation of the proppant particles. In single-layered packings (i.e. proppant monolayers), there is a drastic increase in fracture conductivity as the proppant volume fraction decreases and open flow channels form. However, this also corresponds to a sharp increase in the mechanical stress on the proppant pack, as measured by the maximum normal stress relative to the side crushing strength of typical proppant particles. We also generate a variety of computational geometries that resemble highly heterogeneous proppant packings hypothesized to form during channel fracturing. In some cases, these heterogeneous packings show drastic improvements in conductivity with only moderate increase in the stress on the proppant particles, suggesting that in certain applications these structures are indeed optimal. We also compare our computer-generated structures to micro computed tomography imaging of a manually fractured laboratory-scale shale specimen, and find reasonable agreement in the geometric characteristics.
58 GEOSCIENCES↗
Low‐dimensional manifold learning for uncertainty quantification in complex multi‐scale stochastic systems
Broadly speaking, the goals of the project are to develop techniques to use manifold learning to develop reduced‐order and surrogate models for "hyper‐reduction" of very high‐dimensional complex multi‐scale systems. This is being achieved by employing a newly proposed form of manifold projection and learning that leverages recent advancements in computational geometry and data‐driven modeling. In particular, we are applying a manifold projection technique to project the solutions of very high‐dimensional systems onto the so‐called Grassmannmanifold, a Reimannian manifold comprised of orthonormal matrices. We then apply data‐driven machine learning techniques to classify the solutions on the manifold (e.g. clustering techniques) according to their proximity on the manifold and leverage a further nonlinear dimension reduction to organize the structured data on the manifold. Finally, we are developing novel techniques that enable us to directly interpolate the hyper‐reduced data such that we can predict the solution of the complex, high‐ dimensional system without need to call the full expensive computational model. Given their adherence to the underlying structure of the solution of the physical system, it is expected that these approximate solutions will be sufficiently constrained so as to (approximately) adhere to physical principles.
97 MATHEMATICS AND COMPUTING↗
Large-Scale Trajectory Analysis via Feature Vectors
The explosion of both sensors and GPS-enabled devices has resulted in position/time data being the next big frontier for data analytics. However, many of the problems associated with large numbers of trajectories do not necessarily have an analog with many of the historic big-data applications such as text and image analysis. Modern trajectory analytics exploits much of the cutting-edge research in machine-learning, statistics, computational geometry and other disciplines. We will show that for doing trajectory analytics at scale, it is necessary to fundamentally change the way the information is represented through a feature-vector approach. We then demonstrate the ability to solve large trajectory analytics problems using this representation.
58 GEOSCIENCES↗