Search NASA⌕ Search

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.

At least 19 records

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↗

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.↗

A Lagrangian method for the shallow water equations based on a Voronoi mesh - Flows on a rotating sphere

A Lagrangian scheme using the Voronoi mesh is applied to study shallow water flow on a sphere. Discrete approximations to the shallow water equations are obtained for the surfaces of a nonrotating and a rotating sphere, and discrete differential operators are defined for the gradient and the divergence on the sphere. Dissipation is put into the model, when needed, by merging fluid points when they get too close to each other. The full numerical scheme is described and results of numerical computations on various test cases are given, including zonal flow and the Riemann problem.

Augenbaum, J. M.↗

Voronoi-Based Point-Placement for Three-Dimensional Delaunay-Refinement

An extension of the restricted Delaunay-refinement algorithm for three-dimensional tetrahedral mesh generation is described, in which an off-centre type point-placement scheme is utilised. It is shown that the use of generalised Steiner points, positioned along edges in the associated Voronoi complex, typically leads to improvements in the overall size, quality and grading of the resulting tetrahedral meshes. The new algorithm can be viewed as a Frontal-Delaunay approach - a hybridisation of conventional Delaunay-refinement and advancing-front techniques, in which new vertices are positioned to satisfy both element size- and shapeconstraints. The new method is shown to inherit many of the best features of classical Delaunay-refinement and advancing-front type algorithms, combining good practical performance with theoretical robustness. Experimental comparisons show that

algorithms↗

Navigation path planning for autonomous aircraft - Voronoi diagram approach

The present technique for generating a search graph depicting topologically unique paths around mountain boundaries at constant altitudes involves a description of mountain boundaries as polygons; the search graph is then generated on the basis of a geometric construct. All nodes and arcs of the search graph are guaranteed to lie in free space, thereby ensuring an autonomous aircraft's avoidance of mountain obstacles. The solution path is generated by searching the graph for the optimal path from a start location to a finish location.

Krozel, Jimmy↗

Improving Neural Network Generalization Ability Using Outlier Analysis and Voronoi Tessellation

The data used in this study was obtained from the Sloan Digital Sky Survey (SDSS), which provides astronomers with what is currently the most extensive mapping of the universe, covering 25% of the sky and cataloging the spectral properties (e.g., luminosity, color, surface temperature) of over 100 million celestial objects. Images generated by the SDSS are collected through 5 filters named u, g, r, l, and z that have respective wavelengths of 3540, 4750, 6222, 7632, and 9049 A. By measuring the photometric redshifts of the aforementioned wavelengths of a galaxy, astronomers can ascertain the extent to which galaxy is receding from which the distance to the galaxy can be calculated. Data collected for a small select group of galaxies (approximately 30, 000) contains accurate measurements of the galaxies' redshifts, in addition to measurements of their spectral properties. The above dataset containing both redshift measurements as well as spectral properties of the selected galaxies served as the training set for the purposes of this study; the data set containing only the spectra properties of a separate group of galaxies served as the test set.

Ho, Michelle↗

X-HAB: Vertical Habitability Layout and Fabrication Studies - Voronoi Algorithmic Space Transport (VAST)

The final presentation of the California Polytechnic State University's Vertical Habitability Layout and Fabrication Studies, a vertical habitat. The goals of the project are: - Design the interior of a vertical habitat, with a well-documented link back to the process of design (continuing the work completed the first quarter, with parametrically-derived volumes, internal layout, etc.). - A full-size low-fidelity 3-D spatial (mockup of the vertical habitat.

Michael Fox↗

Wall-Modeled Large-Eddy Simulations of a Swept Wing with Leading-Edge Ice

The aerodynamic performance of a swept wing derived from the Common Research Model wing with high-fidelity and smooth leading-edge ice shapes is evaluated using wall-modeled large-eddy simulations. Two mesh paradigms are considered within the Launch, Ascent, and Vehicle Aerodynamics framework: structured hybrid curvilinear body-fitted/immersed-boundary and unstructured Voronoi. The curvilinear approach models the effect of the ice on the flow through penalty terms and the Voronoi strategy includes the ice representation directly in the mesh.Aerodynamic loads, surface pressure profiles, and skin-friction streamlines are compared against experimental results collected at the Wichita State University wind tunnel at a Mach number of 0.18 and a Reynolds number per mean aerodynamic chord of 1.6 million. For the curvilinear simulations with high-fidelity ice, results are sensitive to spanwise mesh resolution near the leading edge, where insufficient spanwise resolution leads to a spanwise running vortexaft of the high-fidelity ice, which is partially removed with increasing spanwise resolution. For the Voronoi simulations with high-fidelity ice, refining the mesh led to good convergence towards the experimental results with the best case demonstrating a maximum discrepancy of three lift counts relative to the experiment across a range of angles of attack from about 5 to 24 degrees, validating the shrink-wrapping procedure used for the ice. For the smooth ice, the curvilinear approach consistently under-predicted the upper surface suction leading to an under-prediction in lift, but did not demonstrate the pronounced over-prediction in upper surface suction near the leading edge observed in the Voronoi simulations.

AATT↗

Three Dimensional Sector Design with Optimal Number of Sectors

The concept of dynamic sector design suggests a strategic approach to ease air traffic congestion, which is predicted to become a serious problem in the national airspace system by 2025. Considerable research has been conducted to address the sectorization problem. In previous work, an approach that combines the Voronoi diagrams, Genetic Algorithms (GA), and the iterative deepening algorithm was proposed. However, as originally formulated, the number of sectors used was predefined and only two-dimensional partitions were allowed, which constrained the method's ability to achieve good designs. The current work extends the earlier Voronoi-based method by treating the number of sectors as an additional decision variable, allowing 3D partitions, and developing more comprehensive costs.

Xue, Min↗