AbstractA space-filling polyhedron is one whose replications can be packed to fill three-space completely. The class of the known space-filling tetrahedra has been recently increased. These enable an increase in the class of the known space-filling pentahedra
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
AbstractIn this paper it is shown that 3-space cannot be filled with cubes such that neighbouring cu...
AbstractA space-filling polyhedron is one whose replications can be packed to fill three-space compl...
AbstractA space-filling polyhedron is one whose replications can be packed to fill three-space compl...
AbstractA space-filling polyhedron is one whose replications can be packed to fill three-space compl...
The goal of this paper is to illustrate how octahedra and tetrahedra pack together to fill space, an...
Un polyèdre remplissant I’espace est celui dont les copies identiques peuvent être entassées pour re...
This activity is an investigation of a special nonregular tetrahedron that can be arranged to fill s...
This paper proposes a generally new type of macrospace filling honeycombs having quasi-regular penta...
To this demonstrations, one needs to know the basic concepts about crystallographyThis Demonstration...
Partitioning space into polyhedra with a minimum total surface area is a fundamental question in sci...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Partitioning space into polyhedra with a minimum total surface area is a fundamental question in sci...
The five Platonic polyhedra combine identical regular polygons such that the spatial angles between ...
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
AbstractIn this paper it is shown that 3-space cannot be filled with cubes such that neighbouring cu...
AbstractA space-filling polyhedron is one whose replications can be packed to fill three-space compl...
AbstractA space-filling polyhedron is one whose replications can be packed to fill three-space compl...
AbstractA space-filling polyhedron is one whose replications can be packed to fill three-space compl...
The goal of this paper is to illustrate how octahedra and tetrahedra pack together to fill space, an...
Un polyèdre remplissant I’espace est celui dont les copies identiques peuvent être entassées pour re...
This activity is an investigation of a special nonregular tetrahedron that can be arranged to fill s...
This paper proposes a generally new type of macrospace filling honeycombs having quasi-regular penta...
To this demonstrations, one needs to know the basic concepts about crystallographyThis Demonstration...
Partitioning space into polyhedra with a minimum total surface area is a fundamental question in sci...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Partitioning space into polyhedra with a minimum total surface area is a fundamental question in sci...
The five Platonic polyhedra combine identical regular polygons such that the spatial angles between ...
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
AbstractIn this paper it is shown that 3-space cannot be filled with cubes such that neighbouring cu...
DOI
Add to ORKG