Build the Catmull-Clark limit stencil of every vertex of a quad cage.
An interior vertex of valence n goes to (n^2 P + 4 sum E + sum D) / (n (n + 5)),
its edge neighbours E and the opposite corners D of its quads
(Halstead, Kass and DeRose 1993, SIGGRAPH, "Efficient, fair interpolation
using Catmull-Clark surfaces"); a boundary vertex, whose boundary is an
infinitely sharp crease, goes to (A + 4 P + B) / 6 along its two boundary
neighbours, the cubic B-spline limit subdivideAutoMovieSurface gives
boundaries.
Build the Catmull-Clark limit stencil of every vertex of a quad cage.
An interior vertex of valence
ngoes to(n^2 P + 4 sum E + sum D) / (n (n + 5)), its edge neighboursEand the opposite cornersDof its quads (Halstead, Kass and DeRose 1993, SIGGRAPH, "Efficient, fair interpolation using Catmull-Clark surfaces"); a boundary vertex, whose boundary is an infinitely sharp crease, goes to(A + 4 P + B) / 6along its two boundary neighbours, the cubic B-spline limitsubdivideAutoMovieSurfacegives boundaries.