Search NASA⌕ Search

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.

At least 55 records · Page 3

Pattern ANalytics To Support High-performance Exploitation and Reasoning (PANTHER)

Sandia researchers are developing analytic techniques that efficiently detect patterns in high-volume, noisy, remote sensing and other geospatial data, improving an analysts’ ability to detect possibly off-normal events in complex homeland security, nuclear weapons, and emerging threat environments. High-consequence, national security decisions rely on timely, comprehensive answers to complex questions, yet critical gaps in our approach to these questions remain. PANTHER addresses these gaps through fundamental research on: geospatial-temporal feature extraction via image segmentation and classification; geospatial-temporal graph algorithms and computational geometry; and domain-relevant models of human perception and cognition informing the design of analytic systems. PANTHER’s cross-disciplinary R&D approach uses fundamental science and mathematics to understand how to maximize decision systems through rethinking key aspects of geospatial data analysis. New methods in motion and trajectory analysis support both rapid search for known trajectories as well as rapid clustering and anomaly detection. Thus, the perceptual and visual load on users is reduced by providing pattern analytics with elegant visual cues to spatial and temporal characteristics.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

PANTHER. Pattern ANalytics To support High-performance Exploitation and Reasoning.

Sandia has approached the analysis of big datasets with an integrated methodology that uses computer science, image processing, and human factors to exploit critical patterns and relationships in large datasets despite the variety and rapidity of information. The work is part of a three-year LDRD Grand Challenge called PANTHER (Pattern ANalytics To support High-performance Exploitation and Reasoning). To maximize data analysis capability, Sandia pursued scientific advances across three key technical domains: (1) geospatial-temporal feature extraction via image segmentation and classification; (2) geospatial-temporal analysis capabilities tailored to identify and process new signatures more efficiently; and (3) domain- relevant models of human perception and cognition informing the design of analytic systems. Our integrated results include advances in geographical information systems (GIS) in which we discover activity patterns in noisy, spatial-temporal datasets using geospatial-temporal semantic graphs. We employed computational geometry and machine learning to allow us to extract and predict spatial-temporal patterns and outliers from large aircraft and maritime trajectory datasets. We automatically extracted static and ephemeral features from real, noisy synthetic aperture radar imagery for ingestion into a geospatial-temporal semantic graph. We worked with analysts and investigated analytic workflows to (1) determine how experiential knowledge evolves and is deployed in high-demand, high-throughput visual search workflows, and (2) better understand visual search performance and attention. Through PANTHER, Sandia's fundamental rethinking of key aspects of geospatial data analysis permits the extraction of much richer information from large amounts of data. The project results enable analysts to examine mountains of historical and current data that would otherwise go untouched, while also gaining meaningful, measurable, and defensible insights into overlooked relationships and patterns. The capability is directly relevant to the nation's nonproliferation remote-sensing activities and has broad national security applications for military and intelligence- gathering organizations.

58 GEOSCIENCES↗

Multi-scale Coupled Processes Modeling of Fractures as Porous, Interfacial and Granular Systems from Rock Images with the Numerical Manifold Method

Abstract The greatest challenges of rigorously modeling coupled hydro-mechanical processes in fractured rocks at different scales are associated with computational geometry. In addition, selections of continuous or discontinuous models, physical laws, and coupling priorities at different scales based on different geometric features determine the applicability of a numerical model for a certain type of problem. In this study, we present our multi-scale modeling capabilities that have been developed based on the numerical manifold method for analyzing coupled hydro-mechanical processes in fractured rocks. Based on their geometric features, the fractures are modeled as continua—finite-thickness porous zones, and discontinua—discontinuous interfaces and microscale asperities and granular systems. Different governing equations, physical laws, coupling priorities, and approaches for addressing fracture intersections and shearing are then applied to describe these. We applied these models to simulate coupled processes in fractured rocks using realistic geometry obtained from rock images at different scales. We first calculated shearing of a single fracture with different models and demonstrated the impacts of asperities on shearing. We then applied the continuous and discontinuous models to simulate a network of rough fractures, demonstrating that contact dynamics contribute significantly to the geometric, multi-physical evolution of systems where rough fractures are not mineral filled. For a discrete fracture network, our coupled processes modeling demonstrates that shearing of the discrete fractures can have a major impact on stress and pore pressure distribution. Lastly, we applied the discontinuous granular model to simulate evolution of a complex granular system with a deformation band, demonstrating that the deformation band can dominate contact dynamics, the structural and the stress evolution of the granular system.

58 GEOSCIENCES↗

A Geometric Volume of Fluid-Based Multiphase Flow Solver Extension to the Reacting Flow Solver, PeleLM

A new algorithm is presented to simulate multiphase flows with surface tension in a pathway for spray combustion simulation. The algorithm combines capabilities from two open-source packages, including the interface reconstruction library (IRL), a library of computational geometry routines to enable the volume of fluid (VOF) method, and PeleLM, a solver for the reacting Navier-Stokes equations. Additionally, surface tension is implemented using the continuum surface force (CSF) model with an improved height function technique in the volume fraction field. Spurious errors in volume fraction arising from our combined strategy are corrected through a topology-based method that improves both numerical stability and accuracy. Multiple validation simulations are conducted, including (i) translations and rotations of Zalesak's disk, (ii) a stationary circular droplet with surface tension, (iii) an oscillating elliptical droplet, and (iv) three-dimensional deformation of a spherical droplet. Results indicate that the combined scheme retains the favorable properties of each of the component algorithms.

42 ENGINEERING↗

Flow and transport in three-dimensional discrete fracture matrix models using mimetic finite difference on a conforming multi-dimensional mesh

Here, we present a comprehensive workflow to simulate single-phase flow and transport in fractured porous media using the discrete fracture matrix approach. The workflow has three primary parts: (1) a method for conforming mesh generation of and around a three-dimensional fracture network, (2) the discretization of the governing equations using a second-order mimetic finite difference method, and (3) implementation of numerical methods for high-performance computing environments. A method to create a conforming Delaunay tetrahedralization of the volume surrounding the fracture network, where the triangular cells of the fracture mesh are faces in the volume mesh, that addresses pathological cases which commonly arise and degrade mesh quality is also provided. Our open-source subsurface simulator uses a hierarchy of process kernels (one kernel per physical process) that allows for both strong and weak coupling of the fracture and matrix domains. We provide verification tests based on analytic solutions for flow and transport, as well as numerical convergence. We also provide multiple expositions of the method in complex fracture networks. In the first example, we demonstrate that the method is robust by considering two scenarios where the fracture network acts as a barrier to flow, as the primary pathway, or offers the same resistance as the surrounding matrix. In the second test, flow and transport through a three-dimensional stochastically generated network containing 257 fractures is presented.

97 MATHEMATICS AND COMPUTING↗

Radiofrequency sheath rectification on WEST: application of the sheath-equivalent dielectric layer technique in tokamak geometry *

Radiofrequency sheath rectification is a phenomenon relevant to the operation of Ion Cyclotron Range of Frequencies (ICRFs) actuators in tokamaks. Techniques to model the sheath rectification on 3D ICRF antenna geometries have only recently become available (Shiraiw et al 2023 Nucl. Fusion 63 026024; Beers et al 2021 Phys. Plasmas 28 093503). In this work, we apply the 'sheath-equivalent dielectric layer' technique, used previously only on linear devices (Beers et al 2021 Phys. Plasmas 28 103508), in tokamak geometry, computing rectified sheath potentials on the WEST ICRF antenna. Advancing the state of the art in sheath rectification modeling, we compute the sheath potentials not just on the limiters, but also on the Faraday Screen bars. The calculations show a peak rectified DC potential of 300 V on the limiters and 500 V on the Faraday screen. Assuming a typical sputtering yield curve, the RF sheath rectification increases the sputtering yield from the limiters by a factor of 2.6 w.r.t. the sputtering due to the non-rectified thermal sheath.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

GammaPod-A new device dedicated for stereotactic radiotherapy of breast cancer

Purpose: This paper introduces a new external beam radiotherapy device named GammaPod that is dedicated for stereotactic radiotherapy of breast cancer. Methods: The design goal of the GammaPod as a dedicated system for treating breast cancer is the ability to deliver ablative doses with sharp gradients under stereotactic image guidance. Stereotactic localization of the breast is achieved by a vacuum-assisted breast immobilization cup with built-in stereotactic frame. Highly focused radiation is achieved at the isocenter due to the cross-firing from 36 radiation arcs generated by rotating 36 individual Cobalt-60 beams. The dedicated treatment planning system optimizes an optimal path of the focal spot using an optimization algorithm borrowed from computational geometry such that the target can be covered by 90%-95% of the prescription dose and the doses to surrounding tissues are minimized. The treatment plan is intended to be delivered with continuous motion of the treatment couch. In this paper the authors described in detail the gamma radiation unit, stereotactic localization of the breast, and the treatment planning system of the GammaPod system. Results: A prototype GammaPod system was installed at University of Maryland Medical Center and has gone through a thorough functional, geometric, and dosimetric testing. The mechanical and functional performances of the system all meet the functional specifications. Conclusions: An image-guided breast stereotactic radiotherapy device, named GammaPod, has been developed to deliver highly focused and localized doses to a target in the breast under stereotactic image guidance. It is envisioned that the GammaPod technology has the potential to significantly shorten radiation treatments and even eliminate surgery by ablating the tumor and sterilizing the tumor bed simultaneously.

60 APPLIED LIFE SCIENCES↗

TESS

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.

Dmitriy Morozov, TomPeterka↗

NMTRI v 1.0

This code consists of Matlab routines which enable the user to perform non-manifold surface reconstruction via triangulation from high dimensional point cloud data. The code was based on an algorithm originally developed in [Freedman (2007), An Incremental Algorithm for Reconstruction of Surfaces of Arbitrary Codimension Computational Geometry: Theory and Applications, 36(2):106-116]. This algorithm has been modified to accommodate non-manifold surface according to the work described in [S. Martin and J.-P. Watson (2009), Non-Manifold Surface Reconstruction from High Dimensional Point Cloud DataSAND #5272610].The motivation for developing the code was a point cloud describing the molecular conformation space of cyclooctane (C8H16). Cyclooctane conformation space was represented using points in 72 dimensions (3 coordinates for each molecule). The code was used to triangulate the point cloud and thereby study the geometry and topology of cyclooctane. Futures applications are envisioned for peptides and proteins.

Martin, Shawn↗

Axom

The Axom library consists of n collection of software components that provide core computer science infrastructure capabilities that can be shared by diverse high performance computing (HPC) applications. The current set of capabilities that Axom provides includes: Customizable support for error/warning and diagnostic message reporting and coordination among components of integrated applications (e.g., physics packages, libraries, etc.); Scalable parallel aggregation and filtering of message logging; In memory datastore for hierarchical, mesh-aware simulation data. The datastore supports data description, allocation, deallocation. parallel l/0, etc; Mesh data model abstractions that enable the development of mesh-based computational algorithms that work with many diverse, application· specific mesh types; and Computational geometry primitives for developing high performance parallel algorithms based on spatial geometry and meshes, e.g., spatial acceleration data structures, sets, maps, relations, etc.

Hornung, RichardD.↗

Simulating Collisions for Hydrokinetic Turbines. FY2010 Annual Progress Report.

Computational fluid dynamics (CFD) simulations of turbulent flow and particle motion are being conducted to evaluate the frequency and severity of collisions between marine and hydrokinetic (MHK) energy devices and debris or aquatic organisms. The work is part of a collaborative research project between Pacific Northwest National Laboratory (PNNL) and Sandia National Laboratories , funded by the U.S. Department of Energy Office of Energy Efficiency and Renewable Energy Wind and Water Power Program. During FY2010 a reference design for an axial flow MHK turbine was used to develop a computational geometry for inclusion into a CFD model. Unsteady simulations of turbulent flow and the moving MHK turbine blades are being performed and the results used for simulation of particle trajectories. Preliminary results and plans for future work are presented.

13 HYDRO ENERGY↗

Dynamic Multi-Sensor Multi-Mission Optimal Planning Tool

Remote sensing systems have firmly established a role in providing immense value to commercial industry, scientific exploration, and national security. Continued maturation of sensing technology has reduced the cost of deploying highly-capable sensors while at the same time increased reliance on the information these sensors can provide. The demand for time on these sensors is unlikely to diminish. Coordination of next-generation sensor systems, larger constellations of satellites, unmanned aerial vehicles, ground telescopes, etc. is prohibitively complex for existing heuristics-based scheduling techniques. The project was a two-year collaboration spanning multiple Sandia centers and included a partnership with Texas A&M University. We have developed algorithms and software for collection scheduling, remote sensor field-of-view pointing models, and bandwidth-constrained prioritization of sensor data. Our approach followed best practices from the operations research and computational geometry communities. These models provide several advantages over state of the art techniques. In particular, our approach is more flexible compared to heuristics that tightly couple models and solution techniques. First, our mixed-integer linear models afford a rigorous analysis so that sensor planners can quantitatively describe a schedule relative to the best possible. Optimal or near-optimal schedules can be produced with commercial solvers in operational run-times. These models can be modified and extended to incorporate different scheduling and resource constraints and objective function definitions. Further, we have extended these models to proactively schedule sensors under weather and ad hoc collection uncertainty. This approach stands in contrast to existing deterministic schedulers which assume a single future weather or ad hoc collection scenario. The field-of-view pointing algorithm produces a mosaic with the fewest number of images required to fully cover a region of interest. The bandwidth-constrained algorithms find the highest priority information that can be transmitted. All of these are based on mixed-integer linear programs so that, in the future, collection scheduling, field-of-view, and bandwidth prioritization can be combined into a single problem. Experiments conducted using the developed models, commercial solvers, and benchmark datasets have demonstrated that proactively scheduling against uncertainty regularly and significantly outperforms deterministic schedulers.

47 OTHER INSTRUMENTATION↗

Assessment of Microstructure Prediction Capabilities for Powder Bed Fusion Stainless Steel 316

The Advanced Materials and Manufacturing Technologies program aims to accelerate the development, qualification, demonstration, and deployment of advanced materials and manufacturing technologies to enable reliable and economical nuclear energy. However, the characteristic process-structure-property relationships of additive manufacturing (AM) materials pose challenges for the qualification and certification of AM nuclear components. In particular, component-scale variations in microstructure and properties can be driven by localized changes in melt pool dynamics due to how process parameters interact with different part geometries. Computational modeling tools can play a crucial role in predicting and controlling this variability. This report presents final results on process modeling tools designed to predict microstructure variability in additively manufactured stainless steel 316 parts. It details the software packages and physical modeling approaches employed to simulate an AM component within an automated process modeling workflow. Results are demonstrated through comparisons between predicted microstructures and experimental measurements across various representative processing conditions. The report concludes by discussing identified challenges and future opportunities for connecting the developed simulation workflow with mechanics simulations for prediction of part performance.

36 MATERIALS SCIENCE↗

TESS

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.

Dmitriy Morozov, Tom Peterka↗

NMTRI v 1.0

This code consists of Matlab routines which enable the user to perform non-manifold surface reconstruction via triangulation from high dimensional point cloud data. The code was based on an algorithm originally developed in [Freedman (2007), An Incremental Algorithm for Reconstruction of Surfaces of Arbitrary Codimension Computational Geometry: Theory and Applications, 36(2):106-116]. This algorithm has been modified to accommodate non-manifold surface according to the work described in [S. Martin and J.-P. Watson (2009), Non-Manifold Surface Reconstruction from High Dimensional Point Cloud DataSAND #5272610].The motivation for developing the code was a point cloud describing the molecular conformation space of cyclooctane (C8H16). Cyclooctane conformation space was represented using points in 72 dimensions (3 coordinates for each molecule). The code was used to triangulate the point cloud and thereby study the geometry and topology of cyclooctane. Futures applications are envisioned for peptides and proteins.

Martin, Shawn↗

High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

99 GENERAL AND MISCELLANEOUS↗