A three-dimensional Voronoi diagram partitions 3D space into a set of polyhedra linked to sites (the black points). Points inside the polyhedron for a site are closer to than to any other site. In this Demonstration, the regions are computed from a set of randomly placed points using the function Nearest.