Anonymous user
Catmull–Clark subdivision surface: Difference between revisions
Needs graphics
(→{{header|Mathematica}}: mark wall-of-text for improvement) |
(Needs graphics) |
||
Line 1:
{{task|3D}}[[Category:Graphics algorithms]][[requires::Capability:Graphics| ]]
Implement the Catmull-Clark surface subdivision ([[wp:Catmull–Clark_subdivision_surface|description on Wikipedia]]), which is an algorithm that maps from a surface (described as a set of points and a set of polygons with vertices at those points) to another more refined surface. The resulting surface will always consist of a mesh of quadrilaterals.
The process for computing the new locations of the points works as follows when the surface is free of holes:
| |||