Home > Search Results: Nepožitek, Ondřej
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Procedural Level Generator with Unity Integration
 Nepožitek, Ondřej ; Gemrot, Jakub (advisor) ; Černý, Vojtěch (referee)
Procedural content generation is a method that is sometimes used in video games to increase their replayability. In our previous work (Nepožitek, 2018), we implemented an algorithm for procedural generation of 2D dungeons, with the main focus on giving game designers complete control over the structure of generated levels. The algorithm takes a set of user-defined building blocks as input and produces levels that all follow the structure of a specified level connectivity graph. In the first part of the thesis, we address some shortcomings of our previous work. We improve the algorithm with several new features such as better support for corridors between rooms or the possibility to generate platformer levels. We also propose several performance improvements and analyze the speed of the algorithm on various inputs. In the second part of the thesis, we present an integration of our algorithm into the Unity game engine. In the final part of the thesis, we demonstrate that our generator is able to produce levels that are similar to what we can see in two popular games - Enter the Gungeon and Dead Cells. The resulting algorithm is much faster than the previous version, contains new features and is ready to be used in the Unity game engine.
Detailed record
Procedural 2D Map Generation for Computer Games
 Nepožitek, Ondřej ; Gemrot, Jakub (advisor) ; Holan, Tomáš (referee)
In some video games, levels are procedurally generated to increase game's replayability. However, such levels may often feel too random, unbalanced and lacking an overall structure. Ma et al. (2014) proposed an algorithm to solve this problem. Their method takes a set of user-defined building blocks as an input and produces layouts that all follow the structure of a specified level connectivity graph. The algorithm is based on two main concepts. The first one is that the input graph is decomposed into smaller chains and these are laid out one at a time. The second one is that configuration spaces are used to define valid relative positions of building blocks. In this thesis, we present an implementation of this method in a context of 2D tile-based maps. We enhance the algorithm with several new features, one of them being a mode to quickly add short corridors between neighbouring rooms. We also propose speed improvements, including a smarter decomposition of the input graph and tweaks of the stochastic method that is used to lay out individual chains. The resulting algorithm is able to quickly produce diverse layouts, which is demonstrated on a variety of input graphs and building blocks sets. Benchmarks of our algorithm show that it can achieve up to two orders of magnitude speedup compared to the original...
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English