Thesis Details

Demonstrace indexačního algoritmu kD strom a jeho derivátů

Bachelor's Thesis Student: Foukal Tomáš Academic Year: 2015/2016 Supervisor: Kolář Dušan, doc. Dr. Ing.
English title
Demonstration of an Indexing Algorithm kD Tree and Its Derivatives
Language
Czech
Abstract

This thesis deals with analysis, designing and implementation of an application for teaching of indexing algorithm kD Tree and its derivates. Also, it deals with testing the application, describing of its use and including examples with exact data. Application as well offers a~possibility of running of algorithms step-by-step and their visualization with a graphical user interface. During development, the emphasis was on executability of the application in all major web browsers.

Keywords 
indexing algorithm, kD Tree, adaptive kD Tree, quadtree, demonstration, JavaScript, CSS, HTML5, support of education, Selenium
Department
Department of Information Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade C
Date
15 June 2016
Reviewer
Květoňová Šárka, Ing., Ph.D.
Committee
Zendulka Jaroslav, doc. Ing., CSc. (DIFS FIT BUT), předseda
Grézl František, Ing., Ph.D. (DCGM FIT BUT), člen
Kotásek Zdeněk, doc. Ing., CSc. (DCSY FIT BUT), člen
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS FIT BUT), člen
Orság Filip, Ing., Ph.D. (DITS FIT BUT), člen
Citation
FOUKAL, Tomáš. Demonstrace indexačního algoritmu kD strom a jeho derivátů. Brno, 2016. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2016-06-15. Supervised by Kolář Dušan. Available from: https://www.fit.vut.cz/study/thesis/5485/
BibTeX 
@bachelorsthesis{FITBT5485,
    author = "Tom\'{a}\v{s} Foukal",
    type = "Bachelor's thesis",
    title = "Demonstrace indexa\v{c}n\'{i}ho algoritmu kD strom a jeho deriv\'{a}t\r{u}",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2016,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/5485/"
}

Theses

Back to top