Math 2.0

Numerical analysis Interpolation, splines and geometric modeling Theorem

Catmull–Clark subdivision surface

Builds on Subdivision surfaceB-spline

Statement

Let MM be a closed polygon mesh in ℝ3\R^3: finitely many vertices, edges and polygonal faces, where every edge lies on exactly two faces. The valence of a vertex is the number of edges at it; on such a mesh it equals the number of faces at it. One step of Catmull–Clark subdivision builds a new mesh M′M' as follows.

  1. For each face ff, the face point FfF_f is the average of the vertices of ff.
  2. For each edge ee with endpoints P1,P2P_1, P_2 and adjacent faces f1,f2f_1, f_2, the edge point is Ee=14(P1+P2+Ff1+Ff2)E_e = \frac{1}{4}(P_1 + P_2 + F_{f_1} + F_{f_2}).
  3. Each old vertex PP of valence nn moves to P′=1n(Q+2R+(n−3)P)P' = \frac{1}{n}\big(Q + 2R + (n - 3) P\big). Here QQ is the average of the face points of the nn faces at PP. Also, RR is the average of the midpoints of the nn edges at PP.
  4. Each face ff with kk vertices is replaced by kk quadrilaterals. The one at a vertex PP of ff has as vertices P′P', the edge points of the two edges of ff at PP, and FfF_f.

Call a vertex extraordinary if its valence is not 44. Then the following hold.

  1. Every face of M′M' is a quadrilateral, and from the second step on, the number of extraordinary vertices does not change.
  2. Consider a part of the mesh where all faces are quadrilaterals and all vertices have valence 44. There the step is the refinement rule of the uniform bicubic B-spline surface with the mesh as control net. So the repeated meshes converge there to that surface, which is twice continuously differentiable.
  3. The repeated meshes M,M′,M′′,…M, M', M'', \ldots converge to a limit surface, which has a continuous tangent plane also at the limits of the extraordinary vertices.

Remarks

Clause 1 is a count of valences. Face points get the valence of the old face, edge points get valence 44, and moved old vertices keep their valence. So after one step only the old extraordinary vertices and the face points of non-quadrilateral faces are extraordinary, and later steps create no new ones. Clause 2 is checked by writing a bicubic B-spline patch on a uniform grid and halving the knot spacing. The new control points are then given by the three averaging rules above with n=4n = 4, where the vertex rule becomes P′=14(Q+2R+P)P' = \frac14(Q + 2R + P). Clause 3 needs a separate analysis of the subdivision matrix around an extraordinary vertex, through its eigenvalues; the surface is in general not twice differentiable there. Example: start from a cube; after one step it has 2424 quadrilateral faces, and its 88 corners stay extraordinary of valence 33. The limit surface is a smooth rounded cube.

Going deeper

For a student

Catmull–Clark subdivision is the best known example of a subdivision surface. It generalises bicubic B-spline surfaces from regular grids to meshes of any topology, and it is widely used in computer graphics and animation. The price is a loss of smoothness at the few extraordinary points, which is studied through the spectrum of the local subdivision matrix. Other schemes, such as Loop subdivision for triangle meshes, follow the same pattern.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. B-spline concept
  2. Subdivision surface concept
  3. Catmull–Clark subdivision surface statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Catmull%E2%80%93Clark_subdivision_surface
About this page
TagPF5Z57DDG2
URIm2://PF5Z57DDG2
Kindstatement, theorem
WritingW0 stub
MSC65D17, 68U05, 65D18
StatusThis copy of the site has no build data. Run m2 status PF5Z57DDG2.
AboutSubdivision surface
UsesSubdivision surface, B-spline
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.