Constrained Voronoi models for interpreting surface microstructural measurements
Not provided.
Materials Science↗
SEARCH · Search NASA
Results for “Voronoi”
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.
Position-dependent Voronoi probability distribution functions for matter and halos
Here, we measure the Voronoi density probability distribution function (PDF) for both dark matter and halos in N-body simulations. For the dark matter, Voronoi densities represent the matter density field smoothed on a uniform mass scale, which approximates the Lagrangian density field. For halos, the Voronoi densities contain information about the local environment of each halo. We measure the halo virial masses, the total amount of dark matter within each halo Voronoi cell, and the halo Voronoi cell volumes, and we show how halo abundances depend on these three quantities. We then study the position-dependent Voronoi density PDF, measured within finite subregions of the Universe, using separate universe simulations. We demonstrate that the spatial variation of the position-dependent PDF is due to large-scale density fluctuations, indicating that the position-dependent PDF is a biased tracer of large-scale structure. We measure this bias for the dark matter, and interpret it as the bias of regions of the Lagrangian density field that are selected based on density. For the halos, this bias can be interpreted as a form of assembly bias. We present the mapping from late-time to early-time Voronoi density for each simulation dark matter particle, which is highly stochastic. We compare the median of this stochastic map with spherical collapse calculations and discuss challenges involved in modeling the evolution of the density field on these scales.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Constructing a conforming Voronoi mesh for an arbitrarily-shaped enclosed geometric domain
A computing system is described herein, where the computing system includes a processor and memory storing instructions that, when executed by the processor, cause the processor to perform the following acts: 1) receiving a computer-implemented definition of an enclosed geometric domain, wherein the geometric domain is two-dimensional; 2) determining locations of seeds for the enclosed geometric domain; 3) decomposing the enclosed geometric domain into a conforming Voronoi mesh based on the locations of the seeds, wherein the conforming Voronoi mesh comprises Voronoi cells, and further wherein the conforming Voronoi mesh is bounded by the enclosed domain; and 4) performing a numerical simulation to generate simulation results, wherein the numerical simulation is based on at least one Voronoi cell in the Voronoi cells of the conforming Voronoi mesh.
97 MATHEMATICS AND COMPUTING↗
Constructing a conforming voronoi mesh for an arbitrarily-shaped enclosed geometric domain
A computing system is described herein, where the computing system includes a processor and memory storing instructions that, when executed by the processor, cause the processor to perform the following acts: 1) receiving a computer-implemented definition of an enclosed geometric domain, wherein the geometric domain is three-dimensional; 2) determining locations of seeds for the enclosed geometric domain; 3) decomposing the enclosed geometric domain into a conforming Voronoi mesh based on the locations of the seeds, wherein the conforming Voronoi mesh comprises Voronoi cells, and further wherein the conforming Voronoi mesh is bounded by the enclosed domain; and 4) performing a numerical simulation to generate simulation results, wherein the numerical simulation is based on at least one Voronoi cell in the Voronoi cells of the conforming Voronoi mesh.
97 MATHEMATICS AND COMPUTING↗
Voronoi Meshing to Accurately Capture Geological Structure in Subsurface Simulations
Mesh generation lies at the interface of geological modeling and reservoir simulation. Highly skewed or very small grid cells may be necessary to accurately capture the geometry of geological features, but the resulting poorly scaled or small grid cells can have a substantial negative impact on simulator accuracy and speed. One way to minimize numerical errors caused by gridding complex structures is to simulate on high-quality Voronoi meshes, which reduce grid orientation effects in fluid flow. This work presents a complete methodology to create Voronoi simulation grids, model fluid flow in complex geological systems, and visualize the results. A recently developed Voronoi meshing method that can automatically generate provably good unstructured meshes that conform to input surfaces creating closed volumes is used. Initially an analytical benchmark simulation is presented to validate the quality of the meshes and simulation results and demonstrate the superiority of simulation results using Voronoi meshes over flexed-hexahedral meshes on a domain with internal features. Next, meshes are created for test structures representing four of the most common geological features in the subsurface: layering, pinch-out, an interior lens that tapers to zero thickness on all sides and a fault with offset. Two benchmark flow simulations are run for each test structure. Finally, a realistic geological example for CO 2 injection into an anticline is simulated. Three realizations of the Voronoi mesh at the same resolution are generated for the simulations. Each mesh is highly refined near the injection wells and coarse in areas of less interest. These three meshes are used to model the CO 2 plume in the subsurface as it migrates to the top of the structure and then fills downward. Simulations on the meshes with randomly generated elements inside the input volumes each give slightly different fingering patterns for the viscous-unstable buoyant gas flow. The results presented in this work show a promising step towards utilizing fully automated Voronoi meshing for subsurface flow simulations in complex geology.
58 GEOSCIENCES↗
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↗
Quantifying Void Ratio in Granular Materials Using Voronoi Tessellation
Voronoi technique was used to calculate the local void ratio distribution of granular materials. It was implemented in an application-oriented image processing and analysis algorithm capable of extracting object edges, separating adjacent particles, obtaining the centroid of each particle, generating Voronoi polygons, and calculating the local void ratio. Details of the algorithm capabilities and features are presented. Verification calculations included performing manual digitization of synthetic images using Oda's method and Voronoi polygon system. The developed algorithm yielded very accurate measurements of the local void ratio distribution. Voronoi tessellation has the advantage, compared to Oda's method, of offering a well-defined polygon generation criterion that can be implemented in an algorithm to automatically calculate local void ratio of particulate materials.
Alshibli, Khalid A.↗
Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics
Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally,Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.
TTT↗
Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics
Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally, Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.
TTT↗
Robust Metric-Aligned Quad-Dominant Meshing Using L(sub p) Centroidal Voronoi Tessellation
We introduce a meshing algorithm that can be used to both generate and adapt meshes for bounded domains in an anisotropic manner. This is particularly beneficial when anisotropic flow features like shock waves or contact discontinuities are present in the computational domain. The algorithm presented in this paper is based upon meshing under the imposed Riemannian metric tensor, which controls the orientation and size of the mesh elements. In this way there is no need for user intervention to recognize these features. We demonstrate that the method indeed aligns the elements with the underlying metric and produces right-angled simplices that can be recombined into quadrilateral elements. The aim is to eventually incorporate this meshing strategy in the monolithic high-order spectral element solver that is currently being developed at NASA Ames. This paper has two main contributions: First, we demonstrate that we can generate quad-dominant metric-aligned meshes for bounded domains using a generalized form of L(sub p)-Centroidal Voronoi Tessellation (L(sub p)-CVT). Unlike previous works, we do not rely on a background mesh and discretize the bounded domain in a hierarchical way by first discretizing the boundaries and then the volume using the underlying metric. Second, we present an alternative for clipping the Voronoi cells on the boundary, which is common practice in CVT-based meshing algorithms, by reconstructing the Voronoi cells using the defined metric field. In this way we avoid the geometrical complexity of the clipping procedure and we show that we evaluate the energy and its gradient correctly. We show that the reconstruction of the computational domain is consistent with the Lloyds’ algorithm that is used to compute the L(sub p)-CVT.
Centroidal↗
Quasi-periodic structures in the large-scale galaxy distribution and three-dimensional Voronoi tessellation
It has been suggested that the void and wall structure associated with the large-scale galaxy distribution might be qualitatively, or perhaps even physically, modeled by a Voronoi tessellation, and that such structure might account for the surprisingly regular, sharp peaks in the galaxy redshift distributions obtained from 'pencil beam' surveys. Taking cell wall crossings by random line segments to correspond to such redshift peaks, an exact expression is derived for the distribution of spacings of these intersections in a three-dimensional Voronoi tessellation. This result verifies that the spacings are nonrandom and quasi-periodic, qualitatively resembling the observed pattern, even though the cell wall structure is generated from randomly placed seeds. Finally, moments of the spacing distribution are used to show that apparently periodic samples, similar to those recently reported, represent only one to two sigma fluctuations in a Voronoi tesselation.
Ikeuchi, Satoru↗
LAVA Voronoi Mesher for Wall-Modeled Large-Eddy Simulations
The unstructured Voronoi mesher currently being developed within the Launch, Ascent, and Vehicle Aerodynamics (LAVA) software framework at NASA Ames Research Center is described in detail. The discussions include, but are not limited to, the strategies used in the seeding and smoothing phases to ensure a high-quality mesh for Wall-Modeled Large-Eddy Simulations (WMLES), the methods behind the cell clipping algorithm responsible for conforming the mesh to a complex geometry, and the approach to create a global mesh from the distinct Voronoi cells. Applications and benefits of the Voronoi meshing approach are also presented. The automated meshing paradigm introduced was able to significantly reduce the time necessary to create a high-quality mesh around a complex geometry when compared against the current LAVA curvilinear overset meshing standard. For example, the task of generating a single mesh around the high-lift common research model requires the full dedication of a mesh generation expert for a period between one and two months. A family of meshes with different refinement levels up to six hundred million cells can be generated by a single engineer in a day or two. This technology has the potential for decreasing the turnaround time for conducting WMLES around complex geometries, as well as facilitating comprehensive mesh refinement studies.
Victor C B Sousa↗
Voronoi cell analysis: The shapes of particle systems
Many physical systems can be studied as collections of particles embedded in space, often evolving in time. Natural questions arise concerning how to characterize these arrangements—are they ordered or disordered? If they are ordered, how are they ordered and what kinds of defects do they possess? Voronoi tessellations, originally introduced to study problems in pure mathematics, have become a powerful and versatile tool for analyzing countless problems in pure and applied physics. Here we explain the basics of Voronoi tessellations and the shapes that they produce and describe how they can be used to characterize many physical systems.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
On the construction of the Voronoi mesh on a sphere
The primary feature of the novel construction of the Voronoi (1908) mesh presented is the algorithm's adding of points one-at-a-time, until the final mesh is achieved. The addition of one point to an existing Voronoi mesh of K points means that only local changes are needed to construct a mesh of K + 1 points; this construction is especially suited to time-dependent problems in virtue of the ability to reduce the construction to O(N) operations when configurations are close, while the algorithm does not break down in cases of configurations that are far apart. Illustrative numerical experiments substantiate the O(N) operation count for a typical case.
Augenbaum, J. M.↗
Generating Voronoi Diagrams for Curved Shapes with Divide-and-Conquer
Voronoi diagrams have been used in many practical applications including solid modeling, Numerical Control machining, Finite Element mesh generation, etc. Investigating the properties of these diagrams is an active research topic with many fruitful results. Computational techniques for Voronoi diagrams, however, have been concentrated on low order elements, for points, lines, polygons, quadratic curves and surfaces. This paper presents a divide-and-conquer scheme computing the diagrams for planar shapes bounded by closed curves commonly encountered in Computer Aided Design. These curves include analytical curves and splines. The algorithm first divides the boundary curve into sections, delimited by curve points with the minimal curvatures. Bisector branches for these sections are then generated and merged recursively to obtain the final diagram. A detailed example in the paper shows the steps of the generation and merging of the bisectors. A simple analysis of the complexity of the algorithm is also presented.
Chou, Jin J.↗
Meshless discretization of the discrete-ordinates transport equation with integration based on Voronoi cells
The time-dependent, gray, linear radiation transport equation is discretized using the meshless local Petrov-Galerkin method with reproducing kernels. The integration is performed using a Voronoi tessellation, which creates a partition of unity that only depends on the position and extent of the kernels. The resolution of the integration automatically follows the particles and requires no manual adjustment. The discretization includes streamline-upwind Petrov-Galerkin stabilization to prevent oscillations and improve numerical conditioning. The angular quadrature is selectively refineable to increase angular resolution in chosen directions. The time discretization is done using backward Euler. The transport solve for each direction and the solve for the scattering source are both done using Krylov iterative methods. The results indicate first-order convergence in time and second-order convergence in space for linear reproducing kernels.
97 MATHEMATICS AND COMPUTING↗
Development of Stochastic Voronoi Lattice Structures via Two-Photon Polymerization
Low-density polymer foams of varying sizes, shapes, and densities are of specific interest to the inertial confinement fusion (ICF) program and related high-energy density plasma physics research. Historically, these foams are comprised of polystyrene or other low atomic number materials and have densities in the 30 to 300 mg/cm 3 range. However, at the lower end of this density range, these traditional polymer foams become fragile and difficult to cast and machine into the geometries needed. Recently, the need by experimentalists for materials with densities below 30 mg/cm 3 has increased. To address these needs, we are developing three-dimensional (3-D) printing techniques to create high-precision, low-density, and repeatable complex lattice structures. Using two-photon polymerization 3-D printing, we recently developed the first 5 mg/cm3 low-density lattice structure having an annular hemispherical shape. These microscale to mesoscale structures were modeled and designed using the nTopology software, specifically utilizing the "Voronoi volume lattice" and "random points in body" option blocks. All printing operations were performed using the Nanoscribe Photonic Professional GT instrument. Characterization of these 3-D structures was conducted using various microscopic and X-ray tomographic imaging techniques. Furthermore, overall printed part sizes ranged from 1 to 5 mm in diameter and were composed of lattice ligaments having thicknesses in the 3- to 5-µm range. These structures have been incorporated into ICF targets recently shot on both the University of Rochester’s Laboratory of Laser Energetics Omega laser and the National Ignition Facility.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Finding wombling boundaries in LHC data with Voronoi and Delaunay tessellations
We address the problem of finding a wombling boundary in point data generated by a general Poisson point process, a specific example of which is an LHC event sample distributed in the phase space of a final state signature, with the wombling boundary created by some new physics. We discuss the use of Voronoi and Delaunay tessellations of the point data for estimating the local gradients and investigate methods for sharpening the boundaries by reducing the statistical noise. The outcome from traditional wombling algorithms is a set of boundary cell candidates with relatively large gradients, whose spatial properties must then be scrutinized in order to construct the boundary and evaluate its significance. Here we propose an alternative approach where we simultaneously form and evaluate the significance of all possible boundaries in terms of the total gradient flux. We illustrate our method with several toy examples of both straight and curved boundaries with varying amounts of signal present in the data.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗