Real-time generation of procedural forests

Simple item page
dc.contributor.advisorGain, Jamesen_ZA
dc.contributor.advisorMarais, Patricken_ZA
dc.contributor.authorKenwood, Julianen_ZA
dc.date.accessioned2014-11-05T03:57:31Z
dc.date.available2014-11-05T03:57:31Z
dc.date.issued2013en_ZA
dc.descriptionIncludes bibliographical references.en_ZA
dc.description.abstractThe creation of 3D models for games and simulations is generally a time-consuming and labour intensive task. Forested landscapes are an important component of many large virtual environments in games and film. To create the many individual tree models required for forests requires a large numbers of artists and a great deal of time. In order to reduce modelling time procedural methods are often used. Such methods allow tree models to be created automatically and relatively quickly, albeit at potentially reduced quality. Although the process is faster than manual creation, it can still be slow and resource-intensive for large forests. The main contribution of this work is the development of an efficient procedural generation system for creating large forests. Our system uses L-Systems, a grammar-based procedural technique, to generate each tree. We explore two approaches to accelerating the creation of large forests. First, we demonstrate performance improvements for the creation of individual trees in the forest, by reducing the computation required by the underlying L-Systems. Second, we reduce the memory overhead by sharing geometry between trees using a novel branch instancing approach. Test results show that our scheme significantly improves the speed of forest generation over naive methods: our system is able to generate over 100, 000 trees in approximately 2 seconds, while using a modest amount of memory. With respect to improving L-System processing, one of our methods achieves a 25 speed up over traditional methods at the cost of a small amount of additional memory, while our second method manages a 99 reduction in memory at the expense of a small amount of extra processing.en_ZA
dc.identifier.apacitationKenwood, J. (2013). <i>Real-time generation of procedural forests</i>. (Thesis). University of Cape Town ,Faculty of Science ,Department of Computer Science. Retrieved from http://hdl.handle.net/11427/9204en_ZA
dc.identifier.chicagocitationKenwood, Julian. <i>"Real-time generation of procedural forests."</i> Thesis., University of Cape Town ,Faculty of Science ,Department of Computer Science, 2013. http://hdl.handle.net/11427/9204en_ZA
dc.identifier.citationKenwood, J. 2013. Real-time generation of procedural forests. University of Cape Town.en_ZA
dc.identifier.ris TY - Thesis / Dissertation AU - Kenwood, Julian AB - The creation of 3D models for games and simulations is generally a time-consuming and labour intensive task. Forested landscapes are an important component of many large virtual environments in games and film. To create the many individual tree models required for forests requires a large numbers of artists and a great deal of time. In order to reduce modelling time procedural methods are often used. Such methods allow tree models to be created automatically and relatively quickly, albeit at potentially reduced quality. Although the process is faster than manual creation, it can still be slow and resource-intensive for large forests. The main contribution of this work is the development of an efficient procedural generation system for creating large forests. Our system uses L-Systems, a grammar-based procedural technique, to generate each tree. We explore two approaches to accelerating the creation of large forests. First, we demonstrate performance improvements for the creation of individual trees in the forest, by reducing the computation required by the underlying L-Systems. Second, we reduce the memory overhead by sharing geometry between trees using a novel branch instancing approach. Test results show that our scheme significantly improves the speed of forest generation over naive methods: our system is able to generate over 100, 000 trees in approximately 2 seconds, while using a modest amount of memory. With respect to improving L-System processing, one of our methods achieves a 25 speed up over traditional methods at the cost of a small amount of additional memory, while our second method manages a 99 reduction in memory at the expense of a small amount of extra processing. DA - 2013 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 2013 T1 - Real-time generation of procedural forests TI - Real-time generation of procedural forests UR - http://hdl.handle.net/11427/9204 ER - en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/9204
dc.identifier.vancouvercitationKenwood J. Real-time generation of procedural forests. [Thesis]. University of Cape Town ,Faculty of Science ,Department of Computer Science, 2013 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/9204en_ZA
dc.language.isoengen_ZA
dc.publisher.departmentDepartment of Computer Scienceen_ZA
dc.publisher.facultyFaculty of Scienceen_ZA
dc.publisher.institutionUniversity of Cape Town
dc.titleReal-time generation of procedural forestsen_ZA
dc.typeMaster Thesis
dc.type.qualificationlevelMasters
dc.type.qualificationnameMScen_ZA
uct.type.filetypeText
uct.type.filetypeImage
uct.type.publicationResearchen_ZA
uct.type.resourceThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
thesis_sci_2013_kenwood_j.pdf
Size:
11.07 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Masters