Catmull–Clark subdivision surface

First three steps of Catmull–Clark subdivision of a cube with subdivision surface below (note that the Catmull-Clark bi-cubic interpolation above cannot approach an actual sphere, as a sphere would be quadric).

The Catmull–Clark algorithm is a technique used in computer graphics to create smooth surfaces by subdivision surface modeling. It was devised by Edwin Catmull and Jim Clark in 1978 as a generalization of bi-cubic uniform B-spline surfaces to arbitrary topology.[1] In 2005, Edwin Catmull received an Academy Award for Technical Achievement together with Tony DeRose and Jos Stam for their invention and application of subdivision surfaces.

Recursive evaluation

Catmull–Clark surfaces are defined recursively, using the following refinement scheme:[1]

Start with a mesh of an arbitrary polyhedron. All the vertices in this mesh shall be called original points.

  • For each face, add a face point
    • Set each face point to be the average of all original points for the respective face.
  • For each edge, add an edge point.
    • Set each edge point to be the average of the two neighbouring face points and its two original endpoints.
  • For each face point, add an edge for every edge of the face, connecting the face point to each edge point for the face.
  • For each original point P, take the average F of all n (recently created) face points for faces touching P, and take the average R of all n edge midpoints for (original) edges touching P, where each edge midpoint is the average of its two endpoint vertices (not to be confused with new "edge points" above). Move each original point to the point
This is the barycenter of P, R and F with respective weights (n − 3), 2 and 1.
  • Connect each new vertex point to the new edge points of all original edges incident on the original vertex.
  • Define new faces as enclosed by edges.

The new mesh will consist only of quadrilaterals, which in general will not be planar. The new mesh will generally look smoother than the old mesh.

Repeated subdivision results in smoother meshes. It can be shown that the limit surface obtained by this refinement process is at least at extraordinary vertices and everywhere else (when n indicates how many derivatives are continuous, we speak of continuity). After one iteration, the number of extraordinary points on the surface remains constant.

The arbitrary-looking barycenter formula was chosen by Catmull and Clark based on the aesthetic appearance of the resulting surfaces rather than on a mathematical derivation, although Catmull and Clark do go to great lengths to rigorously show that the method converges to bicubic B-spline surfaces.[1]

Exact evaluation

The limit surface of Catmull–Clark subdivision surfaces can also be evaluated directly, without any recursive refinement. This can be accomplished by means of the technique of Jos Stam.[2] This method reformulates the recursive refinement process into a matrix exponential problem, which can be solved directly by means of matrix diagonalization.

Software using Catmull–Clark subdivision surfaces

See also

References

  1. 1 2 3 Catmull, E.; Clark, J. (1978). "Recursively generated B-spline surfaces on arbitrary topological meshes" (PDF). Computer-Aided Design. 10 (6): 350. doi:10.1016/0010-4485(78)90110-0.
  2. ↑ Stam, J. (1998). "Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values". Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 (PDF). pp. 395–404. doi:10.1145/280814.280945. ISBN 0-89791-999-8.
  3. ↑ http://www.ptc.com/File%20Library/Community/Academic%20Program/College_Student_Primer_Creo_2.pdf
  4. ↑ Manuel Kraemer (2014). "OpenSubdiv: Interoperating GPU Compute and Drawing". In Martin Watt, Erwin Coumans, George ElKoura, Ronald Henderson, Manuel Kraemer, Jeff Lait, James Reinders. Multithreading for Visual Effects. CRC Press. pp. 163–199. ISBN 978-1-4822-4356-7.
  5. ↑ https://www.youtube.com/watch?v=xFZazwvYc5o
  6. ↑ http://www.fxguide.com/featured/pixars-opensubdiv-v2-a-detailed-look/
  7. ↑ http://on-demand.gputechconf.com/gtc/2014/video/S4856-subdivision-surfaces-industry-standard.mp4
  8. ↑ https://www.youtube.com/watch?v=dzIl_S-qHIQ

Further reading

  • Derose, T.; Kass, M.; Truong, T. (1998). "Subdivision surfaces in character animation". Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 (PDF). p. 85. doi:10.1145/280814.280826. ISBN 0897919998.
  • Loop, C.; Schaefer, S. (2008). "Approximating Catmull-Clark subdivision surfaces with bicubic patches" (PDF). ACM Transactions on Graphics. 27: 1. doi:10.1145/1330511.1330519.
  • Kovacs, D.; Mitchell, J.; Drone, S.; Zorin, D. (2010). "Real-Time Creased Approximate Subdivision Surfaces with Displacements" (PDF). IEEE Transactions on Visualization and Computer Graphics. 16 (5): 742. doi:10.1109/TVCG.2010.31. PMID 20616390. preprint
  • Matthias Nießner, Charles Loop, Mark Meyer, Tony DeRose, "Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces", ACM Transactions on Graphics Volume 31 Issue 1, January 2012, doi:10.1145/2077341.2077347, demo
  • Nießner, Matthias ; Loop, Charles ; Greiner, Günther: Efficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces: Eurographics 2012 Annex: Short Papers (Eurographics 2012, Cagliary). 2012, pp 41–44.
  • Wade Brainerd, Tessellation in Call of Duty: Ghosts also presented as a SIGGRAPH2014 tutorial
  • D. Doo and M. Sabin: Behavior of recursive division surfaces near extraordinary points, Computer-Aided Design, 10 (6) 356–360 (1978), (doi, pdf)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.