Context. Creating resources for games and 3D environments is an effort consuming process. Some are looking to procedural algorithms to aid in this endeavour but the effort to configure the algorithms can be time consuming in itself. This paper will continue from a set of papers written by Frade et al. where they surrender the process of configuration to the algorithm by using genetic optimization together with a set of fitness functions. This is then tested on procedural generation of height maps.Objectives. The original algorithm utilizes a tree of functions that generates height maps using genetic optimization and a set of fitness functions. The output of the original algorithm is highly dependent on a specic noise function.This paper will investigate if the inverse Fourier transform can be used as an intermediate phenotype in order to decrease the relationship between the set of functions in the algorithm and the types of output.Methods. A reference implementation was first produced and verified. The Fourier transform was then added to the algorithm as an intermediate phenotype together with improvements on the original algorithm. The new algorithm was then put to the test via five experiments, where the output was compared with the reference implementation using manual review.Results. The implementation of Fourier transform that was attempted in this paper exclusively produced noisy output.Conclusions. The modified algorithm did not produce viable output. This most likely due to the behaviour of the Fourier transform in itself and in relation to the implementation of fitness calculation.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:bth-18981 |
| Date | January 2019 |
| Creators | Heiding, John |
| Publisher | Blekinge Tekniska Högskola, Institutionen för datavetenskap |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0262 seconds