arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.05332math.NAcs.NA
收藏

平面域近边界Voronoi网格层的构造

Construction of near-boundary Voronoi mesh layers for planar domains

Dorodnicyn Computing Center FRC CSC RAS(多罗德尼琴科计算中心俄罗斯科学院联邦研究中心);Moscow Institute of Physics and Technology(莫斯科物理技术学院);Keldysh Institute of Applied Mathematics RAS(凯尔迪什应用数学研究所俄罗斯科学院)

V. A. Garanzha, L. N. Kudryavtseva, V. O. Tsvetkova

AI总结:

本文提出一种自组织算法,通过非单纯Delaunay单元构建近边界Voronoi网格,用于近似具有分段光滑边界的平面计算域,核心贡献是实现高质量凸多边形和正交分层结构的混合网格。

摘要:

我们考虑构造纯Voronoi网格的问题,其中未切割的Voronoi单元的并集近似具有分段光滑边界的平面计算域。光滑边界片段由Voronoi边近似,Voronoi顶点置于尖锐边界角的附近。我们提出了一种自组织网格算法,通过几乎结构化的非单纯Delaunay单元带覆盖域边界。该带由平滑边界段上的四边形和尖锐角周围的凸多边形组成。双Voronoi网格是双层正交结构,其中层的中心线近似边界。整体Voronoi网格具有混合结构,由域核心的高质量凸多边形和近边界处的正交分层结构组成。

英文摘要:

We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth boundary fragments are approximated by the Voronoi edges and Voronoi vertices are placed near summits of sharp boundary corners. We suggest self-organization meshing algorithm which covers the boundary of domain by a almost-structured band of non-simplicial Delaunay cells. This band consists of quadrangles on the smooth boundary segment and convex polygons around sharp corners. Dual Voronoi mesh is double layered orthogonal structure where central line of the layer approximates the boundary. Overall Voronoi mesh has a hybrid structure and consists of high quality convex polygons in the core of the domain and orthogonal layered structure near boundaries.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑