A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
—
| Subject name (Hungarian, English) |
Számítógépes grafika
Computer Graphics
|
||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject code | BMEVIIIAB07 | ||||||||||||
| Subject type | — | ||||||||||||
| Training Level | — | ||||||||||||
| Course types and hours (weekly/semester) |
|
||||||||||||
| Assessment type | félévközi érdemjegy | ||||||||||||
| Credits | 3 | ||||||||||||
| Subject coordinator |
DR. Szirmay-Kalos László
position: egyetemi tanár
contact:
szirmay-kalos.laszlo@vik.bme.hu
|
||||||||||||
| Responsible department |
Irányítástechnika és Informatika Tanszék
|
||||||||||||
| Faculty | Villamosmérnöki és Informatikai Kar | ||||||||||||
| Subject website | http://cg.iit.bme.hu/portal/szamitogepes-grafika | ||||||||||||
| Primary curriculum type | — | ||||||||||||
| Direct prerequisites – Strong prerequisite | none | ||||||||||||
| Direct prerequisites – Weak prerequisite | none | ||||||||||||
| Direct prerequisites – Parallel prerequisite | none | ||||||||||||
| Direct prerequisites – Milestone prerequisite | none | ||||||||||||
| Direct prerequisites – Exclusion | none |
Objectives
Programme
1. Analytic geometry overview and review. Construction of geometries, the main characteristics of various important geometries. Analytical geometry of Euclidean space: point, vector, coordinate systems. Meaning and implementation of vector operations in C++. Combination of points: parametric equation of a segment, line and circle. Distance: plane, sphere implicit equation. Algebras: vector, matrix, complex number, Clifford.
2. Geometric modeling. Classic curves: implicit, parametric and explicit form. Freeform curves with a combination of points. Lagrangian interpolation. Hermite interpolation to two points. Bezier approximation. Catmull-Rom spline. Parametric surfaces. Surface with extraction and rotation. Catmull-Clark split curve and surface. Body modeling, Euler theorem, polygon modeling with Euler operators.
3. Geometric transformations: Elementary transformations and their matrix formalism. Homogeneous coordinates. Projective geometry (ideal point, relation between Cartesian and homogeneous coordinates). Homogeneous linear transformations and their properties. Shift, scale, rotate (Rodriguez formula). A rollover problem.
4. 2D image synthesis: Vectorization of curves. Dividing polygons into triangles. Modeling transformation. View transformation. Cutting sections and areas. Section drawing. Area filling.
5. GLUT/OpenGL 3 and 4/GLSL: Syntax, connection with the windowing system. Open window, register event handler functions. Vertex array object and vertex buffer object. The GPU pipeline for 2D graphics. GLSL shaders. Implementation of "Hello triangle" in OpenGL/GLSL environment. Release of the first homework assignment.
6. Basic optical model of 3D image synthesis: Beam density. BRDF. Optically smooth materials, law of reflection and refraction of geometrical optics, Fresnel equations. Wrinkled surfaces, diffuse and shimmering surface. Direction and point light source. Concept of colors, color matching.
7. Ray tracing: Solving the visibility problem, normal vector of surfaces, shadow calculation. Recursive ray tracing: reflection and refraction. Issuance of the second homework assignment.
8. Incremental 3D image synthesis. Tessellation of surfaces. Modeling transformation. View transformation in the case of perspective projection. Cutting in homogeneous coordinates. Masking problem in screen coordinate system, z-buffer algorithm. Gouraud and Phong shading. Texture mapping. 3D graphics application of OpenGL and graphics hardware. Texture rendering, filtering. GPU programming. Software architecture of 3D graphic systems. GPGPU, CUDA. Third home release.
9. Computer animation. Definition of motion. Real movement. Key-frame animation. Mechanical foundations for point bodies. Discrete time simulation. Collision detection and collision response. Character animation. Inverse kinematics.
10. Computer games: Construction of virtual reality systems and games. The avatar. Game engine. Posters, particle systems. The physics of games. Field modeling. Movement of characters.
11. Fractal geometry. Limits of Euclidean geometry. Hausdorff dimension for self-similar and non-self-similar objects. Chaotic dynamic systems, pseudo-random number generator. Attractor of simple formations, stability. Attractor production by iteration. Handling multivalued mappings with random walk. IFS.
The subject presents the algorithms for the production and processing of image information, introducing students to the development of interactive graphics applications and the programming of graphics hardware.
Learning outcomes
Ez a tantárgy a KKK rendeletben meghatározott, következő kompetenciák fejlesztését szolgálja:
Knowledge
No learning outcomes recorded.
Skills
No learning outcomes recorded.
Attitudes
No learning outcomes recorded.
Autonomy and responsibility
No learning outcomes recorded.
Oktatási módszertan
The subject is application-oriented, i.e. the program-level implementation of the theory and algorithms presented in the lectures is also discussed, which the students themselves practice during their homework. As an implementation environment, we use the C++ language, the version of the OpenGL library (over version 3.3), and the GLSL shader language.
Tanulástámogató anyagok
Online források
László Szirmay-Kalos, György Antal, Ferenc Csonka: Three-dimensional graphics animation and game development, ComputerBooks, 2005. also available in electronic form from the website
Recommended preliminary knowledge for completing the subject
Knowledge type competencies
(azon előzetes ismeretek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
The C++ programming language, Event-driven programming, Introduction to computational theory (vector operations, linear algebra), Analysis (derivation of one- and two-variable vector functions), Physics (center of gravity, dynamics, geometric optics).
Skill type competencies
(azon előzetes képességek és készségek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Recommended (non-compulsory) preliminary competencies
(azon ajánlott (nem kötelező) előzetesen megszerzendő kompetenciák összessége, amelyek jelentősen hozzájárulnak a tantárgy eredményes teljesítéséhez)
The C++ programming language, Event-driven programming, Introduction to computational theory (vector operations, linear algebra), Analysis (derivation of one- and two-variable vector functions), Physics (center of gravity, dynamics, geometric optics).
General rules
Requirements:
Three mandatory mini homework tasks during the semester for 2, 3, and 4 points respectively, and a 30-point midterm at the end of the semesterand. A maximum of 3-point optional homework project can be also completed. Reward questions realted to the mini homework are included in the midterm, for which a maximum of 2 points can be given each, then the points received for the kisházi and the points received for the reward questions are considered as a three-dimensional vector, its scalar product is formed, and then the result is added to the midterm points (i.e. whoever complete it as accurately as possible, and you will receive maximum points for all three reward questions, and you will receive a bonus of 18 points on the ZH). The optional homework project must be agreed with the person in charge by the 12th week and must be presented during the replacement week. The optional homework project points are also doubled (max. 6 points) and added to the midterm result.
The condition for obtaining the credit is the collection of at least 3 points for and the completion of at least 12 points for the ZH including the points given for the reward questions and the large house points, as well as answering 70% of the Moodle quiz questions by the given deadline (the 70% are wrong answers are also included).
Additional possibilities:
None of the homeworks can be retaken. An unsuccessful maidterm can be retaken once.
Assessment methods
In-term assessments
No detailed assessments provided.
Weight of in-term assessments
No weights provided.
Exam-period assessments
No detailed assessments provided.
Weight of exam elements
No weights provided.
Grade calculation
No grade thresholds provided.
Attendance requirements
No attendance requirements provided.
Rules for retake and resubmission
Not provided.
Short description
Not provided.
Detailed description
Not provided.
Recommended courses
Completion of the "Introduction to the theory of computation 2" course
AND
Obtaining a signature of the "Basics of Programming 3" couse
Workload to complete the subject
No workload breakdown provided.
Validity of subject requirements
Requirements valid from:
—
Requirements valid until:
—
Curriculum placement
No curriculum placements recorded for this subject version.