A Novel Adaptive Algorithm of Catmull-Clark Subdivision Surfaces
The character of the subdivision surfaces is that the number of facets grows exponentially with the level of subdivision. A novel adaptive subdivision algorithm based on Catmull-Clark scheme is presented in this paper by calculating the distance smoothness value of the vertices. The new method gener...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The character of the subdivision surfaces is that the number of facets grows exponentially with the level of subdivision. A novel adaptive subdivision algorithm based on Catmull-Clark scheme is presented in this paper by calculating the distance smoothness value of the vertices. The new method generates preferable rendering results than the traditional adaptive approaches such as computing a vertex's curvature or distance between the control mesh and their limit surfaces. The new method has obvious geometric meaning, programming simplicity, numerical stability and performs efficiently when applied to the model whose mesh has more sharp features. |
---|---|
DOI: | 10.1109/FSKD.2009.478 |