In the field of 3D computer graphics, a subdivision surface is a method of representing a smooth surface via the specification of a coarser polygon mesh. The smooth surface can be calculated from the coarse mesh as the limit of an iterative process of subdividing each polygonal face into smaller faces that better approximate the smooth surface. subdivision of a cube with subdivision surface below
Overview
The subdivision surfaces algorithm is recursive in nature. The process starts with a given polygonal mesh. A Refinement Scheme is then applied to this mesh. This process takes that mesh and subdivides it, creating new vertices and new faces. The positions of the new vertices in the mesh are computed based on the positions of nearby old vertices. In some refinement schemes, the positions of old vertices might also be altered. This process produces a denser mesh than the original one, containing more polygonal faces. This resulting mesh can be passed through the same refinement scheme again and so on. The limit subdivision surface is the surface produced from this process being iteratively applied infinitely many times. In practical use however, this algorithm is only applied a limited, and usually fairly small, number of times. Mathematically, the neighborhood of an extraordinary point of a subdivision surface is a spline with a parametrically singular point .
Refinement schemes
Subdivision surface refinement schemes can be broadly classified into two categories: interpolating and approximating. Interpolating schemes are required to match the original position of vertices in the original mesh. Approximating schemes are not; they can and will adjust these positions as needed. In general, approximating schemes have greater smoothness, but the user has less overall control of the outcome. This is analogous to spline surfaces and curves, where Bézier curves are required to interpolate certain control points, while B-Splines are not. There is another division in subdivision surface schemes as well: the type of polygon that they operate on. Some function for quadrilaterals, while others operate on triangles.
Approximating schemes
Approximating means that the limit surfaces approximate the initial meshes and that after subdivision, the newly generated control points are not in the limit surfaces. There are five approximating subdivision schemes:
Catmull and Clark generalizes bi-cubic uniform B-splineknot insertion. For arbitrary initial meshes, this scheme generates limit surfaces that are C2continuous everywhere except at extraordinary vertices where they are C1 continuous .
Doo-Sabin - The second subdivision scheme was developed by Doo and Sabin who successfully extended Chaikin's corner-cutting method for curves to surfaces. They used the analytical expression of bi-quadratic uniform B-spline surface to generate their subdivision procedure to produce C1 limit surfaces with arbitrary topology for arbitrary initial meshes. An auxiliary point can improve the shape of Doo-Sabin subdivision.
Loop, Triangles - Loop proposed his subdivision scheme based on a quartic box-spline of six direction vectors to provide a rule to generate C2 continuous limit surfaces everywhere except at extraordinary vertices where they are C1 continuous.
Mid-Edge subdivision scheme - The mid-edge subdivision scheme was proposed independently by Peters-Reif and Habib-Warren . The former used the mid-point of each edge to build the new mesh. The latter used a four-directional box spline to build the scheme. This scheme generates C1 continuous limit surfaces on initial meshes with arbitrary topology.
√3 subdivision scheme - This scheme has been developed by Kobbelt and offers several interesting features: it handles arbitrary triangular meshes, it is C2 continuous everywhere except at extraordinary vertices where it is C1 continuous and it offers a natural adaptive refinement when required. It exhibits at least two specificities: it is a Dual scheme for triangle meshes and it has a slower refinement rate than primal ones.
Interpolating schemes
After subdivision, the control points of the original mesh and the new generated control points are interpolated on the limit surface. The earliest work was so-called butterfly scheme by Dyn, Levin and Gregory, who extended the four-point interpolatory subdivision scheme for curves to a subdivision scheme for surface. Zorin, Schröder and Swelden noticed that the butterfly scheme cannot generate smooth surfaces for irregular triangle meshes and thus modified this scheme. Kobbelt further generalized the four-point interpolatory subdivision scheme for curves to the tensor product subdivision scheme for surfaces.
Doo-Sabin, Quads - generalization of bi-quadratic uniform B-splines
Butterfly, Triangles - named after the scheme's shape
