Matching Items (2)
149744-Thumbnail Image.png
Description
The video game graphics pipeline has traditionally rendered the scene using a polygonal approach. Advances in modern graphics hardware now allow the rendering of parametric methods. This thesis explores various smooth surface rendering methods that can be integrated into the video game graphics engine. Moving over to parametric or smooth

The video game graphics pipeline has traditionally rendered the scene using a polygonal approach. Advances in modern graphics hardware now allow the rendering of parametric methods. This thesis explores various smooth surface rendering methods that can be integrated into the video game graphics engine. Moving over to parametric or smooth surfaces from the polygonal domain has its share of issues and there is an inherent need to address various rendering bottlenecks that could hamper such a move. The game engine needs to choose an appropriate method based on in-game characteristics of the objects; character and animated objects need more sophisticated methods whereas static objects could use simpler techniques. Scaling the polygon count over various hardware platforms becomes an important factor. Much control is needed over the tessellation levels, either imposed by the hardware limitations or by the application, to be able to adaptively render the mesh without significant loss in performance. This thesis explores several methods that would help game engine developers in making correct design choices by optimally balancing the trade-offs while rendering the scene using smooth surfaces. It proposes a novel technique for adaptive tessellation of triangular meshes that vastly improves speed and tessellation count. It develops an approximate method for rendering Loop subdivision surfaces on tessellation enabled hardware. A taxonomy and evaluation of the methods is provided and a unified rendering system that provides automatic level of detail by switching between the methods is proposed.
ContributorsAmresh, Ashish (Author) / Farin, Gerlad (Thesis advisor) / Razdan, Anshuman (Thesis advisor) / Wonka, Peter (Committee member) / Hansford, Dianne (Committee member) / Arizona State University (Publisher)
Created2011
147768-Thumbnail Image.png
Description

Procedural content generation refers to the creation of data algorithmically using controlled randomness. These algorithms can be used to generate complex environments and geological formations as opposed to manually creating environments, using photogrammetry, or other means. Geological formations and the surrounding terrain can be created using noise based algorithms such

Procedural content generation refers to the creation of data algorithmically using controlled randomness. These algorithms can be used to generate complex environments and geological formations as opposed to manually creating environments, using photogrammetry, or other means. Geological formations and the surrounding terrain can be created using noise based algorithms such as Perlin noise. However, interpreting noise in this manner has a number of challenges due to the pseudo-random nature of noise. We will discuss how to generate noise, how to render noise, and the challenges in interpreting noise.

ContributorsLi, Michael L (Author) / Hansford, Dianne (Thesis director) / Kobayashi, Yoshihiro (Committee member) / Computer Science and Engineering Program (Contributor, Contributor) / School of Art (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05