论文标题
GPU平行算法，用于基于终端边缘区域的多边形网格
GPU Parallel algorithm for the generation of polygonal meshes based on terminal-edge regions
论文作者
论文摘要
本文提出了一种GPU平行算法，以生成从Delaunay三角形获得的新型多边形网格。为了生成多边形网格，该算法首先使用分类系统标记输入三角剖分的每个边缘。其次，它使用标签系统从终端边缘区域构建多边形（简单或否），第三，它将每个非简单多边形从上一个阶段转换为简单的阶段，即凸或不凸多边形。我们显示了一些初步实验，以测试算法的可扩展性并将其与顺序版本进行比较。我们还运行了一个非常简单的测试，以表明这些网格对于虚拟元素方法很有用。
This paper presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtained from Delaunay triangulations. To generate the polygonal mesh, the algorithm first uses a classification system to label each edge of an input triangulation; second it builds polygons (simple or not) from terminal-edge regions using the label system, and third it transforms each non-simple polygon from the previous phase into simple ones, convex or not convex polygons. We show some preliminary experiments to test the scalability of the algorithm and compare it with the sequential version. We also run a very simple test to show that these meshes can be useful for the virtual element method.
