Pseudo-Spline Subdivision Surfaces
| dc.contributor.author | Deng, Chongyang | en_US |
| dc.contributor.author | Hormann, Kai | en_US |
| dc.contributor.editor | Thomas Funkhouser and Shi-Min Hu | en_US |
| dc.date.accessioned | 2015-03-03T12:42:57Z | |
| dc.date.available | 2015-03-03T12:42:57Z | |
| dc.date.issued | 2014 | en_US |
| dc.description.abstract | 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 C1 at extraordinary vertices as our numerical analysis reveals. | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.identifier.doi | 10.1111/cgf.12448 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12448 | en_US |
| dc.publisher | The Eurographics Association and John Wiley and Sons Ltd. | en_US |
| dc.title | Pseudo-Spline Subdivision Surfaces | en_US |