Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational Geometry, Data Analysis, Data Visualization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Conforming Morse-Smale Complexes

Morse-Smale (MS) complexes have been gaining popularity as a tool for feature-driven data analysis and visualization. However, the quality of their geometric embedding and the sole dependence on the input scalar field data can limit their applicability when expressing application-dependent features. In this paper we introduce a new combinatorial technique to compute an MS complex that conforms to both an input scalar field and an additional, prior segmentation of the domain. The segmentation constrains the MS complex computation guaranteeing that boundaries in the segmentation are captured as separatrices of the MS complex. We demonstrate the utility and versatility of our approach with two applications. First, we use streamline integration to determine numerically computed basins/mountains and use the resulting segmentation as an input to our algorithm. This strategy enables the incorporation of prior flow path knowledge, effectively resulting in an MS complex that is as geometrically accurate as the employed numerical integration. Our second use case is motivated by the observation that often the data itself does not explicitly contain features known to be present by a domain expert. We introduce edit operations for MS complexes so that a user can directly modify their features while maintaining all the advantages of a robust topology-based representation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets: N-body simulations, molecular dynamics codes, and LIDAR point clouds are just a few examples. Such computational geometry methods are common in data analysis and visualization; but as the scale of simulations and observations surpasses billions of particles, the existing serial and shared-memory algorithms no longer suffice. A distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this paper is a new parallel Delaunay and Voronoi tessellation algorithm that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include periodic and wall boundary conditions, comparison of our method using two popular serial libraries, and application to numerous science datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

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

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

In Situ Visualization and Production of Extract Databases

Simulations running at high concurrency on HPC systems generate large volumes of data that are impractical to write to disk due to time and storage constraints. Applications often adapt by saving data infrequently, resulting in datasets with poor temporal resolution. This can make datasets difficult to interpret during post hoc visualization and analysis, or worse, it can lead to lost science. In Situ visualization and analysis can enable efficient production of small data products such as rendered images or surface extracts that consist of polygonal geometry plus fields. These data products are far smaller than their source data and can be processed much more economically in a traditional post hoc workflow using far fewer computational resources. We used the SENSEI and Libsim in situ infrastructures to implement rendering workflow and surface data extraction workflows in the AVF-LESLIE combustion code. Finally, these workflows were then demonstrated at high levels of concurrency and showed significant data reductions and limited impact on the simulation runtime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Numerical Modeling of the Lake Mary Road Bridge for Foundation Reuse Assessment

This project uses numerical techniques to assess the structural integrity and capacity of the bridge foundations and, as a result, reduces the risk associated with reusing the same foundation for a new superstructure. Nondestructive test methods of different types were used in combination with the numerical modeling and analysis. The onsite tests included visual inspection, tomography, ground penetrating radar, drilling boreholes and coreholes, and the laboratory tests on recovered samples. The results were utilized to identify the current geometry of the structure with foundation, including the hidden geometry of the abutments and piers, and soil and foundation material properties. This data was used to build the numerical models and run computational analyses on a high performance computer cluster to assess the structural integrity of the bridge and foundations including the suitability of the foundation for reuse with a new superstructure and traffic that will increase the load on the foundations. Computational analysis is more cost-effective and gives an advantage of getting more detailed knowledge about the structural response. It also enables to go beyond non-destructive testing and find the failure conditions without destroying the structure under consideration.

foundation reuse↗
DOE OSTI2026

Memory-Aware External Facelist Calculation: A Data-Parallel Atomic Hash Counting Approach

Unstructured volumetric meshes serve as fundamental data representations in various scientific simulations and analyses. They play a crucial role in representing complex computational domains and are essential for important numerical techniques, such as finite element analysis. Whenever such a mesh is read from a file, streamed in-situ, or generated by algorithms, scientific visualization libraries rely on calculating the external surface of a geometry, named “external facelist”, to produce a polygonal mesh for rendering. Consequently, external facelist calculation has become one of the most widely used algorithms in the scientific visualization domain, necessitating optimal performance. In this paper, we explore relevant work on external facelist calculation algorithms in two common visualization libraries, VTK and Viskores, assess their performance and memory constraints, and introduce a novel memory-aware external facelist calculation algorithm employing an atomic hash counting approach. This algorithm fully leverages Viskores' data-parallel primitive operations, facilitating its execution across diverse many-core architectures. Our algorithm features the lowest memory footprint on the GPU and the second-lowest on the CPU among all evaluated methods, and it also delivers the fastest performance on both CPU and GPU. It has been made available under an open-source license in the VTK and Viskores visualization systems.

Tsalikis, Spiros [Kitware] (ORCID:0000000151137195↗
DOE OSTI2016

Analysis and Visualization of Discrete Fracture Networks Using a Flow Topology Graph

We present an analysis and visualization prototype using the concept of a flow topology graph (FTG) for characterization of flow in constrained networks, with a focus on discrete fracture networks (DFN), developed collaboratively by geoscientists and visualization scientists. Our method allows users to understand and evaluate flow and transport in DFN simulations by computing statistical distributions, segment paths of interest, and cluster particles based on their paths. The new approach enables domain scientists to evaluate the accuracy of the simulations, visualize features of interest, and compare multiple realizations over a specific domain of interest. Geoscientists can simulate complex transport phenomena modeling large sites for networks consisting of several thousand fractures without compromising the geometry of the network. However, few tools exist for performing higher-level analysis and visualization of simulated DFN data. The prototype system we present addresses this need. Here, we demonstrate its effectiveness for increasingly complex examples of DFNs, covering two distinct use cases - hydrocarbon extraction from unconventional resources and transport of dissolved contaminant from a spent nuclear fuel repository.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

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

Visualization of flow interaction in a channel flow produced by a pair of helically coiled rods

Helically coiled tubes have been considered in the design of steam generators or heat exchangers of next generation nuclear power plants. Its compactness, efficiency, and the capability to absorb thermal expansion are desirable for nuclear reactor designs. However, the complex flow generated by the helically coiled geometry can result in flow induced vibration (FIV). In order to predict the FIV, there have been efforts using Computational Fluid dynamics (CFD)4, 5 to be coupled with multi-mechanics simulations. However, it is required to validate CFD to have confidence in capturing the flow structure characteristics of the transient complex flow behavior and fluctuation. In the present study, a simplified helically coiled steam generator (HCSG) design experiment was built acquiring data for CFD validation purpose. It is not perfect representation of the multiple rods, however, the current test facility produced transient data of the flow interaction between the rods and flow fluctuations near the rods. Particle Image Velocimetry (PIV) was applied to visualize the turbulent flow in a channel with slant rods. The two dimensional turbulent flow fields were analyzed. The velocity components were defined as below. u = U + u' (1) v = V + v' (2) where u is the lateral velocity on x-axis, v is the vertical velocity on y-axis, U and V are the mean velocities, and u' and v' are the fluctuation. Reynolds number, Re, was calculated using the rod diameter, d = 15.9 mm, and the upstream approach velocity, V{sub 0} = 0.5 m/s. Re = V{sub 0} d/η (3) where η is the kinematic viscosity of water. The experiment was conducted at Re ≅ 9,000 considering the currently reasonable computing power. Flow visualization in a flow channel produced by helically coiled rods was performed using PIV. The mean velocity field and streamlines were presented in this paper. The vortical flow structures in the cavity between rods were observed. Because of the asymmetric geometry, the flow profile was skewed. Additional measurements and transient analysis will be conducted to produce benchmark data for FIV study using CFD. Also, a test facility with a 5-rod heat exchanger design is operating to produce more data as a further work.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

Spectral Transfer Learning Using Information Geometry for a User-Independent Brain-Computer Interface

Recent advances in signal processing and machine learning techniques have enabled the application of Brain-Computer Interface (BCI) technologies to fields such as medicine, industry, and recreation; however, BCIs still suffer from the requirement of frequent calibration sessions due to the intra- and inter-individual variability of brain-signals, which makes calibration suppression through transfer learning an area of increasing interest for the development of practical BCI systems. In this paper, we present an unsupervised transfer method (spectral transfer using information geometry,STIG),which ranks and combines unlabeled predictions from an ensemble of information geometry classifiers built on data from individual training subjects. The STIG method is validated in both off-line and real-time feedback analysis during a rapid serial visual presentation task (RSVP). For detection of single-trial, event-related potentials (ERPs), the proposed method can significantly outperform existing calibration-free techniques as well as out perform traditional within-subject calibration techniques when limited data is available. Here, this method demonstrates that unsupervised transfer learning for single-trial detection in ERP-based BCIs can be achieved without the requirement of costly training data, representing a step-forward in the overall goal of achieving a practical user-independent BCI system.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.

Zhang, Jiang↗
DOE OSTI2017

FULCRUM user interface for SCALE 6.2

SCALE 6.2 consolidated the multiple special-purpose graphical user interfaces (GUI) of SCALE 6.1 into a completely new and modern interface called FULCRUM. FULCRUM is a cross-platform GUI designed to create, edit, validate, and visualize SCALE input, output, and data. It is intended to be usable by both novice and experienced SCALE users with an unobtrusive design. This paper presents a summary of FULCRUM capabilities. Specifically, interactive input validation, context-aware auto-completion, navigation, interactive geometry visualization with mesh results overlay, job execution, data plotting, and highly configurable workspace layouts will be discussed. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Nuclear Analysis of ITER - Paper 129

The world record fusion power production is 16.1 MW (5.7x10{sup 18} n/s). This was achieved at JET in 1995. The neutron budget during that experimental campaign was 2.5x10{sup 20} neutrons. In the first few seconds of an ITER full power pulse, the neutron production will exceed that the total from the entire history of previous controlled fusion experiments. It is envisaged that ITER should produce as much as 700 MW of fusion power. (This is the maximum envisaged power production from the plasma and does not include power multiplication in the blankets or shielding). This equates to the production of 2.48x10{sup 20} 14-MeV neutrons/s which will give an uncollided flux at the first wall of approximately 4x10{sup 13} n/cm{sup 2}/s and a total with the addition of the collided flux of some 10{sup 14} n/cm{sup 2}/s. For safety and licensing purposes it is the responsibility of ITER to satisfy the host state regulations and must limit doses to the public and staff. Furthermore, sufficient shielding must be provided to ensure that all components function adequately; and for decommissioning, ITER has a responsibility to reduce the volume and radio-toxicity of waste. The construction, operational and decommissioning phases of ITER are expected to last in excess of 30 years and the nuclear issues will be of critical importance throughout this time. The huge leap in neutron production in fusion experiments means that extensive nuclear analysis is required for ITER and it is the thesis of this paper that it is required at an unprecedented level. This is because of the combination of the large physical size of the installation, the variety of radiation sources, the attenuation required, the complexity of the geometry and the complexity of the sources and level of detail required. As a result of this unprecedented challenge the latest techniques for analysis, variance reduction and data display are being employed and in some cases being specifically developed. In this paper a few of the many representative examples of nuclear analysis will illustrate the thesis. The paper includes an examination of areas where further development could be made in the areas of radiation shield and nuclear analysis. Extensive nuclear analysis is required at ITER and the combination of the large physical size of the installation, the variety of radiation sources, the attenuation required, the complexity of the geometry, and the complexity of the sources mean that analysis is required at an unprecedented level of detail and quality. The latest techniques for analysis, variation reduction and data display are being employed and in some cases being specifically developed. Developments are required in areas of analysis, data visualization and experimental verification. (author)

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2021

Time-Resolved Geometric Feature Tracking Elucidates Laser-Induced Keyhole Dynamics

In this report, during laser melting of metals, localized metal evaporation resulting in the formation of a keyhole shaped cavity can occur if processing conditions are chosen with high power density. An unstable keyhole can have deleterious effects in certain applications (e.g., laser powder bed fusion) as it increases the likelihood of producing defects such as porosity. In this work, we propose a pipeline that enables complete segmentation and extraction of various geometric features in keyholing conditions. In situ synchrotron high-speed X-ray visualization at the Advanced Photon Source provides large datasets of experimental images with a high spatio-temporal resolution across a range of laser parameters for Ti-6Al- 4 V. Computer vision image processing techniques were used to extract time-resolved quantitative geometric features (e.g., depth, width, front wall angle) throughout keyhole evolution which were subsequently analyzed to understand the relationship between the variation of local keyhole geometry and processing conditions. This analysis is the first to employ a data-driven approach to further our understanding of the keyholing process regime.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Fundamental Understanding of Water Movement in Gas Diffusion Layer under Different Arrangements Using Combination of Direct Modeling and Experimental Visualization

In this paper, direct-modeling-based Lattice Boltzmann Method (LBM) combined with in-situ flow visualization, is used to explore fundamentally the transport of liquid-water inside the gas-diffusion layers (GDLs) used in polymer electrolyte fuel cells. Studies of the water evolution, water saturation, and breakthrough pressure inside a GDL with single and multiple injection points under land and channel geometries are explored. The model and experiment demonstrate good agreement between geometries of GDLs provided in this study which were obtained by a three-dimensional (3-D), reconstructed micro-structure from micro X-ray computed tomography (CT). The overall predictions of water evolution within the GDL agree well with the data visualized from the X-ray CT experiment for all cases studied. It also reveals that the liquid-water saturation profiles inside the GDL and breakthrough pressure are different when the location of the water injection point is altered, thereby providing analysis as to the impact of microporous layers or catalyst-layer functioning. Moreover, the uncompressed GDL undergoes a significantly different mechanism of water transport than that of the compressed GDL. Furthermore, the predictions show that the wettability variation is one of the key factors of the saturation characteristics.

42 ENGINEERING↗
DOE OSTI2021

Jas4pp — A data-analysis framework for physics and detector studies

This paper describes the Jas4pp framework for exploring physics cases and for detector-performance studies of future particle collision experiments. Jas4pp is a multi-platform Java program for numeric calculations, scientific visualization in 2D and 3D, storing data in various file formats and displaying collision events and detector geometries. It also includes complex data-analysis algorithms for function minimization, regression analysis, event reconstruction (such as jet reconstruction), limit settings and other libraries widely used in particle physics. The framework can be used with several scripting languages, such as Python/Jython, Groovy and JShell. Several benchmark tests discussed in the paper illustrate significant improvements in the performance of the Groovy and JShell scripting languages compared to the standard Python implementation in C. Furthermore, the improvements for numeric computations in Java are attributed to recent enhancements in the Java Virtual Machine.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Exploring Classification of Topological Priors With Machine Learning for Feature Extraction

In many scientific endeavors, increasingly abstract representations of data allow for new interpretive methodologies and conceptualization of phenomena. For example, moving from raw imaged pixels to segmented and reconstructed objects allows researchers new insights and means to direct their studies toward relevant areas. Thus, the development of new and improved methods for segmentation remains an active area of research. With advances in machine learning and neural networks, scientists have been focused on employing deep neural networks such as U-Net to obtain pixel-level segmentations, namely, defining associations between pixels and corresponding/referent objects and gathering those objects afterward. Topological analysis, such as the use of the Morse-Smale complex to encode regions of uniform gradient flow behavior, offers an alternative approach: first, create geometric priors, and then apply machine learning to classify. This approach is empirically motivated since phenomena of interest often appear as subsets of topological priors in many applications. Using topological elements not only reduces the learning space but also introduces the ability to use learnable geometries and connectivity to aid the classification of the segmentation target. Here, in this article, we describe an approach to creating learnable topological elements, explore the application of ML techniques to classification tasks in a number of areas, and demonstrate this approach as a viable alternative to pixel-level classification, with similar accuracy, improved execution time, and requiring marginal training data.

97 MATHEMATICS AND COMPUTING↗