Title: Efficient Procedural Generation of Forests
Authors: Kenwood, Julian
Gain, James
Marais, Patrick
Citation: Journal of WSCG. 2014, vol. 22, no. 1, p. 31-38.
Issue Date: 2014
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://wscg.zcu.cz/WSCG2014/!!_2014-Journal-No-1.pdf
ISSN: 1213–6972 (hardcopy)
1213–6980 (CD-ROM)
1213–6964 (online)
Keywords: procedurální generování stromů;L-systémy;virtuální prostředí;instancing
Keywords in different language: procedural tree generation;L-systems;virtual environments;instancing
Abstract: Forested landscapes are an important component of many large virtual environments in games and film. In order to reduce modelling time, procedural methods are often used. Unfortunately, procedural tree generation tends to be slow and resource-intensive for large forests. The main contribution of this paper is the development of an efficient procedural generation system for the creation of large forests. Our system uses L-systems, a grammar-based procedural technique, to generate each tree. We algorithmically modify L-system tree grammars to intelligently use an instance cache for tree branches. Our instancing approach not only makes efficient use of memory but also reduces the visual repetition artifacts which can arise due to the granularity of the instances. Instances can represent a range of structures, from a single branch to multiple branches or even an entire tree. Our system improves the speed and memory requirements for forest generation by 3–4 orders of magnitude over naïve methods: we generate over 1;000;000 trees in 4.5 seconds, while using only 350MB of memory.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 22, Number 1 (2014)

Files in This Item:
File Description SizeFormat 
Kenwood.pdfPlný text2,12 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11896

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.