Plesiohedron

Last updated December 07, 2022

In geometry, a plesiohedron is a special kind of space-filling polyhedron, defined as the Voronoi cell of a symmetric Delone set. Three-dimensional Euclidean space can be completely filled by copies of any one of these shapes, with no overlaps. The resulting honeycomb will have symmetries that take any copy of the plesiohedron to any other copy.

Definition

A 17-sided plesiohedron and its honeycomb, the Voronoi diagram of the Laves graph

A set $S$ of points in Euclidean space is a Delone set if there exists a number $\varepsilon >0$ such that every two points of $S$ are at least at distance $\varepsilon$ apart from each other and such that every point of space is within distance $1/\varepsilon$ of at least one point in $S$ . So $S$ fills space, but its points never come too close to each other. For this to be true, $S$ must be infinite. Additionally, the set $S$ is symmetric (in the sense needed to define a plesiohedron) if, for every two points $p$ and $q$ of $S$ , there exists a rigid motion of space that takes $S$ to $S$ and $p$ to $q$ . That is, the symmetries of $S$ act transitively on $S$ .^[1]

The Voronoi diagram of any set $S$ of points partitions space into regions called Voronoi cells that are nearer to one given point of $S$ than to any other. When $S$ is a Delone set, the Voronoi cell of each point $p$ in $S$ is a convex polyhedron. The faces of this polyhedron lie on the planes that perpendicularly bisect the line segments from $p$ to other nearby points of $S$ .^[2]

When $S$ is symmetric as well as being Delone, the Voronoi cells must all be congruent to each other, for the symmetries of $S$ must also be symmetries of the Voronoi diagram. In this case, the Voronoi diagram forms a honeycomb in which there is only a single prototile shape, the shape of these Voronoi cells. This shape is called a plesiohedron. The tiling generated in this way is isohedral, meaning that it not only has a single prototile ("monohedral") but also that any copy of this tile can be taken to any other copy by a symmetry of the tiling.^[1]

As with any space-filling polyhedron, the Dehn invariant of a plesiohedron is necessarily zero.^[3]

Examples

The plesiohedra include the five parallelohedra. These are polyhedra that can tile space in such a way that every tile is symmetric to every other tile by a translational symmetry, without rotation. Equivalently, they are the Voronoi cells of lattices, as these are the translationally-symmetric Delone sets. Plesiohedra are a special case of the stereohedra, the prototiles of isohedral tilings more generally.^[1] For this reason (and because Voronoi diagrams are also known as Dirichlet tesselations) they have also been called "Dirichlet stereohedra"^[4]

There are only finitely many combinatorial types of plesiohedron. Notable individual plesiohedra include:

The five parallelohedra: the cube (or more generally the parallelepiped), hexagonal prism, rhombic dodecahedron, elongated dodecahedron, and truncated octahedron.^[5]
The triangular prism, the prototile of the triangular prismatic honeycomb.^[6] More generally, each of the 11 types of Laves tiling of the plane by congruent convex polygons (and each of the subtypes of these tilings with different symmetry groups) can be realized as the Voronoi cells of a symmetric Delone set in the plane.^[7] It follows that the prisms over each of these shapes are plesiohedra. As well as the triangular prisms, these include prisms over certain quadrilaterals, pentagons, and hexagons.
The gyrobifastigium is a stereohedron but not a plesiohedron, because the points at the centers of the cells of its face-to-face tiling (where they are forced to go by symmetry) have differently-shaped Voronoi cells. However, a flattened version of the gyrobifastigium, with faces made of isosceles right triangles and silver rectangles, is a plesiohedron.
The triakis truncated tetrahedron, the prototile of the triakis truncated tetrahedral honeycomb and the plesiohedron generated by the diamond lattice ^[1]
The trapezo-rhombic dodecahedron, the prototile of the trapezo-rhombic dodecahedral honeycomb and the plesiohedron generated by the hexagonal close-packing
The 17-sided Voronoi cells of the Laves graph ^[8]

Many other plesiohedra are known. Two different ones with the largest known number of faces, 38, were discovered by crystallographer Peter Engel.^[1]^[9] For many years the maximum number of faces of a plesiohedron was an open problem,^[10]^[4] but analysis of the possible symmetries of three-dimensional space has shown that this number is at most 38.^[11]

The Voronoi cells of points uniformly spaced on a helix fill space, are all congruent to each other, and can be made to have arbitrarily large numbers of faces.^[12] However, the points on a helix are not a Delone set and their Voronoi cells are not bounded polyhedra.

A modern survey is given by Schmitt.^[11]

Related Research Articles

In geometry, a dodecahedron or duodecahedron is any polyhedron with twelve flat faces. The most familiar dodecahedron is the regular dodecahedron with regular pentagons as faces, which is a Platonic solid. There are also three regular star dodecahedra, which are constructed as stellations of the convex form. All of these have icosahedral symmetry, order 120.

In geometry, every polyhedron is associated with a second dual structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron.

<span class="mw-page-title-main">Truncated icosidodecahedron</span> Archimedean solid

In geometry, the truncated icosidodecahedron is an Archimedean solid, one of thirteen convex, isogonal, non-prismatic solids constructed by two or more types of regular polygon faces.

<span class="mw-page-title-main">Rhombic dodecahedron</span> Catalan solid with 12 faces

In geometry, the rhombic dodecahedron is a convex polyhedron with 12 congruent rhombic faces. It has 24 edges, and 14 vertices of 2 types. It is a Catalan solid, and the dual polyhedron of the cuboctahedron.

In geometry, a zonohedron is a convex polyhedron that is centrally symmetric, every face of which is a polygon that is centrally symmetric. Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in three-dimensional space, or as the three-dimensional projection of a hypercube. Zonohedra were originally defined and studied by E. S. Fedorov, a Russian crystallographer. More generally, in any dimension, the Minkowski sum of line segments forms a polytope known as a zonotope.

The Wigner–Seitz cell, named after Eugene Wigner and Frederick Seitz, is a primitive cell which has been constructed by applying Voronoi decomposition to a crystal lattice. It is used in the study of crystalline materials in crystallography.

In geometry, the hexagonal prism is a prism with hexagonal base. Prisms are polyhedrons; this polyhedron has 8 faces, 18 edges, and 12 vertices.

In geometry, the elongated dodecahedron, extended rhombic dodecahedron, rhombo-hexagonal dodecahedron or hexarhombic dodecahedron is a convex dodecahedron with 8 rhombic and 4 hexagonal faces. The hexagons can be made equilateral, or regular depending on the shape of the rhombi. It can be seen as constructed from a rhombic dodecahedron elongated by a square prism.

In geometry, the trapezo-rhombic dodecahedron or rhombo-trapezoidal dodecahedron is a convex dodecahedron with 6 rhombic and 6 trapezoidal faces. It has $D 3h$ symmetry. A concave form can be constructed with an identical net, seen as excavating trigonal trapezohedra from the top and bottom.

The tetrahedral-octahedral honeycomb, alternated cubic honeycomb is a quasiregular space-filling tessellation in Euclidean 3-space. It is composed of alternating regular octahedra and tetrahedra in a ratio of 1:2.

The bitruncated cubic honeycomb is a space-filling tessellation in Euclidean 3-space made up of truncated octahedra. It has 4 truncated octahedra around each vertex. Being composed entirely of truncated octahedra, it is cell-transitive. It is also edge-transitive, with 2 hexagons and one square on each edge, and vertex-transitive. It is one of 28 uniform honeycombs.

In geometry, a honeycomb is a space filling or close packing of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the more general mathematical tiling or tessellation in any number of dimensions. Its dimension can be clarified as n-honeycomb for a honeycomb of n-dimensional space.

In geometry, a quasiregular polyhedron is a uniform polyhedron that has exactly two kinds of regular faces, which alternate around each vertex. They are vertex-transitive and edge-transitive, hence a step closer to regular polyhedra than the semiregular, which are merely vertex-transitive.

In geometry, a parallelohedron is a polyhedron that can be translated without rotations in 3-dimensional Euclidean space to fill space with a honeycomb in which all copies of the polyhedron meet face-to-face. There are five types of parallelohedron, first identified by Evgraf Fedorov in 1885 in his studies of crystallographic systems: the cube, hexagonal prism, rhombic dodecahedron, elongated dodecahedron, and truncated octahedron.

In geometry, the triakis truncated tetrahedron is a convex polyhedron made from 4 hexagons and 12 isosceles triangles. It can be used to tessellate three-dimensional space, making the triakis truncated tetrahedral honeycomb.

In geometry, the first stellation of the rhombic dodecahedron is a self-intersecting polyhedron with 12 faces, each of which is a non-convex hexagon. It is a stellation of the rhombic dodecahedron and has the same outer shell and the same visual appearance as two other shapes: a solid, Escher's solid, with 48 triangular faces, and a polyhedral compound of three flattened octahedra with 24 overlapping triangular faces.

In geometry, chamfering or edge-truncation is a topological operator that modifies one polyhedron into another. It is similar to expansion, moving faces apart and outward, but also maintains the original vertices. For polyhedra, this operation adds a new hexagonal face in place of each original edge.

In geometry, a space-filling polyhedron is a polyhedron that can be used to fill all of three-dimensional space via translations, rotations and/or reflections, where filling means that, taken together, all the instances of the polyhedron constitute a partition of three-space. Any periodic tiling or honeycomb of three-space can in fact be generated by translating a primitive cell polyhedron.

References

1 2 3 4 5 Grünbaum, Branko; Shephard, G. C. (1980), "Tilings with congruent tiles", Bulletin of the American Mathematical Society , New Series, 3 (3): 951–973, doi: 10.1090/S0273-0979-1980-14827-2 , MR 0585178 .
↑ Aurenhammer, Franz (September 1991), "Voronoi diagrams—a survey of a fundamental geometric data structure", ACM Computing Surveys , 23 (3): 345–405, doi:10.1145/116873.116880 . See especially section 1.2.1, "Regularly Placed Sites", pp. 354–355.
↑ Lagarias, J. C.; Moews, D. (1995), "Polytopes that fill $\mathbb {R} ^{n}$ and scissors congruence", Discrete and Computational Geometry , 13 (3–4): 573–583, doi: 10.1007/BF02574064 , MR 1318797 .
1 2 Sabariego, Pilar; Santos, Francisco (2011), "On the number of facets of three-dimensional Dirichlet stereohedra IV: quarter cubic groups", Beiträge zur Algebra und Geometrie, 52 (2): 237–263, arXiv: 0708.2114 , doi:10.1007/s13366-011-0010-5, MR 2842627 .
↑ Erdahl, R. M. (1999), "Zonotopes, dicings, and Voronoi's conjecture on parallelohedra", European Journal of Combinatorics, 20 (6): 527–549, doi: 10.1006/eujc.1999.0294 , MR 1703597 . Voronoi conjectured that all tilings of higher dimensional spaces by translates of a single convex polytope are combinatorially equivalent to Voronoi tilings, and Erdahl proves this in the special case of zonotopes. But as he writes (p. 429), Voronoi's conjecture for dimensions at most four was already proven by Delaunay. For the classification of three-dimensional parallelohedra into these five types, see Grünbaum & Shephard (1980).
↑ Pugh, Anthony (1976), "Close-packing polyhedra", Polyhedra: a visual approach, University of California Press, Berkeley, Calif.-London, pp. 48–50, MR 0451161 .
↑ Delone, B. N.; Dolbilin, N. P.; Štogrin, M. I. (1978), "Combinatorial and metric theory of planigons", Trudy Matematicheskogo Instituta Imeni V. A. Steklova, 148: 109–140, 275, MR 0558946 .
↑ Schoen, Alan H. (June–July 2008), "On the graph (10,3)-a" (PDF), Notices of the American Mathematical Society , 55 (6): 663.
↑ Engel, Peter (1981), "Über Wirkungsbereichsteilungen von kubischer Symmetrie", Zeitschrift für Kristallographie, Kristallgeometrie, Kristallphysik, Kristallchemie, 154 (3–4): 199–215, Bibcode:1981ZK....154..199E, doi:10.1524/zkri.1981.154.3-4.199, MR 0598811 .
↑ Shephard, G. C. (1985), "69.14 Space Filling with Identical Symmetrical Solids", The Mathematical Gazette , 69 (448): 117–120, doi:10.2307/3616930, JSTOR 3616930 .
1 2 Schmitt, Moritz (2016), On Space Groups and Dirichlet-Voronoi Stereohedra .
↑ Erickson, Jeff; Kim, Scott (2003), "Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes", Discrete geometry, Monogr. Textbooks Pure Appl. Math., vol. 253, Dekker, New York, pp. 267–278, arXiv: math/0106095 , Bibcode:2001math......6095E, MR 2034721 .

External links

Weisstein, Eric W., "Space-Filling Polyhedron", MathWorld

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[gs80-1] 1 2 3 4 5 Grünbaum, Branko; Shephard, G. C. (1980), "Tilings with congruent tiles", Bulletin of the American Mathematical Society , New Series, 3 (3): 951–973, doi: 10.1090/S0273-0979-1980-14827-2 , MR 0585178 .

[2] Aurenhammer, Franz (September 1991), "Voronoi diagrams—a survey of a fundamental geometric data structure", ACM Computing Surveys , 23 (3): 345–405, doi:10.1145/116873.116880 . See especially section 1.2.1, "Regularly Placed Sites", pp. 354–355.

[3] Lagarias, J. C.; Moews, D. (1995), "Polytopes that fill $\mathbb {R} ^{n}$ and scissors congruence", Discrete and Computational Geometry , 13 (3–4): 573–583, doi: 10.1007/BF02574064 , MR 1318797 .

[ss11-4] 1 2 Sabariego, Pilar; Santos, Francisco (2011), "On the number of facets of three-dimensional Dirichlet stereohedra IV: quarter cubic groups", Beiträge zur Algebra und Geometrie, 52 (2): 237–263, arXiv: 0708.2114 , doi:10.1007/s13366-011-0010-5, MR 2842627 .

[5] Erdahl, R. M. (1999), "Zonotopes, dicings, and Voronoi's conjecture on parallelohedra", European Journal of Combinatorics, 20 (6): 527–549, doi: 10.1006/eujc.1999.0294 , MR 1703597 . Voronoi conjectured that all tilings of higher dimensional spaces by translates of a single convex polytope are combinatorially equivalent to Voronoi tilings, and Erdahl proves this in the special case of zonotopes. But as he writes (p. 429), Voronoi's conjecture for dimensions at most four was already proven by Delaunay. For the classification of three-dimensional parallelohedra into these five types, see Grünbaum & Shephard (1980).

[6] Pugh, Anthony (1976), "Close-packing polyhedra", Polyhedra: a visual approach, University of California Press, Berkeley, Calif.-London, pp. 48–50, MR 0451161 .

[7] Delone, B. N.; Dolbilin, N. P.; Štogrin, M. I. (1978), "Combinatorial and metric theory of planigons", Trudy Matematicheskogo Instituta Imeni V. A. Steklova, 148: 109–140, 275, MR 0558946 .

[8] Schoen, Alan H. (June–July 2008), "On the graph (10,3)-a" (PDF), Notices of the American Mathematical Society , 55 (6): 663.

[9] Engel, Peter (1981), "Über Wirkungsbereichsteilungen von kubischer Symmetrie", Zeitschrift für Kristallographie, Kristallgeometrie, Kristallphysik, Kristallchemie, 154 (3–4): 199–215, Bibcode:1981ZK....154..199E, doi:10.1524/zkri.1981.154.3-4.199, MR 0598811 .

[10] Shephard, G. C. (1985), "69.14 Space Filling with Identical Symmetrical Solids", The Mathematical Gazette , 69 (448): 117–120, doi:10.2307/3616930, JSTOR 3616930 .

[schmitt-11] 1 2 Schmitt, Moritz (2016), On Space Groups and Dirichlet-Voronoi Stereohedra .

[12] Erickson, Jeff; Kim, Scott (2003), "Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes", Discrete geometry, Monogr. Textbooks Pure Appl. Math., vol. 253, Dekker, New York, pp. 267–278, arXiv: math/0106095 , Bibcode:2001math......6095E, MR 2034721 .

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]