Mathias Plans has found usual procedural building generators to be very limited in the uniqueness of buildings they are able to create. For his thesis, he has combined the rule-based generation approach of formal grammars with the constraint-based generation approach of the wave function collapse algorithm. To do that Mr. Plans has needed to transform the shapes in the commonly used split-grammars to a graph form, thus creating his novel grape grammar. Then the wave function collapse algorithm can operate on the shape graph to apply constraint-based generation to the rule-based grammar. As the result, unique 2D building facades are generated.

Website, poster, video.
Thesis.

Inspired by fish schools Mr. Vetemaa has in his thesis improved the famous Raynold's Boids algorithm. The original algorithm and its common implementation are analyzed thoroughly. The improvements are done on the existing rules and new ones are also added. Namely predator and obstacle avoidance. The latter is solved via distance and gradient fields. Instead of approximating the regular gradient via 6-point stencil sampling, Mr. Vetemaa uses a 26-point stencil. This gives more accurate results to direct the fish away from the scene obstacles.
The thesis won a second place in the student project contest and includes an awesome online demo app.

Poster, video.
Thesis.
Live.

In his thesis Mr. Vainumäe has created an algorithm to render 3D scenes in the style of the Water Memory comic book. From this specific non-photorealistic style several elements (eg outlines, hatching, color smudging) Mr. Vainumäe has detected, analyzed and replicated. The devised solutions uses many non-photorealistic rendering algorithms and also Mr. Vainumäe's own contributions for achieving the results.
The algorithms are implemented in the Maya's Non-photorealistic Rendering plugin called MNPR. This is done in collaboration with the company Artineering who are the authors of the MNRP plugin and co-supervised Mr. Vainumäe's work.
Results are demonstrated in 2 demo scenes. These are to replicate specific panels from the comic. Using the created algorithm the scenes are rendered similarly to the comic's style. Work also includes different control parameters to allow for granular artistic control of the render.


Thesis.

Procedural generation is a popular topic and Aap Vare has in this thesis created a procedural city generator. The generator creates primary and secondary roads to distribute the area into plots. Between the roads, buildings are generated. There are several types of buildings, which are placed by considering Perlin noise and distance from the city center. The city is then decorated with trees as well. The algorithm has different parameters like the width, height and density of the city.

Thesis.

Procedural creature generation has been done in several computer games, but usually consists of a stochastic combination of creature parts. In his thesis Mr. Janno creates 2D creatures from mathematical shape influence functions called metaballs. This kind of approach has only been done in the 3D computer game Spore.
Mr. Janno has created a full system of creature generation, which is easily applicable with any modern graphics library. The creatures are generated based on a skeleton and the resulting procedural mesh is also skinned. Mr. Janno has also included texture and normal map generation in his solution and the results are positively creppy-looking creatures.

Live.
Thesis.

Mr. Sepp has continued on the procedural land generation theme he discovered during his Bachelor studies. This time he has taken inspiration from the Estonian landscapes and infrastructure developed by humans. In his thesis he describes an infinite procedural world generation algorithm that includes about 10 different advanced computer graphics techniques. The generation starts by generating and culling a highway graph, which is then used for city placement (among other things). The different areas inside and outside the cities are divided into specific regions and given corresponding types like forest-areas, farmlands, groves. There are many such divisions into areas inspired by real-life phenomena.
In the final developed application of the algorithm you can drive around in real-time and discover as much of the infinite procedural world as you like. There are also road signs to guide you to the next city or village.

Poster.
Thesis.

In this thesis the concept of impossible geometry is explored. Mr. Voika describes for example the Penrose staircase and games like Echochrome, which makes use of the impossible geometry as a game mechanic. The majority of his thesis describes how to implement impossible geometries using a node-based approach to describe the game world. Graphs are shown that illustrate 3 different types of impossible geometries: shortcuts between areas, endless corridors and overlaping rooms. All of those are also implemented by Mr. Voika in the program accompanying the thesis. Several design and implementation restrictions are described for those who want to create such worlds. Also each impossible geometry type features descriptions of possible game mechanic designs proposed by Mr. Voika.

Thesis.

Mr. Sepp created a Minecraft-like land generation algorithm. He researched different noise generation algorithms (MDA, value, gradient, Perlin, simplex) in order to find the best one for the heightmap of his land. Ultimately he used Simplex noise for the initial heightmap, rainfall and temperature. Based on the last two he created different biomes in a Voronoi diagram. Corresponding to the biom type the actual height of the land is then modified. Heights on the edges of biomes are blended together smoothly. Lastly the vegetation is also placed using noise and biome type.

Thesis.

Mr. Perli researched 3 different procedural city generation algorithms described in his thesis. Parts from each of those algorithms are chosen and an unique city generation algorithm is designed. Roadmap generation is done in two steps: First the main roads are generated by connecting population dense regions, creating also bridges if necessary. Secondly, streets are generated aside the main roads also based on the population density. Then loop finding algorithms are applied to create plots for buildings. The buildings themselves have a varying height and structure based on the population density. Shape is determined by the plot’s shape. Finally different textures are mapped and applied on the buildings. This entire thing works in a web browser in JavaScript with the Three.js library.

Thesis.
Live.