Patching Catmull-Clark meshes

  • Authors:
  • Jörg Peters

  • Affiliations:
  • University of Florida

  • Venue:
  • Proceedings of the 27th annual conference on Computer graphics and interactive techniques
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 C2 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.