Mesh offsetting plays an important role in discrete geometric processing. In this paper, we propose a parallel feature-preserving mesh offsetting framework with variable distance. Different from the traditional method based on distance and normal vector, a new calculation of offset position is proposed by using dynamic programming and quadratic programming, and the sharp feature can be preserved after offsetting. Instead of distance implicit field, a spatial coverage region represented by polyhedral for computing offsets is proposed. Our method can generate an offsetting model with smaller mesh size, and also can achieve high quality without gaps, holes, and self-intersections. Moreover, several acceleration techniques are proposed for the efficient mesh offsetting, such as the parallel computing with grid, AABB tree and rays computing. In order to show the efficiency and robustness of the proposed framework, we have tested our method on the quadmesh dataset, which is available at [https://www.quadmesh.cloud]. The source code of the proposed algorithm is available on GitHub at [https://github.com/iGame-Lab/PFPOffset].

翻译：网格偏移在离散几何处理中具有重要作用。本文提出了一种支持可变距离的特征保持并行网格偏移框架。不同于传统基于距离和法向量的方法，我们提出了一种结合动态规划与二次规划的新型偏移位置计算方法，使偏移后能够保持尖锐特征。该方法无需使用距离隐式场，而是提出了一种以多面体表示的空间覆盖区域来计算偏移量。我们的方法能够生成网格规模更小的偏移模型，同时实现无缝隙、无孔洞、无自相交的高质量结果。此外，本文还提出了多种加速技术以实现高效网格偏移，例如基于网格的并行计算、轴对齐包围盒树与射线计算。为验证所提框架的效率与鲁棒性，我们在四边网格数据集（可于[https://www.quadmesh.cloud]获取）上进行了测试。所提算法的源代码已发布于GitHub：[https://github.com/iGame-Lab/PFPOffset]。