Modul
Subdivision Algorithms [M-INFO-101863]
Credits
3Recurrence
Jedes SommersemesterDuration
1 SemesterLanguage
EnglishLevel
4Version
1Responsible
Organisation
- KIT-Fakultät für Informatik
Part of
Bricks
Identifier | Name | LP |
---|---|---|
T-INFO-103551 | Subdivision Algorithms | 3 |
Competence Certificate
See partial achievements (Teilleistung)
Competence Goal
Students of this course are knowledgeable about subdivision algorithms and are able to analyze the smoothness of subdivision algorithms.
Prerequisites
See partial achievements (Teilleistung)
Content
Chaikin algorithm, Lane-Riesenfeld algorithm, stationary subdivision for curves, regular quadrilateral, triangular and hexagonal meshes, the subdivision symbol, stencils, difference and derivative schemes, convergence theorems, four-point scheme, box spline subdivision, half box spline subdivision, stationary subdivision of arbitrary meshes with extraordinary points, the midpoints scheme, subdivision matrix, characteristic map, differentiability at extraordinary points, the simplest subdivision scheme, Doo-Sabin algorithm, Catmull-Clark algorithm, WAVE schemes including Loop’s scheme, butterfly scheme, sqrt 3 scheme, 4-8 scheme, Ck subdivision algorithms, corner cutting and similar topics.
Workload
90h of which about
30h for attending the lecture
30h for post-processing
30h for exam preparation