Global ETD Search

1	PN-triangle tessellation using Geometry shaders : The effect on rendering speed compared to the fixed function tessellator Löwgren, Martin, Olin, Niklas January 2010 (has links) With each computer game generation there is always a demand for more visually pleasing environments. This pushes game developers to create more powerful rendering techniques and game artists to create more detailed art. With a visually stunning backdrop also comes the need for high-resolution models. A common issue is that if all models in a scene are high-resolution it would not only require immensely powerful hardware, it would also be wasteful as only the models in the foreground are close enough that we would recognize the increased details. The common solution to this problem has been to load several versions of each model containing varying amounts of detail. However this solution has the drawback that it increases our memory footprints as more models are loaded into the memory. Tessellation offers a more dynamic solution to the problem as it only requires us to load a low-resolution model and higher resolution versions can be generated during run-time on the GPU. With the introduction of DirectX 11 tessellation is now supported in the hardware, however we are still a few years away from seeing DirectX 11 being used as the core of any 3D rendering engine. In a transitional period like this between hardware generations game developers has to tackle the dilemma that the current hardware generation has to be supported when creating games that will also utilize the next generation. This thesis focuses on comparing the performance of a tessellation scheme supported by the current hardware generation, DirectX 10, as opposed to a scheme developed for the next generation, DirectX 11. Two prototypes, one using the Geometry shader that was introduced in DirectX 10 and the other using the fixed function tessellator introduced in DirectX 11, were built to compare the performance of tessellated model rendering. Several different variants of each prototype were tested and the general conclusion is that the tessellator performed better than the Geometry shader. Tessellation DirectX 10 DirectX 11 Geometry shader PN-triangles fixed function tessellator Computer Sciences Datavetenskap (datalogi) Software Engineering Programvaruteknik
2	Feigenbaum Scaling Sendrowski, Janek January 2020 (has links) In this thesis I hope to provide a clear and concise introduction to Feigenbaum scaling accessible to undergraduate students. This is accompanied by a description of how to obtain numerical results by various means. A more intricate approach drawing from renormalization theory as well as a short consideration of some of the topological properties will also be presented. I was furthermore trying to put great emphasis on diagrams throughout the text to make the contents more comprehensible and intuitive. Feigenbaum Feigenbaum constant Feigenbaum point superstable self-similarity fractals final-state diagram logistic map period-doubling operator linearized period-doubling operator Cantor set Sharkovsky sequence Chebyshev interpolation stable manifold unstable manifold orbits fixed points scaling factor pitchfork bifurcation cobweb plot renormalization iterates one-hump map unimodal map bifurcation cascade Feigenbaum universality chaos theory spectrum generalized Feigenvalues bifurcation points superstable points fixed function universal function eigenvalues eigenvectors eigenfunctions universality conditions Schwarzian derivative Newton’s method power method Arnoldi’s method attractive fixed point repellent fixed point Banach fixed-point theorem collocation method functional analysis topology Mathematical Analysis Matematisk analys Other Mathematics Annan matematik Computational Mathematics Beräkningsmatematik

Search results

PN-triangle tessellation using Geometry shaders : The effect on rendering speed compared to the fixed function tessellator

Feigenbaum Scaling