Thesis Details

Knihovna pro simulaci dynamiky tuhých těles

Bachelor's Thesis Student: Moravčík Libor Academic Year: 2019/2020 Supervisor: Peringer Petr, Dr. Ing.
Language
Slovak
Abstract

This thesis sums up a basic knowledge about rigid body simulations in two dimensional space of computer games.Practical result is a hands-on library written in C++. Collision geometry of rigid bodies is simplified to convex polygons and circles. Multiple bodies can be joined together via a joint. Collision detection is split in to two phases, broad and narrow. Broad phase is implemented using a dynamic aabb tree while narrow phase uses Gilbert-Johnost-Keerthi (GJK) algorithm with Expanding Polytope Algorithm as an extension for detecting collision points between two polygons.

Keywords

dynamics, rigid body, rigid body dynamics, rigid body collisions, computer games, classical mechanics, linear algebra, c++, webassembly

Department
Department of Intelligent Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade C
Date
13 July 2020
Reviewer
Janoušek Vladimír, doc. Ing., Ph.D.
Committee
Janoušek Vladimír, doc. Ing., Ph.D. (DITS FIT BUT), předseda
Chudý Peter, doc. Ing., Ph.D. MBA (DCGM FIT BUT), člen
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Rozman Jaroslav, Ing., Ph.D. (DITS FIT BUT), člen
Veselý Vladimír, Ing., Ph.D. (DIFS FIT BUT), člen
Citation
MORAVČÍK, Libor. Knihovna pro simulaci dynamiky tuhých těles. Brno, 2020. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2020-07-13. Supervised by Peringer Petr. Available from: https://www.fit.vut.cz/study/thesis/22940/
BibTeX 
@bachelorsthesis{FITBT22940,
    author = "Libor Morav\v{c}\'{i}k",
    type = "Bachelor's thesis",
    title = "Knihovna pro simulaci dynamiky tuh\'{y}ch t\v{e}les",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2020,
    location = "Brno, CZ",
    language = "slovak",
    url = "https://www.fit.vut.cz/study/thesis/22940/"
}

Theses

Back to top