SEARCH · Search NASA

Results for “Voronoi diagrams”

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.

SourceResearch connectionFrom yearThrough year

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

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1996

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

NASA NTRS1990

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↗

NASA NTRS2009

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↗

DOE OSTI2024

T RI M E ++: Multi-threaded triangular meshing in two dimensions

We present T RI M E ++, a multi-threaded software library designed for generating two-dimensional meshes for intricate geometric shapes using the Delaunay triangulation. Multi-threaded parallel computing is implemented throughout the meshing procedure, making it suitable for fast generation of large-scale meshes. Three iterative meshing algorithms are implemented: the DistMesh algorithm, the centroidal Voronoi diagram meshing, and a hybrid of the two. We compare the performance of the three meshing methods in T RI M E ++, and show that the hybrid method retains the advantages of the other two. The software library achieves significant parallel speedup when generating large-scale meshes containing between 10 4 to 10 7 points. T RI M E ++ can handle complicated geometries and generates adaptive meshes of high quality.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2017

JIGSAW-GEO (1.0): Locally Orthogonal Staggered Unstructured Grid Generation for General Circulation Modelling on the Sphere

An algorithm for the generation of non-uniform, locally orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered VoronoiDelaunay meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric simulation, ocean-modelling and numerical weather prediction. Using a recently developed Frontal-Delaunay refinement technique, a method for the construction of high-quality unstructured spheroidal Delaunay triangulations is introduced. A locally orthogonal polygonal grid, derived from the associated Voronoi diagram, is computed as the staggered dual. It is shown that use of the Frontal-Delaunay refinement technique allows for the generation of very high-quality unstructured triangulations, satisfying a priori bounds on element size and shape. Grid quality is further improved through the application of hill-climbing-type optimisation techniques. Overall, the algorithm is shown to produce grids with very high element quality and smooth grading characteristics, while imposing relatively low computational expense. A selection of uniform and non-uniform spheroidal grids appropriate for high-resolution, multi-scale general circulation modelling are presented. These grids are shown to satisfy the geometric constraints associated with contemporary unstructured C-grid-type finite-volume models, including the Model for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing functions to generate smoothly graded, non-uniform grids for multi-resolution-type studies is discussed in detail.

geophysical fluid dynamics↗

NASA NTRS1988

Search Problems in Mission Planning and Navigation of Autonomous Aircraft

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

Krozel, James A.↗

NASA NTRS1987

Robot path planning with distance-safety criterion

A method for determining an optimal path with a weighted distance-safety criterion is developed. The goal is to strike a compromise between the shortest path and the centerline path, which is safer. The method is composed of three parts: (i) construction of a region map by dividing the workspace, (ii) interregion optimization to determine the entry and departure points of the path in each region, and (iii) intraregion optimization for determining the (optimal) path segment within each region. The region map is generated by using an approximate Voronoi diagram, and region optimization is achieved using variational dynamic programming. Although developed for 2-D problems, the method can be easily extended to a class of 3-D problems. Numerical examples are presented to demonstrate the method.

Suh, Suk-Hwan↗

NASA NTRS1989

Learned navigation in unknown terrains: A retraction method

The problem of learned navigation of a circular robot R, of radius delta (is greater than or equal to 0), through a terrain whose model is not a-priori known is considered. Two-dimensional finite-sized terrains populated by an unknown (but, finite) number of simple polygonal obstacles are also considered. The number and locations of the vertices of each obstacle are unknown to R. R is equipped with a sensor system that detects all vertices and edges that are visible from its present location. In this context two problems are covered. In the visit problem, the robot is required to visit a sequence of destination points, and in the terrain model acquisition problem, the robot is required to acquire the complete model of the terrain. An algorithmic framework is presented for solving these two problems using a retraction of the freespace onto the Voronoi diagram of the terrain. Algorithms are then presented to solve the visit problem and the terrain model acquisition problem.

Rao, Nageswara S. V.↗

NASA NTRS1993

Certification trails and software design for testability

Design techniques which may be applied to make program testing easier were investigated. Methods for modifying a program to generate additional data which we refer to as a certification trail are presented. This additional data is designed to allow the program output to be checked more quickly and effectively. Certification trails were described primarily from a theoretical perspective. A comprehensive attempt to assess experimentally the performance and overall value of the certification trail method is reported. The method was applied to nine fundamental, well-known algorithms for the following problems: convex hull, sorting, huffman tree, shortest path, closest pair, line segment intersection, longest increasing subsequence, skyline, and voronoi diagram. Run-time performance data for each of these problems is given, and selected problems are described in more detail. Our results indicate that there are many cases in which certification trails allow for significantly faster overall program execution time than a 2-version programming approach, and also give further evidence of the breadth of applicability of this method.

Sullivan, Gregory F.↗

NASA NTRS1995

Algorithms for high aspect ratio oriented triangulations

Grid generation plays an integral part in the solution of computational fluid dynamics problems for aerodynamics applications. A major difficulty with standard structured grid generation, which produces quadrilateral (or hexahedral) elements with implicit connectivity, has been the requirement for a great deal of human intervention in developing grids around complex configurations. This has led to investigations into unstructured grids with explicit connectivities, which are primarily composed of triangular (or tetrahedral) elements, although other subdivisions of convex cells may be used. The existence of large gradients in the solution of aerodynamic problems may be exploited to reduce the computational effort by using high aspect ratio elements in high gradient regions. However, the heuristic approaches currently in use do not adequately address this need for high aspect ratio unstructured grids. High aspect ratio triangulations very often produce the large angles that are to be avoided. Point generation techniques based on contour or front generation are judged to be the most promising in terms of being able to handle complicated multiple body objects, with this technique lending itself well to adaptivity. The eventual goal encompasses several phases: first, a partitioning phase, in which the Voronoi diagram of a set of points and line segments (the input set) will be generated to partition the input domain; second, a contour generation phase in which body-conforming contours are used to subdivide the partition further as well as introduce the foundation for aspect ratio control, and; third, a Steiner triangulation phase in which points are added to the partition to enable triangulation while controlling angle bounds and aspect ratio. This provides a combination of the advancing front/contour techniques and refinement. By using a front, aspect ratio can be better controlled. By using refinement, bounds on angles can be maintained, while attempting to minimize the number of Steiner points.

Posenau, Mary-Anne K.↗

NASA NTRS2015

Multi-Resolution Unstructured Grid-Generation for Geophysical Applications on the Sphere

An algorithm for the generation of non-uniform unstructured grids on ellipsoidal geometries is described. This technique is designed to generate high quality triangular and polygonal meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric and ocean simulation, and numerical weather predication. Using a recently developed Frontal-Delaunay-refinement technique, a method for the construction of high-quality unstructured ellipsoidal Delaunay triangulations is introduced. A dual polygonal grid, derived from the associated Voronoi diagram, is also optionally generated as a by-product. Compared to existing techniques, it is shown that the Frontal-Delaunay approach typically produces grids with near-optimal element quality and smooth grading characteristics, while imposing relatively low computational expense. Initial results are presented for a selection of uniform and non-uniform ellipsoidal grids appropriate for large-scale geophysical applications. The use of user-defined mesh-sizing functions to generate smoothly graded, non-uniform grids is discussed.

Weather↗

DOE OSTI2023

8. Open-Loop Toolpath Generation

Open-loop paths, as opposed to closed-loop paths, have start and end points that are at different locations. Open-loop paths, commonly called “skeletons,” can be generated through multiple approaches. Most approaches utilize a shape's medial axis transform and build appropriate pathing around this representation. In this chapter, a specific implementation consisting of three major steps will be discussed. These steps are Voronoi diagram generation, skeleton pruning, and path consolidation. With the major components of the implementation covered, two additional optimizations will also be described. These two optimizations, chamfering and smoothing, will be highlighted as ways to improve overall pathing quality.

Borish, Michael↗

DOE OSTI2023

A novel approach for adaptive skeleton toolpath generation

Industry 4.0 is revolutionizing manufacturing through the integration of automation and real-time data sharing in cyber-physical systems. At the forefront of this revolution is large-format additive manufacturing. In large-format printing, parts are often designed to be an even number of beads wide to produce a completely dense part. However, voids can still arise. This is often due to the part not being an even number of bead widths wide in some areas, or in geometry containing acute angles, as the process of generating closed contours cannot completely fill the space. Voids can be tolerated in smaller models, but in large-format additive manufacturing they may cause mechanical defects. To fill these voids, open loop paths called skeletons are often used, but they are typically limited by the physical constraints defined in the slicing software. To address this, researchers at Oak Ridge National Laboratory have extended skeleton toolpaths via an adaptive methodology. These adaptive skeletons were found to better fill void spaces through manipulation of physical parameters of the build process and were calculated as part of the slicing process.

42 ENGINEERING↗

DOE OSTI2021

Spatial coupling of gyrokinetic simulations, a generalized scheme based on first-principles

In this paper, we present a scheme that spatially couples two gyrokinetic codes using first-principles. Coupled equations are presented and a necessary and sufficient condition for ensuring accuracy is derived. This new scheme couples both the field and the particle distribution function. The coupling of the distribution function is only performed once every few time-steps, using a five-dimensional (5D) grid to communicate the distribution function between the two codes. This 5D grid interface enables the coupling of different types of codes and models, such as particle and continuum codes, or delta-f and total-f models. Transferring information from the 5D grid to the marker particle weights is achieved using a new resampling technique. Demonstration of the coupling scheme is shown using two XGC gyrokinetic simulations for both the core and edge. We also apply the coupling scheme to two continuum simulations for a one-dimensional advection–diffusion problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

The Area Localized Coupled Model for Analytical Mean Flow Prediction in Arbitrary Wind Farm Geometries

This work introduces the area localized coupled (ALC) model, which extends the applicability of approaches that couple classical wake superposition models and atmospheric boundary layer models to wind farms with arbitrary layouts. Coupling wake and top–down boundary layer models is particularly challenging since the latter requires averaging over planform areas associated with turbine-specific regions of the flow that need to be specified. The ALC model uses Voronoi tessellation to define this local area around each turbine. A top–down description of a developing internal boundary layer is then applied over Voronoi cells upstream of each turbine to estimate the local mean velocity profile. Coupling between the velocity at hub-height based on this localized top–down model and a wake model is achieved by enforcing a minimum least-square-error in mean velocity in each cell. The wake model in the present implementation takes into account variations in wind farm inflow velocity and represents the wake profile behind each turbine as a super-Gaussian function that smoothly transitions between a top-hat shape in the region immediately following the turbine to a Gaussian profile downstream. Detailed comparisons to large-eddy simulation (LES) data from two different wind farms demonstrate the efficacy of the model in accurately predicting both wind farm power output and local turbine hub-height velocity for different wind farm geometries. These validations using data generated from two different LES codes demonstrate the model's versatility with respect to capturing results from different simulation setups and wind farm configurations.

49 EE - Wind and Water Power Program - Wind (EE-4W↗

DOE OSTI2023

Toward implementing autonomous adaptive data acquisition for scanning hyperspectral imaging of biological systems

Autonomous experimentation is an emerging area of research, primarily related to autonomous vehicles, scientific combinatorial discovery approaches in materials science and drug discovery, and iterative research loops of planning, experimentation, and analysis. However, autonomous approaches developed in these contexts are difficult to apply to high-dimensional mapping technologies, such as scanning hyperspectral imaging of biological systems, due to sample complexity and heterogeneity. We briefly cover the history of adaptive sampling algorithms and surrogate modeling in order to define autonomous adaptive data acquisition as an objective-based, flexible building block for future biological imaging experimentation driven by intelligent infrastructure. We subsequently summarize the recent implementations of autonomous adaptive data acquisition (AADA) for scanning hyperspectral imaging, assess how these address the difficulties of autonomous approaches in hyperspectral imaging, and highlight the AADA design variation from a goal-oriented perspective. Finally, we present a modular AADA architecture that embeds AADA-driven flexible building blocks to address the challenge of time resolution for high-dimensional scanning hyperspectral imaging of nonequilibrium dynamical systems. In our example research-driven experimental design case, we propose an AADA infrastructure for time-resolved, noninvasive, and label-free scanning hyperspectral imaging of living biological systems. This AADA infrastructure can accurately target the correct state of the system for experimental workflows that utilize subsequent expensive, high-information-content analytical techniques.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

Evolution of the age-included nearest pair distribution in disperse multiphase flows

The age of the nearest particle pair is introduced as the difference between the current time and the most recent time when the nearest particle pair was formed. The evolution equation for the age-included nearest pair distribution function is derived. With the assumption of random destruction of the nearest particle pairs, the evolution equation predicts the exponential probability distribution of the ages of the nearest particle pairs. Particle-resolved numerical simulations with moving particles are performed to verify this prediction. The equation is then used to derive the evolution equation for the particle–fluid–particle (PFP) stress, which is known to be related to hyperbolicity of the two-fluid equations. It is found that the relaxation time of the age probability distribution is also the relaxation time for the PFP stress. Guided by the closure terms in the PFP stress evolution equation, we study kinematics of the nearest particle pairs in the particle-resolved simulations for flows caused by sedimentation of the particles with initially isotropic and homogeneous particle distributions. At the steady states, the particle Reynolds numbers are around 20. Anisotropy and inhomogeneity of particle distributions are seen to develop in these flows. The mean distances to the nearest particles and evolution of the distribution of the Voronoi cell volumes are studied. We also found the PFP stress is closely related to the changes in these inter-particle scale quantities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Shape effects on the local dynamics of suspensions of spheroidal particles

The effect of shape on the dynamics of suspensions of non-spherical heavy particles is examined by fully resolved numerical simulations of oblate and prolate spheroids, as well as spheres, for a density ratio of ten, volume fractions ranging from 0.5% to 5%, and Reynolds numbers between 20 and 30. The dynamics is determined both by the interactions of the particles with the fluid as well as by collisions, with the number and importance of collisions increasing with volume fractions. A single isolated oblate or prolate spheroid falling under gravity generally falls broadside on, for the governing parameters examined here, and at low-volume fractions, the majority of particles in a suspension fall that way. At higher-volume fractions, the orientation is more random. The slip velocity decreases as the volume fraction increases for all shapes, as expected, but the effect of the shape is much less than seen for a single particle. Furthermore, this seems to be due to two effects. For all volume fractions, the most deformed particles cluster more than spheres and less deformed particles, which increases their slip velocity. As the concentration increases, the increased particle interactions also causes more particles to fall short side-on, which reduces the frontal area and the resulting drag, increasing the slip velocity. This second effect is, of course, absent for spherical particles.

42 ENGINEERING↗