Patching Catmull-Clark meshes

Named after the title, the PCCM transformation is a simple, explicit algorithm that creates large, smoothly joining bicubic Nurbs patches from a refined Catmull-Clark subdivision mesh. The resulting patches are maximally large in the sense that one patch corresponds to one quadrilateral facet of the initial, coarsest quadrilateral mesh before subdivision. The patches join parametrically ¡£¢ and agree with the Catmull-Clark limit surface except in the immediate neighborhood of extraordinary mesh nodes; in such a neighborhood they join at least with tangent continuity and interpolate the limit of the extraordinary mesh node. The PCCM transformation integrates naturally with array-based implementations of subdivision surfaces. CR Categories: I.3.5 [surface representation, splines]: I.3.6— graphics data structures

• Type: Conference
• Year: 2000
• Where: SIGGRAPH
• Authors: Jörg Peters
• Keywords: Catmull-Clark Subdivision Mesh, Coarsest Quadrilateral Mesh, Computer Graphics, Extraordinary Mesh Node, SIGGRAPH 2000