Thesis Details

Nejkratší cesta mezi dvěma body po povrchu objektu

Bachelor's Thesis Student: Mezera Lukáš Academic Year: 2007/2008 Supervisor: Šiler Ondřej, Ing.
English title
Single Pair Shortest Path on Surface
Language
Czech
Abstract

Finding the shortest path is a fundamental problem in computational geometry. Optimal solution is computation by force of Dijkstra algorithm. There are many approximation algorithms which we can use for calculate the shortest path.

Keywords

Shortest path, triangular meshes, Dijkstra algorithm, approximation algorithms, Kanai Suzuki algorithm, MDSTk, VectorEntity, OpenSceneGraph

Department
Department of Computer Graphics and Multimedia FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade A
Date
10 June 2008
Reviewer
Švub Miroslav, Ing.
Committee
Smrž Pavel, doc. RNDr., Ph.D. (DCGM FIT BUT), předseda
Drábek Vladimír, doc. Ing., CSc. (DCSY FIT BUT), člen
Fučík Otto, doc. Dr. Ing. (DCSY FIT BUT), člen
Chudý Peter, doc. Ing., Ph.D. MBA (DCGM FIT BUT), člen
Kreslíková Jitka, doc. RNDr., CSc. (DIFS FIT BUT), člen
Sochor Jiří, prof. Ing., CSc. (FI MUNI), člen
Citation
MEZERA, Lukáš. Nejkratší cesta mezi dvěma body po povrchu objektu. Brno, 2008. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2008-06-10. Supervised by Šiler Ondřej. Available from: https://www.fit.vut.cz/study/thesis/6642/
BibTeX 
@bachelorsthesis{FITBT6642,
    author = "Luk\'{a}\v{s} Mezera",
    type = "Bachelor's thesis",
    title = "Nejkrat\v{s}\'{i} cesta mezi dv\v{e}ma body po povrchu objektu",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2008,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/6642/"
}

Theses

Back to top