TY - JOUR
T1 - Isotropic Surface Remeshing without Large and Small Angles
AU - Wang, Yiqun
AU - Yan, Dong-Ming
AU - Liu, Xiaohan
AU - Tang, Chengcheng
AU - Guo, Jianwei
AU - Zhang, Xiaopeng
AU - Wonka, Peter
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: We thank anonymous reviewer for their valuable comments and suggestions. This work is partially funded by the National Natural Science Foundation of China (61772523, 61620106003, 61331018), the Beijing Natural Science Foundation (4184102), and the KAUST Visual Computing Center. Y. Wang and D.-M. Yan are joint first author with equal contribution. D.-M. Yan is the corresponding author.
PY - 2018/5/18
Y1 - 2018/5/18
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/627978
UR - https://ieeexplore.ieee.org/document/8361045/
UR - http://www.scopus.com/inward/record.url?scp=85047185070&partnerID=8YFLogxK
U2 - 10.1109/tvcg.2018.2837115
DO - 10.1109/tvcg.2018.2837115
M3 - Article
SN - 1077-2626
VL - 25
SP - 2430
EP - 2442
JO - IEEE Transactions on Visualization and Computer Graphics
JF - IEEE Transactions on Visualization and Computer Graphics
IS - 7
ER -