Demonstration Application of Algorithms for Closed Areas Filling in 2D

This thesis describes methods used for filling closed areas in 2D. This text describes the most frequently used algorithms for this task. The first part of thesis describes both the main groups, vector algorithms and raster algorithms. Positives and negatives of these algorithms are described. For few of these algorithms is also mentioned how to optimize this algorithms or how to implement them using a different way. Next part of this text describes implementation of these algorithms for purpose of tracing them into. Last part of this text describes classes used in application. Also graphic user interface is described here