Premium
Pseudo‐Spline Subdivision Surfaces
Author(s) -
Deng Chongyang,
Hormann Kai
Publication year - 2014
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12448
Subject(s) - subdivision , quadrilateral , spline (mechanical) , subdivision surface , polygon mesh , box spline , vertex (graph theory) , mathematics , topology (electrical circuits) , computer science , neighbourhood (mathematics) , limit (mathematics) , algorithm , geometry , discrete mathematics , mathematical analysis , combinatorics , spline interpolation , finite element method , computer vision , graph , physics , archaeology , structural engineering , bilinear interpolation , engineering , history , thermodynamics
Pseudo‐splines provide a rich family of subdivision schemes with a wide range of choices that meet various demands for balancing the approximation power, the length of the support, and the regularity of the limit functions. Special cases of pseudo‐splines include uniform odd‐degree B‐splines and the interpolatory 2n‐point subdivision schemes, and the other pseudo‐splines fill the gap between these two families. In this paper we show how the refinement step of a pseudo‐spline subdivision scheme can be implemented efficiently using repeated local operations, which require only the data in the direct neighbourhood of each vertex, and how to generalize this concept to quadrilateral meshes with arbitrary topology. The resulting pseudo‐spline surfaces can be arbitrarily smooth in regular mesh regions and C 1 at extraordinary vertices as our numerical analysis reveals.