首页> 外文会议>International conference on numerical geometry, grid generation and scientific computing >Structured Orthogonal Near-Boundary Voronoi Mesh Layers for Planar Domains
【24h】

Structured Orthogonal Near-Boundary Voronoi Mesh Layers for Planar Domains

机译:平面域的结构化正交近边界Voronoi网格层

获取原文

摘要

We consider the problem of constructing a 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 a self-organization meshing algorithm which covers the boundary of domain by an almost-structured band of non-simplicial Delaunay cells. This band consists of quadrangles on the smooth boundary segment and convex polygons around sharp corners. The dual Voronoi mesh is a double-layered orthogonal structure where the central line of the layer approximates the boundary. The 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. We introduce refinement schemes for the Voronoi boundary layers, in particular near sharp corners and discuss problems related to the generalization of the suggested algorithm in 3d.
机译:我们考虑构造纯Voronoi网格的问题,其中未切割的Voronoi单元的并集近似具有分段平滑边界的平面计算域。平滑的边界片段由Voronoi边缘近似,并且Voronoi顶点放置在尖锐边界角的顶点附近。我们建议一种自组织网格划分算法,该算法通过非简单Delaunay单元的几乎结构化的带覆盖域的边界。该带由光滑边界线段上的四边形和尖角周围的凸多边形组成。双Voronoi网格是双层正交结构,其中层的中心线接近边界。整个Voronoi网格具有混合结构,并且由区域核心中的高质量凸多边形和边界附近的正交分层结构组成。我们介绍了Voronoi边界层的细化方案,特别是在尖角附近,并讨论了与3d中建议算法的推广有关的问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号