Home > Search Results: keywords:"Marching tetrahedra."
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Endless Cave
 Pospíšil, Petr ; Pečiva, Jan (referee) ; Milet, Tomáš (advisor)
The goal of this thesis is to implement an application showing an endless cave. The basis of this cave is simplex noise method. On the noise produced by this function is afterwards applied thresholding. Produced grid of points is used like input for marching tetrahedrons algorithm. This algorithm converts volumetric data to boundary representation. Phong reflection model and Bump mapping were used in the application, too, in order to improve the visual quality. The application is based on OpenGL library. The first part of the technical report contains theoretical description of mentioned methods, the second part contains description of implementation.
Detailed record
Endless Cave
 Pospíšil, Petr ; Pečiva, Jan (referee) ; Milet, Tomáš (advisor)
The goal of this thesis is to implement an application showing an endless cave. The basis of this cave is simplex noise method. On the noise produced by this function is afterwards applied thresholding. Produced grid of points is used like input for marching tetrahedrons algorithm. This algorithm converts volumetric data to boundary representation. Phong reflection model and Bump mapping were used in the application, too, in order to improve the visual quality. The application is based on OpenGL library. The first part of the technical report contains theoretical description of mentioned methods, the second part contains description of implementation.
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