科技报告详细信息
Robust Metric-Aligned Quad-Dominant Meshing Using L(sub p) Centroidal Voronoi Tessellation
Ekelschot, Dirk ; Ceze, Marco ; Garai, Anirban ; Murman, Scott
关键词: ALGORITHMS;    ANISOTROPY;    COMPUTATIONAL FLUID DYNAMICS;    DISCONTINUITY;    EIGENVECTORS;    EMBEDDING;    EUCLIDEAN GEOMETRY;    GRID GENERATION (MATHEMATICS);    ISOTROPY;    METRIC SPACE;    RIEMANN MANIFOLD;    SHOCK WAVES;    TENSORS;   
RP-ID  :  AIAA Paper 2018-1501,ARC-E-DAA-TN50877
学科分类:航空航天科学
美国|英语
来源: NASA Technical Reports Server
PDF
【 摘 要 】

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.

【 预 览 】
附件列表
Files Size Format View
20190030813.pdf 8199KB PDF download
  文献评价指标  
  下载次数:16次 浏览次数:29次