<p>With the intention of surveying the field of research in adaptive audio systems for interactive media, a suggested audio system design for adaptive music control is described, and a prototype implementation of key parts of the system is presented and evaluated. </p><p>Foregoing midi-triggered sound banks, the proposed design uses layered segmented audio files, defined and controlled by XML-scripts. The results demonstrate an inclination of a flexible system, capable of adequate adaptive behaviour of high quality sound. </p><p>The implemented system will serve as an extensive basis for future work contributing to the research of adaptive behaviour to both music and sound effects for interactive media, and also as a preliminary foray into the more experimental field of stand-alone non-linear music playback.</p>

<p>This paper describes our game engine written in C++, using the DirectX libraries for graphics, sound and input. Since the engine is written using DirectX, an introduction to this system is given. The report gives a description of the structure of the game and the game kernel. Following this is a description of the graphics engine and its core components. The main focus of the engine is on the physics and how it is used in the game to simulate reality. Input is discussed briefly, with examples to show how it relates to the physics engine. Implementation of audio in the game engine is not described, but a general description of how sound is used in games is given. A theory for the basics of how artificial intelligence can be used in the engine is presented. The system for the architecture of the levels is described as is its connection to the graphics engine. The last section of the report is an evaluation and suggestions for what to do in the future. A user manual for the level editor is included as an appendix.</p>

With the intention of surveying the field of research in adaptive audio systems for interactive media, a suggested audio system design for adaptive music control is described, and a prototype implementation of key parts of the system is presented and evaluated. Foregoing midi-triggered sound banks, the proposed design uses layered segmented audio files, defined and controlled by XML-scripts. The results demonstrate an inclination of a flexible system, capable of adequate adaptive behaviour of high quality sound. The implemented system will serve as an extensive basis for future work contributing to the research of adaptive behaviour to both music and sound effects for interactive media, and also as a preliminary foray into the more experimental field of stand-alone non-linear music playback.

This report describes the architecture and implementation of a memory profiler for 3D graphics applications. The memory profiling is done for parts of the program which runs on the graphics processor and is responsible for rendering the image. The shaders are parsed and every memory instruction is instrumented with additional instruction for profiling. The results are then transferred from the video memory to CPU memory. Profiling is done for a frame and completes in less than three minutes. The report also describes various analyses that can be done using the results obtained from this profiler. The report discusses the design of an analytical cache model that can be used to identify candidate memory buffers suitable for caching among all the buffers used by an application. The profiler can segregate results for reads and writes separately, can handle all formats of texture access instructions and predicated instructions. / text

Game developers today are putting a lot of effort into their games. Consumers are hard to please and demand a game which can provide both fun and visual quality. This is why developers aim to make the most use of what hardware resources are available to them to achieve the best possible quality of the game. It is easy to use too many performance demanding techniques in a game, making the game unplayable. The hard part is to make the game look good without decreasing the performance. This can be done by using techniques in a smart way to make the graphics as smooth and efficient as they can be without compromising the visual quality. One of these techniques is deferred rendering. The latest version of Microsoft’s graphics platform, DirectX 11, comes with several new features. One of these is the Compute shader which is a feature making it easier to execute general computation on the graphics card. Developers do not need to use DirectX 11 cards to be able to use this feature though. Microsoft has made it available on graphic cards made for DirectX 10 as well. There are however a few differences between the two versions. The focus of this report will be to investigate the possible performance differences between these versions on when using deferred rendering. An application was made supporting both shader model 4 and 5 of the compute shader, to be able to investigate this.

Kontext: Displacement Mapping är en teknik som används inom 3D-spel för att skapa detaljrikedom i geometri utan att behöva triangelobjekt bestående av oönskad geometrikomplexitet. Tekniken har även andra användningsområden i 3D-spel, till exempel terränggeometri. Tekniken skänker detaljrikedom genom att i samband med tesselering förskjuta geometri i en normalriktning eller längs annan specificerad riktning. Vector Displacement Mapping är en teknik liknande Displacement Mapping där skillnaden är att Vector Displacement Mapping förskjuter geometri i tre dimensioner. Mål: Syftet med arbetet är utforska Vector Displacement Mapping i sammanhanget 3D-Spel och att antyda att tekniken kan användas i 3D-spel likt Displacement Mapping. Arbetet jämför Vector Displacement Mapping med Displacement Mapping för att urskilja skillnader i exekveringstid mellan teknikernas centrala skillnader. Skillnaderna i exekveringstid ställs i kontrast mot diskussion av teknikernas grafikminnesanvändning. Metoder: Jämförelsen baseras på en implementation av de båda teknikerna tillsammans med tesselering. Prestandamätningar genereras med implementationen som grund. Implementationen använder sig av Direct3D 11. Resultat: Resultatet som erhålls genom jämförelsen visar att exekveringstiderna mellan teknikernas centrala skillnader varierar svagt. Grafikminnesanvändningen mellan teknikerna skiljer sig med en faktor 3 eller en faktor 4 där Vector Displacement Mapping använder mer grafikminne. Slutsatser: Slutsatser som dras baserat på resultatet är att Vector Displacement Mapping i situationer där överhängande geometri är ett önskat resultat kan ersätta Displacement Mapping. Vidare diskussion förs kring slutsatser, avgränsningar och framtida forskning som arbetet berör.

Many companies over the years have been working with enhancing the visual effect of monitors and television with 3D glasses and such. There is a new form of 3D viewing right now; Spatial View is the one I know most about. Their technology includes a barrier panel technology which aligns the right and left eye simultaneously giving the person looking at the monitor a 3D viewing. Spatial View has developed an API that can be easily included in games and rendering applications to enable this 3D visualization and this thesis is about the computer performance cost. The API works in such a way that it takes 5 images of the current scene the camera is looking at in the game or rendering application and interlace them together to produce 1 image to be displayed on screen. Combining this with the monitor technique gives the visual effect. The 5 different camera angles that are produced can be a strain on the performance, meaning that the rendering API in this case Direct3D 9.0c has to render everything 5 times each frame. This can slow down the frame rate of the game, which is very important for the game to run smoothly. This thesis main focus is to understand the correlation between the number of camera angles and rendering time for Direct3D 9.0c, is it linear or exponential. By having access to Spatial View’s Direct3D 9.0c API, I was able to construct a test application which could answer the hypothesis. Six tests were used to investigate this with different numbers of camera angle to see the impact on rendering time. Using one, two and five camera angles for the test with large cubes (big enough to almost cover the screen) and small cubes (almost small enough to not see). After seeing the rendering time and understanding the API from Spatial View’s, a theory about reducing the rendering time arose. This theory will be explained throughout the thesis and discussed; it includes using Direct3D 10.0 with geometry instancing.

Context. Ray tracing has always been a simple but effective way to create a photorealistic scene but at a greater cost when expanding the scene. Recent improvements in GPU and CPU hardware have made ray tracing faster, making more complex scenes possible with the same amount of time needed to process the scene. Despite the improvements in hardware ray tracing is still rarely run at a interactive speed. Objectives. The aim of this experiment was to implement a new kdtree generation algorithm using DirectX 11 compute shaders. Methods. The implementation created during the experiment was tested using two platforms and five scenarios where the generation time for the kd-tree was measured in milliseconds. The results where compared to a sequential implementation running on the CPU. Results. In the end the kd-tree generation algorithm implemented did not run within our definition of real-time. Comparing the generation times from the implementations shows that there is a speedup for the GPU implementation compared to our CPU implementation, it also shows linear scaling for the generation time as the number of triangles in the scene increase. Conclusions. Noticeable limitations encountered during the experiment was that the handling of dynamic structures and sorting of arrays are limited which forced us to use less memory efficient solutions.

The development of Graphics Hardware Technology is blazing fast, with new and more improved models, that out spec the previous generations with leaps and bounds, before one has the time to digest the potential of the previous generations computing power. With the progression of this technology the computer games industry has always been quick to adapt this new power and all the features that emerge as the graphic card industry learn what the customers need from their products. The current generations of games use extraordinary visual effects to heighten the immersion into the games, all of which is thanks to the constant progress of the graphics hardware, which would have been an impossibility just a couple of years ago. Ray tracing has been used for years in the movie industry for creation of stunning special effects and whole movies completely made in 3D. This technique for giving realistic imagery has always been for usage exclusively for non-interactive entertainment, since this way of rendering an image is extremely expensive when it comes to computations. To generate one single image with Ray Tracing you might need several hundred millions of calculations, which so far haven’t been proven to work in real-time situations, such as for games. However, due to the continuous increase of processing power in Graphical Processing Units, GPUs, the limits of what can, and cannot, be done in real-time is constantly shifting further and further into the realm of possibility. So this thesis focuses upon finding out just how close we are to getting ray tracing into the realm of real-time games. Two tests were performed to find out the potential a current (2009) high-end computer system has when it comes to handling a raster - ray tracing hybrid implementation. The first test is to see how well a modern GPU handles rendering of a very simple scene with phong shading and ray traced shadows without any optimizations. And the second test is with the same scenario, but this time done with a basic optimization; this last test is to illustrate the impact that possible optimizations have on ray tracers. These tests were later compared to Intel’s results with ray tracing Enemy Territory: Quake Wars.

No description available.