Thesis Details
Demonstrační aplikace algoritmů vyplňování uzavřených oblastí ve 2D
This thesis describes methods used for filling closed areas in 2D. This text describes the mostfrequently used algorithms for this task. The first part of thesis describes both the main groups, vectoralgorithms and raster algorithms. Positives and negatives of these algorithms are described. For fewof these algorithms is also mentioned how to optimize this algorithms or how to implement themusing a different way. Next part of this text describes implementation of these algorithms for purposeof tracing them into. Last part of this text describes classes used in application. Also graphic userinterface is described here.
computer graphics, Scan-Line fill, inversive Scan-Line fill, Pined fill algorithm, Flood fill, Scan-LineSeed fill
Herout Adam, prof. Ing., Ph.D. (DCGM FIT BUT), člen
Kreslíková Jitka, doc. RNDr., CSc. (DIFS FIT BUT), člen
Linhart Miroslav, doc. Ing., CSc. (DCSY FIT BUT), člen
Martinek David, Ing. (DIFS FIT BUT), člen
Sochor Jiří, prof. Ing., CSc. (FI MUNI), člen
@bachelorsthesis{FITBT6270, author = "Pavel Hort", type = "Bachelor's thesis", title = "Demonstra\v{c}n\'{i} aplikace algoritm\r{u} vypl\v{n}ov\'{a}n\'{i} uzav\v{r}en\'{y}ch oblast\'{i} ve 2D", school = "Brno University of Technology, Faculty of Information Technology", year = 2008, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/6270/" }