Abstract
In 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. © 2014 The Author(s) Computer Graphics Forum © 2014 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.
Original language | English (US) |
---|---|
Pages (from-to) | 73-82 |
Number of pages | 10 |
Journal | Computer Graphics Forum |
Volume | 33 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1 2014 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledgements: This research was funded by the Austrian Science Fund (FWF): P23329.
ASJC Scopus subject areas
- Computer Networks and Communications