Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.authorAbbas, Abdulwaheden_US
dc.contributor.authorNasri, Ahmad Hen_US
dc.description.abstractSummary form only given. A polygonal complex is a polygonal mesh that defines a curve with additional differential information such as tangent plane or normal and curvature values. In this sense, a polygonal complex corresponds to a curve interpolated by the limit surface of any polygonal mesh embodying it. We advance an approach for the deformation of subdivision surfaces under interpolation constraints. This is achieved by allowing the user to tag a configuration consisting of points, points with normal, or even control polygons and to deform the surface while maintaining the interpolation constraints. The constraints information can be converted, by means of a graphical user interface, into scalars defining various transformation parameters which have the ability to deform the surface when applied to the faces of the complex.en_US
dc.subjectRecursive functionsen_US
dc.subjectSplines (mathematics)en_US
dc.subjectComputational geometryen_US
dc.subjectMesh generationen_US
dc.subjectSurface fittingen_US
dc.subject.lcshGraphical user interfaces (Computer systems)en_US
dc.subject.lcshCurv fittingen_US
dc.titleDeforming Catmull-Clark subdivision surfaces for computer graphicsen_US
dc.typeConference Paperen_US
dc.relation.conferenceACS/IEEE International Conference on Computer Systems and Applications (14-18 July 2003 : Tunis, Tunisia)en_US
dc.contributor.affiliationDepartment of Computer Scienceen_US
dc.relation.ispartoftextACS/IEEE International Conference on Computer Systems and Applications, 2003. Book of Abstractsen_US
Appears in Collections:Department of Computer Science
Show simple item record

Google ScholarTM


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