Please use this identifier to cite or link to this item:
Title: Deforming Catmull-Clark subdivision surfaces for computer graphics
Authors: Abbas, Abdulwahed
Nasri, Ahmad H
Affiliations: Department of Computer Science 
Keywords: Recursive functions
Splines (mathematics)
Computational geometry
Mesh generation
Surface fitting
Subjects: Interpolation
Graphical user interfaces (Computer systems)
Curv fitting
Issue Date: 2003
Publisher: IEEE
Part of: ACS/IEEE International Conference on Computer Systems and Applications, 2003. Book of Abstracts
Conference: ACS/IEEE International Conference on Computer Systems and Applications (14-18 July 2003 : Tunis, Tunisia) 
Summary 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.
Ezproxy URL: Link to full text
Type: Conference Paper
Appears in Collections:Department of Computer Science

Show full item record

Record view(s)

checked on May 24, 2024

Google ScholarTM


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