10 April 2018 A fast and accurate dihedral interpolation loop subdivision scheme
Author Affiliations +
Proceedings Volume 10615, Ninth International Conference on Graphic and Image Processing (ICGIP 2017); 1061547 (2018) https://doi.org/10.1117/12.2303354
Event: Ninth International Conference on Graphic and Image Processing, 2017, Qingdao, China
Abstract
In this paper, we propose a fast and accurate dihedral interpolation Loop subdivision scheme for subdivision surfaces based on triangular meshes. In order to solve the problem of surface shrinkage, we keep the limit condition unchanged, which is important. Extraordinary vertices are handled using modified Butterfly rules. Subdivision schemes are computationally costly as the number of faces grows exponentially at higher levels of subdivision. To address this problem, our approach is to use local surface information to adaptively refine the model. This is achieved simply by changing the threshold value of the dihedral angle parameter, i.e., the angle between the normals of a triangular face and its adjacent faces. We then demonstrate the effectiveness of the proposed method for various 3D graphic triangular meshes, and extensive experimental results show that it can match or exceed the expected results at lower computational cost.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhuo Shi, Zhuo Shi, Yalei An, Yalei An, Zhongshuai Wang, Zhongshuai Wang, Ke Yu, Ke Yu, Si Zhong, Si Zhong, Rushi Lan, Rushi Lan, Xiaonan Luo, Xiaonan Luo, } "A fast and accurate dihedral interpolation loop subdivision scheme", Proc. SPIE 10615, Ninth International Conference on Graphic and Image Processing (ICGIP 2017), 1061547 (10 April 2018); doi: 10.1117/12.2303354; https://doi.org/10.1117/12.2303354
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT


Back to Top