Algorithms in Games
AbstractStudents attending this course will be able to implement core algorithms and systems related to game development.
The course will approach algorithms that are core to the development of digital games as well as technical subjects that were only superficially addressed in the first semester course "Game Programming".The course will build on the following main topics:
- Foundational computational geometry algorithms
- Geometric transformations
- Collision detection
- 3D tracking and motion capture (for animation and spatial user interaction)
- Character animation
- Rigid body dynamics
- Animation blending
Formal prerequisitesThe essential skills and requirements are:
- Good programming skill, since the course will propose programming exercises and will require a final project.
- Knowledge of basic data structures, such as linked lists and dictionaries.
- Foundational understanding of discrete mathematics, especially vector and matrix operations.
Optimally the student has completed the course "Game Programming".
Intended learning outcomes
After the course, the student should be able to:
- Implement space partitioning and basic triangulation algorithms.
- Explain how geometric transformations are used to place and move elements in a scene.
- Use space partitioning algorithms to optimize collision computations.
- Implement basic spatial user interaction techniques to select, manipulate and animate virtual objects using motion controllers.
- Program a basic character animation system.
- Analyze, implement and explain a topic of their choice. The topic must be related to the core content of the course.
Foundational study in which text and online resources provide the background for in-depth programming assignments. Classes will also include supervised project work and introductions to advanced topics.
Besides traditional lectures the class will also include class-based discussions and small quizzes to make the students reflect about the topics.
Weekly exercises are not handed in but their solutions are published after one week. Assignments are handed in for peer-grade.
Both the assignments and the final project are solved individually.
Mandatory activitiesDuring the semester the students must hand-in and have approved 4 exercises, which covers some of the important topics of the course. Hand-in deadlines are found in LearnIt.
The student will receive the grade NA (not approved) at the ordinary exam, if the mandatory activities are not approved and the student will use an exam attempt.
Student Activity BudgetEstimated distribution of learning activities for the typical student
- Preparation for lectures and exercises: 21%
- Lectures: 13%
- Exercises: 12%
- Assignments: 18%
- Project work, supervision included: 24%
- Exam with preparation: 12%
Ordinary examExam type:
D: Submission of written work with following oral, external (7-trinsskala)
D22: Submission of written work with following oral exam supplemented by the work submitted.
Submission of an individual project including source code, binaries (if any) and a short report describing the implementation details and the theory used. The exam will cover both the curriculum as well a project.