Wang Yiqun, Yan Dong-Ming, Liu Xiaohan, Tang Chengcheng, Guo Jianwei, Zhang Xiaopeng, Wonka Peter
IEEE Trans Vis Comput Graph. 2018 May 18. doi: 10.1109/TVCG.2018.2837115.
We introduce a novel algorithm for isotropic surface remeshing which progressively eliminates obtuse triangles and improves small angles. The main novelty of the proposed approach is a simple vertex insertion scheme that facilitates the removal of large angles, and a vertex removal operation that improves the distribution of small angles. In combination with other standard local mesh operators, e.g., connectivity optimization and local tangential smoothing, our algorithm is able to remesh efficiently a low-quality mesh surface. Our approach can be applied directly or used as a post-processing step following other remeshing approaches. Our method has a similar computational efficiency to the fastest approach available, i.e., real-time adaptive remeshing [1]. In comparison with state-of-the-art approaches, our method consistently generates better results based on evaluations using different metrics.
我们介绍了一种用于各向同性曲面重新网格化的新颖算法，该算法逐步消除钝角三角形并改善小角度。所提出方法的主要新颖之处在于一种简单的顶点插入方案，该方案有助于消除大角度，以及一种顶点移除操作，该操作可改善小角度的分布。与其他标准局部网格算子（例如，连通性优化和局部切向平滑）相结合，我们的算法能够有效地对低质量网格表面进行重新网格化。我们的方法可以直接应用，也可以用作其他重新网格化方法之后的后处理步骤。我们的方法具有与现有最快方法（即实时自适应重新网格化[1]）相似的计算效率。与现有最先进的方法相比，基于使用不同指标的评估，我们的方法始终能产生更好的结果。
