Please use this identifier to cite or link to this item: https://scholarhub.balamand.edu.lb/handle/uob/658
DC FieldValueLanguage
dc.contributor.authorAbbas, Abdulwaheden_US
dc.date.accessioned2020-12-23T08:34:29Z-
dc.date.available2020-12-23T08:34:29Z-
dc.date.issued2009-
dc.identifier.urihttps://scholarhub.balamand.edu.lb/handle/uob/658-
dc.description.abstractThis 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.en_US
dc.format.extent10 p.en_US
dc.language.isoengen_US
dc.publisherACM New Yorken_US
dc.titleA less-constrained solution to curve interpolation by catmull-clark subdivision surfacesen_US
dc.typeConference Paperen_US
dc.relation.conferenceComputer Graphics International Conference (26-29 May 2009 : Victoria, British Columbia, Canada)en_US
dc.contributor.affiliationDepartment of Computer Scienceen_US
dc.description.startpage63en_US
dc.description.endpage72en_US
dc.date.catalogued2018-03-01-
dc.description.statusPublisheden_US
dc.identifier.OlibID178209-
dc.relation.ispartoftextProceedings of the 2009 Computer Graphics International Conferenceen_US
dc.provenance.recordsourceOliben_US
Appears in Collections:Department of Computer Science
Show simple item record

Record view(s)

39
checked on Nov 21, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.