Show simple item record

dc.contributor.authorDeng, Chongyangen_US
dc.contributor.authorHormann, Kaien_US
dc.contributor.editorThomas Funkhouser and Shi-Min Huen_US
dc.date.accessioned2015-03-03T12:42:57Z
dc.date.available2015-03-03T12:42:57Z
dc.date.issued2014en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.12448en_US
dc.description.abstractPseudo-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.publisherThe Eurographics Association and John Wiley and Sons Ltd.en_US
dc.titlePseudo-Spline Subdivision Surfacesen_US
dc.description.seriesinformationComputer Graphics Forumen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record