Real-time Generation of Procedural Forests

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...

Full description

Bibliographic Details
Main Author: Kenwood, Julian
Format: Others
Published: 2014
Subjects:
Online Access:http://pubs.cs.uct.ac.za/archive/00000941/
id ndltd-netd.ac.za-oai-union.ndltd.org-uctcs-oai-techreports.cs.uct.ac.za-941
record_format oai_dc
spelling ndltd-netd.ac.za-oai-union.ndltd.org-uctcs-oai-techreports.cs.uct.ac.za-9412014-07-16T04:00:45Z Real-time Generation of Procedural Forests Kenwood, Julian J.3 LIFE AND MEDICAL SCIENCES I.m MISCELLANEOUS I.3 COMPUTER GRAPHICS I.6 SIMULATION AND MODELING 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. 2014-01-01 Electronic Thesis or Dissertation http://pubs.cs.uct.ac.za/archive/00000941/ pdf http://pubs.cs.uct.ac.za/archive/00000941/01/full.pdf
collection NDLTD
format Others
sources NDLTD
topic J.3 LIFE AND MEDICAL SCIENCES
I.m MISCELLANEOUS
I.3 COMPUTER GRAPHICS
I.6 SIMULATION AND MODELING
spellingShingle J.3 LIFE AND MEDICAL SCIENCES
I.m MISCELLANEOUS
I.3 COMPUTER GRAPHICS
I.6 SIMULATION AND MODELING
Kenwood, Julian
Real-time Generation of Procedural Forests
description 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.
author Kenwood, Julian
author_facet Kenwood, Julian
author_sort Kenwood, Julian
title Real-time Generation of Procedural Forests
title_short Real-time Generation of Procedural Forests
title_full Real-time Generation of Procedural Forests
title_fullStr Real-time Generation of Procedural Forests
title_full_unstemmed Real-time Generation of Procedural Forests
title_sort real-time generation of procedural forests
publishDate 2014
url http://pubs.cs.uct.ac.za/archive/00000941/
work_keys_str_mv AT kenwoodjulian realtimegenerationofproceduralforests
_version_ 1716708274087133184