Crumley,Z., Marais,P., Gain,J.
We present a novel extension to shape grammars, in which the generated shapes are voxelized. This allows easy Boolean geometry operations on the shapes, and detailing of generated models at a sub-shape level, both of which are extremely difficult to do in conventional shape grammar implementations. We outline a four step algorithm for using these extensions, discuss a number of optional enhancements and optimizations, and test our extension's performance and range of output. The results show that our unoptimized algorithm is slower than conventional shape grammar implementations, with a running time that is O(N^3) for a N^3 voxel grid, but is able to produce a broad range of detailed outputs.