Please use this identifier to cite or link to this item:
|Title:||A less-constrained solution to curve interpolation by catmull-clark subdivision surfaces||Authors:||Abbas, Abdulwahed||Affiliations:||Department of Computer Science||Issue Date:||2009||Publisher:||ACM New York||Part of:||Proceedings of the 2009 Computer Graphics International Conference||Start page:||63||End page:||72||Conference:||Computer Graphics International Conference (26-29 May 2009 : Victoria, British Columbia, Canada)||Abstract:||
This paper reports a generic solution to the problem of constructing Catmull-Clark subdivision surfaces to interpolate arbitrarily intersecting meshes of curves, which is less constrained than already published solutions following this approach. Besides making surface generation more straightforward, the proposed scheme seems to improve the quality of the surface in terms of smoothness at and around extraordinary points. Moreover, the scheme permits the construction in explicit form of a subdivision matrix integrating the interpolation constraints.
|Appears in Collections:||Department of Computer Science|
Show full item record
checked on Oct 23, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.