|
Lecturer(s)
|
-
Slánský Vlastimil, doc. Ing. Ph.D.
|
|
Course content
|
1. Data structures for polygonal and triangle meshes 2. Manifolds, repairing meshes, hole filling 3. Concepts of differential geometry on polygonal meshes ? tangent, normal, curvature 4. Laplace operator on polygonal meshes ? meaning, variants (combinatorial, cotangent, mean value) 5. Mesh smoothing 6. Mesh subdivision 7. Mesh simplification 8. Parameterization 9. Remeshing 10. Mesh editing 11. Mesh animation (skinning) 12. Mesh compression 13. Mesh comparison (mathematical approaches, perceptual approaches)
|
|
Learning activities and teaching methods
|
Lecture supplemented with a discussion, Discussion, Multimedia supported teaching, One-to-One tutorial, Task-based study method, Students' self-study, Self-study of literature, Textual studies, Lecture, Practicum
- Preparation for an examination (30-60)
- 42 hours per semester
- Graduate study programme term essay (40-50)
- 48 hours per semester
- Contact hours
- 65 hours per semester
|
| prerequisite |
|---|
| Knowledge |
|---|
| to perform basic mathematical derivations and to solve problems of linear algebra and mathematical analysis |
| to demonstrate basic knowledge of mathematical analysis |
| to understand basic terminology of computer graphics |
| to program in an imperative programming language |
| to solve simple geometric problems in plane and in 3D space |
| Skills |
|---|
| to use an integrated development environment such as MS Visual Studio or Eclipse |
| to debug advanced programs |
| to understand larger software packages in order to add new functionality |
| Competences |
|---|
| N/A |
| N/A |
| learning outcomes |
|---|
| Knowledge |
|---|
| to understand basic concepts of discrete differential geometry, such as normal, tangential space and curvatures |
| to construct algorithms processing triangle and polygon meshes, performing in particular smoothing, subdivision, simplification and parameterization |
| to design data structures allowing representing and processing of triangle and polygon meshes in a computer, with focus on particular applications and effectivity |
| to understand the terminology of incidence queries |
| to choose a proper discretization of the Laplace-Beltrami operator in the context of various problem settings of triangle and polygon mesh processing |
| Skills |
|---|
| to implement basic polygon mesh processing algorithms |
| to implement data structures for efficient resolution of incidence queries |
| to exploit the properties of the discrete Laplace-Beltrami operator for triangle mesh processing (smoothing, parameterization, editing etc.) |
| Competences |
|---|
| N/A |
| N/A |
| teaching methods |
|---|
| Knowledge |
|---|
| Lecture |
| Lecture supplemented with a discussion |
| Practicum |
| Multimedia supported teaching |
| Task-based study method |
| Textual studies |
| Self-study of literature |
| One-to-One tutorial |
| Discussion |
| Lecture with visual aids |
| assessment methods |
|---|
| Seminar work |
| Combined exam |
| Continuous assessment |
|
Recommended literature
|
-
Botsch, Mario. Polygon mesh processing. Natick : A K Peters, 2010. ISBN 978-1-56881-426-1.
|