Home > Search Results: keywords:"Řádkové vyplňování"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 4 records found  Search took 0.01 seconds. 
Education Computer Program for Demonstration of 2D Entity Trimming and 2D Closed Regions Filling
 Novotná, Lenka ; Švub, Miroslav (referee) ; Štancl, Vít (advisor)
This bachelor`s thesis is focusing on concept and developement of educational computer program for demonstration of 2D entity trimming and 2D closed regions filling. The characteristics and mutual differences of all important algorithms are described here. The aplication was designed to ilustrate their differences and to make understandig of this topic easier for future users.
Detailed record
Demonstration Application of Algorithms for Closed Areas Filling in 2D
 Hort, Pavel ; Šilhavá, Jana (referee) ; Venera, Jiří (advisor)
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.
Detailed record
Education Computer Program for Demonstration of 2D Entity Trimming and 2D Closed Regions Filling
 Novotná, Lenka ; Švub, Miroslav (referee) ; Štancl, Vít (advisor)
This bachelor`s thesis is focusing on concept and developement of educational computer program for demonstration of 2D entity trimming and 2D closed regions filling. The characteristics and mutual differences of all important algorithms are described here. The aplication was designed to ilustrate their differences and to make understandig of this topic easier for future users.
Detailed record
Demonstration Application of Algorithms for Closed Areas Filling in 2D
 Hort, Pavel ; Šilhavá, Jana (referee) ; Venera, Jiří (advisor)
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.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English