![]() ![]() Logic diagrams for Catmull-Clark and Loop Subdivision algorithms (collage from siggraph 2000 course notes) & basic implementations for quads, n-gons and triangulated meshesĪs indicated in the diagram, although interior vertices in are handled differently in both algorithms, they treat vertices on creases the same. The calculations and weights for the masks used to relocate both existing and new vertices in the subdivided mesh were set up according to the descriptions of Loop and Catmull-Clark seen in the Siggraph 2000 Mesh Subdivision course notes. It was written in C# for Grasshopper, using the Plankton halfedge mesh library developed by Daniel Piker and Will Pearson. However, Weaverbird’s implementations of the Loop and Catmull-Clark subdivision algorithms – two of the most standard methods for these approaches – lack some desirable features, specifically the ability for users to designate anchors and creases within the mesh.įor a design project currently underway at CITA, there has been a need to assert more local control over subdivided meshes, for which I developed this implementation of these algorithms. Using mesh subdivision and smoothing approaches allows for designers to start from coarse geometries and then rapidly transform them into fluid and organic shapes. It provides a great variety of outstanding tools for creating, managing and subdividing meshes. Computational designers who work with meshes in Rhino + Grasshopper will inevitably be familiar with Giulio Piacentino’s brilliant Weaverbird plug-in. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |