In combinatorics, tripod packing is a problem of finding many disjoint tripods in a three-dimensional grid, where a tripod is an infinite polycube, the union of the grid cubes along three positive axis-aligned rays with a shared apex. Several problems of tiling and packing tripods and related shapes were formulated in 1967 by Sherman K. Stein.
In combinatorics, tripod packing is a problem of finding many disjoint tripods in a three-dimensional grid, where a tripod is an infinite polycube, the union of the grid cubes along three positive axis-aligned rays with a shared apex. Several problems of tiling and packing tripods and related shapes were formulated in 1967 by Sherman K. Stein.
Source: Wikipedia "Tripod packing" · CC BY-SA 4.0
Share this article: X · Bluesky