Dissertations@Portsmouth - Details for item no. 13413
Bibliographic details and abstracts are available to all. Downloads of full-text dissertations are restricted to University of Portsmouth members who must login. MPhils may be accessed by all.
Kent, Callum (2019) Dungeon generation demo, utilising unordered tree, Delaunay triangulation, and minimum spanning tree algorithms, implemented in C# using Unity (version 2019.2.0.a8). (unpublished BSc dissertation), University of Portsmouth, Portsmouth
Abstract
This project covers the generation of a dungeon environment using a combination of simple and advanced techniques to investigate the viability of this approach. These techniques include Delaunay triangulation, Minimum spanning tree and unordered tree algorithms, alongside simple random initial placement of rooms. The artefact that has been made for this project was made in Unity 2019.2.0.a8 using C#, utilising the Triangle.NET library to implement Delaunay.
The report will cover the process of developing this artefact and my approach to it. This includes ideas from pre-production, what happened during the development focused on the issues that impacted it, and analysis on the success or failure of the project.
Findings from this project are that the approach is a viable method of generating dungeons, as although other methods can create ones that are more interesting and unique, there are many additional steps required to do so. Making this ideal for less experienced developers or for some more niche cases.
Course: Computer Games Technology - BSc (Hons) - C1671
Date Deposited: 2019-11-18
URI/permalink: https://library.port.ac.uk/dissert/dis13413.html