Parallel generation of multiple L-systems

Lipp, Markus; Wonka, Peter; Wimmer, Michael

doi:10.1016/j.cag.2010.05.014

Cited by 21 publications

(19 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since the interpretation of an L-system is an inherently serial process, they are not straightforwardly applicable to parallel processing. In 2010, MARKUS LIPP et al presented a solution to this algorithmic challenge [15].…”

Section: Natural Patternsmentioning

confidence: 99%

A Survey of Algorithmic Shapes

2015

View full text Add to dashboard Cite

In the context of computer-aided design, computer graphics and geometry processing, the idea of generative modeling is to allow the generation of highly complex objects based on a set of formal construction rules. Using these construction rules, a shape is described by a sequence of processing steps, rather than just by the result of all applied operations: shape design becomes rule design. Due to its very general nature, this approach can be applied to any domain and to any shape representation that provides a set of generating functions. The aim of this survey is to give an overview of the concepts and techniques of procedural and generative modeling, as well as their applications with a special focus on archeology and architecture.

show abstract

Section: Natural Patternsmentioning

confidence: 99%

A Survey of Algorithmic Shapes

2015

View full text Add to dashboard Cite

show abstract

“…This strategy has also been used by Lipp et al [LWW10] for the derivation of L-systems. This approach requires a high number of kernel launches interrupted by read-backs from the GPU.…”

Section: Rule Schedulingmentioning

confidence: 99%

Parallel generation of architecture on the GPU

Steinberger

Kenzel

Kainz

et al. 2014

Computer Graphics Forum

View full text Add to dashboard Cite

Figure 1: With our parallel approach to procedural architecture, large cities can be generated in less than a second on the GPU. The city overview shows a scene with 38 000 low-detail buildings generated in 290 ms (left). The 520 buildings in the skyscraper scene consist of 1.5 million terminal shapes evaluating to 8 million vertices and 4 million triangles, all generated in 120 ms (center). The highly detailed skyscrapers are built using context-sensitive rules, to, e. g., avoid overlapping balconies (right). AbstractIn this paper, we present a novel approach for the parallel evaluation of procedural shape grammars on the graphics processing unit (GPU). Unlike previous approaches that are either limited in the kind of shapes they allow, the amount of parallelism they can take advantage of, or both, our method supports state of the art procedural modeling including stochasticity and context-sensitivity. To increase parallelism, we explicitly express independence in the grammar, reduce inter-rule dependencies required for context-sensitive evaluation, and introduce intra-rule parallelism. Our rule scheduling scheme avoids unnecessary back and forth between CPU and GPU and reduces round trips to slow global memory by dynamically grouping rules in on-chip shared memory. Our GPU shape grammar implementation is multiple orders of magnitude faster than the standard in CPU-based rule evaluation, while offering equal expressive power. In comparison to the state of the art in GPU shape grammar derivation, our approach is nearly 50 times faster, while adding support for geometric context-sensitivity.

show abstract

“…However, locks tend to come with performance implications. Thus, [23] introduced a multithreaded L-system that is completely lock-free. This extension can therefore be deployed to massively parallel architectures, such as GPUs, so a result using a large ruleset can be generated quickly and efficiently.…”

Section: Rule-based Procedural Generationmentioning

confidence: 99%

Procedural feature generation for volumetric terrains using voxel grammars

Dey

Doig²,

Gatzidis

2018

Entertainment Computing

View full text Add to dashboard Cite

A B S T R A C TTerrain generation is a fundamental requirement of many computer graphics simulations, including computer games, flight simulators and environments in feature films. There has been a considerable amount of research in this domain, which ranges between fully automated and semi-automated methods. Voxel representations of 3D terrains can create rich features that are not found in other forms of terrain generation techniques, such as caves and overhangs. In this article, we introduce a semi-automated method of generating features for volumetric terrains using a rule-based procedural generation system. Features are generated by selecting subsets of a voxel grid as input symbols to a grammar, composed of user-created operators. This results in overhangs and caves generated from a set of simple rules. The feature generation runs on the CPU and the GPU is utilised to extract a robust mesh from the volumetric dataset.

show abstract

Parallel generation of multiple L-systems

Cited by 21 publications

References 10 publications

A Survey of Algorithmic Shapes

A Survey of Algorithmic Shapes

Parallel generation of architecture on the GPU

Procedural feature generation for volumetric terrains using voxel grammars

Contact Info

Product

Resources

About