The work consists of ¼ the probability of intersections of edges of arrays of cubes and a lack thereof in the center of the picture.
In layers:
L0. Imagine an array of cubes, a two dimensional grid of two by two by two boxes offset by one from each other. Remove their faces leaving them with their edges: four in a square on the bottom, vice versa on top with an additional four connecting the two. Parallel to and inside of this grid place a plane, so that the plane touches only the edges connecting the top and bottom: per box four intersections. Discard all but the points of intersection with the plane, this is the base of the animation.
L1. The plane described is the camera recording only at this ‘two dimensional’ cut in three dimensional space. In actuality the cut has width because the edges are infinitely thin; if the edges were angled parallel to the camera they’d be invisible, if they’re slightly angled (even if imperceptibly) they’ll be visible. The camera very slightly rotates and so uses the effect of the visibility of the edges, disappearing and reappearing.
L2. The camera moves parallel to the grid, resulting in a moving image. The camera records the described installation to a 1080p 30 second loop, the edges only barely slanted are picked up as only dots and therefore only pixels.
L3. This image is scaled down four times and scaled back again, the latter involving the use of no interpolation (no color fading, treats colors as absolute). This gives two results: pixels are now four times their size and have only one fourth the chance of appearing.
L1-2 Give the initial properties of movement and translocation, L3 obscures the image further and suggests other transformations, seemingly with similar effect.
