Numerical analysis Interpolation, splines and geometric modeling Theorem
Catmull–Clark subdivision surface
Builds on Subdivision surfaceB-spline
Statement
Let be a closed polygon mesh in : 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 as follows.
- For each face , the face point is the average of the vertices of .
- For each edge with endpoints and adjacent faces , the edge point is .
- Each old vertex of valence moves to . Here is the average of the face points of the faces at . Also, is the average of the midpoints of the edges at .
- Each face with vertices is replaced by quadrilaterals. The one at a vertex of has as vertices , the edge points of the two edges of at , and .
Call a vertex extraordinary if its valence is not . Then the following hold.
- Every face of is a quadrilateral, and from the second step on, the number of extraordinary vertices does not change.
- Consider a part of the mesh where all faces are quadrilaterals and all vertices have valence . 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.
- The repeated meshes 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 , 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 , where the vertex rule becomes . 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 quadrilateral faces, and its corners stay extraordinary of valence . 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
- no evidence level
- B-spline concept
- Subdivision surface concept
- Catmull–Clark subdivision surface statement
Further reading
About this page
| Tag | PF5Z57DDG2 |
|---|---|
| URI | m2://PF5Z57DDG2 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 65D17, 68U05, 65D18 |
| Status | This copy of the site has no build data. Run m2 status PF5Z57DDG2. |
| About | Subdivision surface |
| Uses | Subdivision 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.