Thesis Details

Generátor procedurálních textur

Bachelor's Thesis Student: Doroshenko Ilya Academic Year: 2021/2022 Supervisor: Milet Tomáš, Ing., Ph.D.
English title
Procedural Texture Generator
Language
Czech
Abstract

Textures are an essential part of modern 2D and 3D rendering. The most prominent texturing techniques are Texture Mapping and Procedural Generation. Both techniques have their set of demands on computational resources. Procedural generation provides rich detail resolution without memory consumption, but also requires processing power. Texture Mapping is quick to process, but images, that the texture consists of are using a lot of space in memory and have finite resolution and sets of complications around algorithms that try to overcome that problem. This thesis discusses techniques of texture generation their interchangeability and applications. Result is an extensible application, that can produce texture maps from algorithms and can export algorithms to be used in procedural shading techniques.

Keywords

Procedural Textures, C++, textures, shading, GLSL, Qt, noise simulation, shader compiler

Department
Degree Programme
Files
Status
defended, grade A
Date
13 June 2022
Reviewer
Committee
Čadík Martin, doc. Ing., Ph.D. (DCGM FIT BUT), předseda
Orság Filip, Ing., Ph.D. (DITS FIT BUT), člen
Španěl Michal, Ing., Ph.D. (DCGM FIT BUT), člen
Vašíček Zdeněk, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Citation
DOROSHENKO, Ilya. Generátor procedurálních textur. Brno, 2022. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2022-06-13. Supervised by Milet Tomáš. Available from: https://www.fit.vut.cz/study/thesis/25080/
BibTeX
@bachelorsthesis{FITBT25080,
    author = "Ilya Doroshenko",
    type = "Bachelor's thesis",
    title = "Gener\'{a}tor procedur\'{a}ln\'{i}ch textur",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2022,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/25080/"
}
Back to top