A space filling algorithm for generating procedural geometry and texture

P.D. Bourke
iVEC@UWA, University of Western Australia

GSTF International Journal on Computing (JoC). Vol. 3, No. 2, 2013, pp 75-79. ISSN: 2251-3043. E-periodical: 2010-2283.
DOI: 10.5176/2251-3043_3.2.260


Here we present an algorithm for procedurally generating a range of digital assets including 2 dimensional textures and 2.5 dimensional texture roughness. The approach involves placing shapes randomly, without overlap and with a monotonically decreasing area, within a region on a plane (the 2 dimensional texture). If the process is continued to infinity then the result is space filling thus providing a variable and potentially infinite degree of visual detail. It will be proposed and illustrated that the process is independent of the actual shape being used and as such can find application to a range of texture effects. As a means of generating texture and form procedurally the result has the other desirable property of being fractal, that is, self similar across scales which is characteristic of many packings that occur in nature.


procedural, texture, tiling, packing, space filling.

Paper: paper.pdf