GPU算法的设计及其在网格加密中的应用
On Designing GPU Algorithms with Applications to Mesh Refinement
摘要:
我们提出了一套规则来指导GPU算法的设计。这些规则基于减少GPU实用程序中的浪费以实现良好的加速的原则。根据这些规则,我们提出了GPU算法的二维约束,三维约束和三维限制Delaunay细化问题分别。该算法以二维平面直线图(PSLG)或三维分段线性复形(PLC)$\mathcal{G}$为输入,生成符合或近似于$\mathcal{G}$的高质量网格。我们的算法的实施表明,他们是第一个运行的数量级速度比当前国家的最先进的同行在顺序和并行的方式,同时使用类似数量的施泰纳点产生的三角测量的质量相当。因此,它减少了网格细化的计算时间从可能的几个小时到几秒钟或几分钟,可能用于交互式图形应用程序。
英文摘要:
We present a set of rules to guide the design of GPU algorithms. These rules are grounded on the principle of reducing waste in GPU utility to achieve good speed up. In accordance to these rules, we propose GPU algorithms for 2D constrained, 3D constrained and 3D Restricted Delaunay refinement problems respectively. Our algorithms take a 2D planar straight line graph (PSLG) or 3D piecewise linear complex (PLC) $\mathcal{G}$ as input, and generate quality meshes conforming or approximating to $\mathcal{G}$. The implementation of our algorithms shows that they are the first to run an order of magnitude faster than current state-of-the-art counterparts in sequential and parallel manners while using similar numbers of Steiner points to produce triangulations of comparable qualities. It thus reduces the computing time of mesh refinement from possibly hours to a few seconds or minutes for possible use in interactive graphics applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。