Fast, Parallel, High-Quality Voronoi Mesh Generator

In this work we propose to further develop and demonstrate a mesh generation approach based on clipped Voronoi diagrams. This approach to mesh generation has the potential to significantly improve performance and robustness, while retaining important elements of high quality meshes including boundary alignment, stretching, and element regularity. Clipped Voronoi diagrams also automatically de-feature the underlying geometry at the local resolution of the generating points, and can thus significantly impact the problem of CAD clean-up and defeaturing.The mathematical properties of Voronoi diagramsenable highly scalable mesh generation, since the global mesh is uniquely defined yet each individual cell can be constructed with only local information. Importantly the Voronoi paradigm reduces the problem of mesh generation to the much simpler problem of specifying thelocations (point cloud) where the solution will be sampled. The actual mesh (volumes, faces, topology, neighbor connectivity) is simply a unique mathematical consequence of this choice. This dramatically simplifies control over local mesh resolution - an important consideration for automation and high-fidelity simulations. Additionally, the discretization of the boundary surfaceis independent from the near-boundary mesh resolution, allowing arbitrary coarsening or refinement relative to the local surface length scales. The impact of leveraging these benefits in mesh generation will be a dramatic reduction in the time and human interaction required to generate quality meshes for high-fidelity applications.Understanding solution sensitivity to the point cloud parameters is the technical objective of the current proposal. We will asses solution sensitivity with respect to three different aspects related to the spatial arrangement of the point cloud. The cases investigated are relevant building blocks for aerodynamic problems of interest, i.e., the NASA Juncture Flow experiments.