I have in my thesis produced a start of a multiplayer, voxel, strategy sandbox game with advanced AI. The world is made out of voxels in the form of blocks that both the players and other units can affect and change. In a world where every block follows the laws of physics for both fluids and physics. The game is designed for several players that fights for controll over land and resources. / Jag har i mitt examensarbete producerat en början av ett flerspelar, voxel, strategi och sandlådespel med avancerad AI. Världen är uppbyggd av voxlar i form av block som både spelaren och andra enheter har möjlighet att påverka och förändra. En värld där varje block följer fysiska lagar för både vätska och fysik. Spelet är designat för flera spelare som strider om områden och resurser med hjälp av sina AI kontrollerade bybor.

Cette thèse a pour objectif de créer et évaluer un modèle narratif pour les jeux vidéo émergents dont une part importante du contenu est générée de façon procédurale. Elle propose pour cela une application dans le jeu vidéo Minecraft. L'approche classique de la narration dans les jeux vidéo s'adaptant difficilement à des expériences de jeu plus libres nous proposons de donner au joueur les moyens de transformer le récit en temps réel et de manière explicite grâce à une forme narrative modulaire et adaptative au contexte de jeu courant. Dans un premier temps, la thèse explore les liens entre narration et interaction par le biais de l'étude des rôles de la narration dans les jeux vidéo. Puis, dans un deuxième temps, nous identifions les propriétés qui caractérisent les jeux vidéo émergents afin d'exposer les enjeux narratifs de ce type d'expérience de jeu. Dans un troisième temps, nous détaillons notre proposition d'un modèle narratif adapté aux jeux vidéo émergents ainsi que l'architecture logiciel permettant au joueur de transformer le récit en temps réel. Finalement, nous présentons deux expérimentations visant à vérifier nos hypothèses et à évaluer notre modèle narratif. / This thesis aims to create and evaluate a narrative model for emergent videogames that make extensive use of procedurally generated content. As such, an application of this model is presented within the videogame Minecraft. The usual approach to narratives in videogames can hardly be applied to experiences of play that involve more freedom from the player's perspective, such as what offer emergents videogames. Thus, we aim to provide players with the means to explicitly alter the story in real time, thanks to a context sensitive and modular narrative form. First, we explore the relationship betweenstorytelling and interactivity by studying the various roles held by narratives in videogames. Then, we identify the properties that define emergent videogames to better expose the narrative challenges they represent. Next, we detail our proposal of a narrative model suitable for emergent games as well as the architecture allowing players to transform the story in real time. Finally, we present an experiment in which we evaluate the validity of our narrative model in the context of emergent videogames.

This thesis deals with procedural generation techniques and its use in the creation of voxel models. The techniques that have been used are Perlin Noise, Voronoi diagram, L-systems etc. This knowledge is then used to create a world generator for computer game with open world. This game provides players with the ability to modify this world and use its creativity, for example, in building construction. The game, however, will not give to the player all options for free, but for example for build, he or she will first have to find and mine the material. The game has been written in programming language C++ with the use of libraries Boost, SDL and OpenGL.

This master thesis deals with creation of library for volumetric clouds. The paper describes specific techniques for creation and rendering volumetric clouds as clouds and atmospheric scattering. For rendering this type of effects we have to cover theory for participating media.

This thesis explores the procedural generation of 3D buildings from the floor plan all the way to the fa¸cade and building’s details such as doors, windows, and roof. Through this, the study explores several techniques and approaches to create different layers of the building generation pipeline. The focus is on implementing a set of algorithms that, when running sequentially, are able to create complete 3D buildings in a short time (so they can be used in online generation), could be used in any open-world game, and with a limited count of triangles per building. Furthermore, the tool provides a clear and easy-to-use interface for designers in Unity, where they can interact with the multiple parameters of each building layer, giving designers a high degree of controllability. The tool is evaluated using the resulting buildings based on different metrics and how individual changes to different parameter starting from a template affect the output of the generator in terms of the metrics and the resulting building. The result from the analysis show that the polygon mathematics is well suited for generating 3D buildings for games.

This thesis explores the possibilities of creating landscapes through procedural means within the game engine Unreal Engine 5. The aim is to provide a flexible procedural landscape tool that doesn't limit the user and that is compatible with existing systems in the engine. The research questions focuses on comparison to other work regarding landscape generation and generation of procedural roads. The process to achieve this was done through extensive implementation adding modules that both builds upon and adds to the source code. The implementation was divided into five major components, which was noise generation for terrain, biotope interpolation, asset distribution, road generation and a user interface. Perlin noise, utilizing Fractal Brownian Motion were a vital part of generating terrain with varying features. For interpolation a modified version of Lowpass Gaussian filtering was implemented in order to blend biotope edges together. Asset distribution and road generation were implemented in a way that uses pseudo-randomness combined with heuristics. The user interface was done to tie everything together for testing. The results shows potential for assisting in procedural landscape creation with a large amount of freedom in customization. There is however flaws in some aspects, namely the interpolation methods suffer from clear visual artefacts. Whether it is suitable for professional standards remains to be fully proven objectively as the testing in this thesis work was limited.

Arbetet handlar om vilken algoritm som är bäst för att procedurellt generera terräng. Är Diamond-Square bättre eller sämre än vad Perlin noise när de jämförs på exekveringstid och framkomlighet. Algoritmerna är implementerade i Unity där de körs för att få fram exekveringstid och Flood fill används för att ta reda på framkomligheten. Algoritmerna kördes 1000 gånger var på tre olika kartstorlekar för att få fram ett genomsnitt. Resultatet visar att Diamond-Square är snabbare än vad Perlin noise är men Perlin noise har bättre framkomlighet. / This project deals with which algorithm is best for procedural terrain generation. Is Diamond Square better or worse than Perlin noise when they are compared on execution time and exploration. The algorithms are implemented in Unity, where they are tested to get the execution time and Flood Fill is used to determine exploration. The algorithms were run 1000 times each on three different map sizes to obtain an average. The results show that Diamond Square is faster than Perlin noise is but Perlin noise has better exploration.

This Master s thesis proposes a non-assisted procedural method for 3D canyons scenes generation based on techniques of computer graphics, computer vision and graph search algorithm. In order to define all the features to be reproduced in our scenes, we have analyzed several images of real canyons and have categorized them in two canyon features models: a recursive and an ordinary one. The proposed approach manipulates a heightmap, created using Perlin noise, in order to imitate the geological features formation previously analyzed. Several parametrizations are used to guide and constraint the generation of terrains, canyons features, course of river, plain areas, soft slope regions, cliffs and plateaus. This work also uses the Mean Shift algorithm as mechanism of segmentation to define regions of interest. A binary mask, with plain areas, is defined based on a threshold operation by a given data set provided by the Mean Shift algorithm. Thereafter a connected-component labeling algorithm is executed using the previously binary mask. This algorithm finds all plains centroids. Right after that, the Dijkstra s algorithm is performed in order to connect all plain areas, creating a valid path between the centroids. The Dijkstra s algorithm is executed again to define the river s course. Finally, a Gaussian smoothing operation is applied to interpolate the soft slope regions. The combination of all those techniques produces as a result automatically generated feature-rich canyons. / Esta dissertação propõe um método procedural não assistido, baseado em técnicas de computação gráfica, visão computacional e busca em grafos, para a geração de cenários 3D de cânions com foco em jogos digitais. Para definir as características a serem reproduzidas, foram analisadas diversas imagens de cânions reais chegando-se em dois modelos, um comum e outro recursivo. A abordagem proposta manipula um reticulado gerado com ruído de Perlin, moldando assim as características inerentes a essa formação geológica. São levadas em conta as diversas parametrizações necessárias para permitir que o algoritmo construa cânions com curso de rio, áreas de planícies, regiões de encosta suave, estruturas de penhascos e, por fim, planaltos nas regiões mais altas. Para atingir o resultado final, o trabalho utiliza o algoritmo Mean Shift como mecanismo de segmentação, definindo dados e regiões de interesse. Munido dos dados do algoritmo de clusterizacao, é definido um limiar para a criação de uma máscara binária com a definição das planícies. Em um segundo momento, um algoritmo de rotulação de componentes conectados é executado, extraindo-se os centróides de cada planície. Por sua vez, o algoritmo de Dijkstra encaixa-se na definição de rotas que conectam estas planícies. O algoritmo de Dijkstra é, então, executado novamente, tendo por base uma função de custo de inclinação, para definir o curso do rio. Por fim, uma filtragem espacial baseada em um filtro Gaussiano é aplicada para interpolar as regiões de encostas de declive suave. A combinação dessas técnicas gera terrenos com grande variabilidade e com as características inerentes à formação geológica de cânions.

Procedurell generering är ett kraftigt verktyg för att kunna skapa en stor mängd spelvärldar utan att själv behöva manuellt designa spelplaner en och en. Med bra programmerade algoritmer kan man få tillgång till en nästan obegränsad mängd av unika spelvärldar med mycket mindre arbete. Vårt uppdrag är att skapa spellogiken och spelplansgenerering till ett spel som ska skickas in som bidrag till Swedish Game Awards[1], som är nordens största tävling för spelutveckling. Vi samarbetar med en annan grupp som ska göra Nätverk och Server-funktionalitet. Deras uppgift är att skapa en huvudserver-applikation, och ett klient/server-system där två spelare kan spela mot varandra med en av spelarna som agerar server. Slutgiltiga målet är att integrera de två olika projekteten till en slutgiltig produkt. Spelet vi tänker skapa är ett schack-baserat spel som utspelar sig i en 3D-miljö. De två spelarna kommer att ha en mängd olika enheter som de kan välja att köpa för sina pengar, kallade för credits i spelet. Spelarna använder sina enheter för att förstöra motspelarens enheter, och målet är att besegra motståndarens kung. Spelet pågår tills någon av spelarnas kungar är besegrad eller tills en av spelarna ger upp. / Procedural generation is a powerful tool for creating a large set of game worlds without having to design each one individually. With the proper implementation, this can allow an almost unlimited amount of unique game worlds using far less resource and time. Our task is to create the game logic and game map generation for a game that will be entered as a contestant in Swedish Game Awards, the biggest competition for game development in the Nordic Countries. We will be working in parallel with a separate group who will be implementing the networking side of the application, where the goal is to have a server where two players can play against each other from separate end systems. As the deadline for the competition approaches, we will then combine the two projects to a finished product. The game we are creating is a chess-influenced game that takes place in a 3D world. Two players will have access to different types of units that can be purchased by the in game resource known as credits, and the main objective is to defeat the enemy king. One game session continues until either of the two kings is defeated, or one of the players surrender.

There is enough rendering power to draw more than only simple indoor scenes today and it can produce very realistic images of landscape with vegetation. Moreover, there are new sophisticated methods for generating of such landscape and simulation of plants ecosystem. This text explains few algorithms for generating and methods for interactive rendering of landscape and vegetation.