A plesiohedron, defined as the Voronoi cell of a symmetric Delone set, is by construction a polyhedron that tesselates space isohedrally, with each cell translationally symmetric to every other. I parametrized this definition in Grasshopper design software, allowing me to sample arbitrary points from the phase space and even construct continuous trajectories through it. The animation shown here visualizes a point moving along such a path through the phase space. As such, if you were to freeze the animation, no matter what frame it stopped on, the polyhedron depicted would tile all of space. This method is far from generating all possible polyhedra that can tile space, nor is the construction from a Delone set necessarily the only way to tile any particular plesiohedron. Take bricks, for example, which, when they are stacked in alternating rows, contain instances of exactly two edges meeting, unlike the Voronoi diagram of a Delone set whose edges always meet in three or more.

An assembly of space-filling plesiohedra

A continuous walk through the parameter space of plesiohedra

Another class of polyhedra, "polycubes," is formed of identical cubes affixed face to face. Packing problems of polycubes include those of pentacubes (3d analogues of pentominoes), tripods, and popular puzzles like the Soma Cube. While playing around with virtual blocks, I found out the following by construction: If you take a cube, and any n of its six faces, and afix identical cubes to those faces, then the union of these cubes is a polyhedron that can be stacked to fill space without gaps or overlaps. In other terms, this is the family of polycubes whose dual graphs are trees with a depth of one or less. While reading up on this family of space-tiling shapes I came across this demonstration of the case when n=6, with very nicely rendered animations of the assembly. I find these shapes especially fascinating for the satisfying ways they interlock. Each unique kind of branched cube, up to symmetry, is shown here, in a 6x6x6 tiling.