Název: Efficient Procedural Generation of Forests
Autoři: Kenwood, Julian
Gain, James
Marais, Patrick
Citace zdrojového dokumentu: Journal of WSCG. 2014, vol. 22, no. 1, p. 31-38.
Datum vydání: 2014
Nakladatel: Václav Skala - UNION Agency
Typ dokumentu: article
článek
URI: http://wscg.zcu.cz/WSCG2014/!!_2014-Journal-No-1.pdf
http://hdl.handle.net/11025/11896
ISSN: 1213–6972 (hardcopy)
1213–6980 (CD-ROM)
1213–6964 (online)
Klíčová slova: procedurální generování stromů;L-systémy;virtuální prostředí;instancing
Klíčová slova v dalším jazyce: procedural tree generation;L-systems;virtual environments;instancing
Abstrakt: 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.
Práva: © Václav Skala - UNION Agency
Vyskytuje se v kolekcích:Volume 22, Number 1 (2014)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Kenwood.pdfPlný text2,12 MBAdobe PDFZobrazit/otevřít


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/11896

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.