Triakis truncated tetrahedron | |
---|---|
Type | Plesiohedron |
Faces | 4 hexagons 12 isosceles triangles |
Edges | 30 |
Vertices | 16 |
Conway notation | k3tT |
Dual polyhedron | 16|Order-3 truncated triakis tetrahedron |
Properties | convex |
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. [1] [2]
The triakis truncated tetrahedron is the shape of the Voronoi cell of the carbon atoms in diamond, which lie on the diamond cubic crystal structure. [3] [4] As the Voronoi cell of a symmetric space pattern, it is a plesiohedron. [5]
For space-filling, the triakis truncated tetrahedron can be constructed as follows:
In geometry, a convex uniform honeycomb is a uniform tessellation which fills three-dimensional Euclidean space with non-overlapping convex uniform polyhedral cells.
In geometry, every polyhedron is associated with a second dual figure, 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 are also geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron.
In geometry, the truncated tetrahedron is an Archimedean solid. It has 4 regular hexagonal faces, 4 equilateral triangle faces, 12 vertices and 18 edges. It can be constructed by truncating all 4 vertices of a regular tetrahedron at one third of the original edge length.
A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries.
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, the triangular tiling or triangular tessellation is one of the three regular tilings of the Euclidean plane, and is the only such tiling where the constituent shapes are not parallelogons. Because the internal angle of the equilateral triangle is 60 degrees, six triangles at a point occupy a full 360 degrees. The triangular tiling has Schläfli symbol of {3,6}.
The cubic honeycomb or cubic cellulation is the only proper regular space-filling tessellation in Euclidean 3-space made up of cubic cells. It has 4 cubes around every edge, and 8 cubes around each vertex. Its vertex figure is a regular octahedron. It is a self-dual tessellation with Schläfli symbol {4,3,4}. John Horton Conway called this honeycomb a cubille.
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.
The quarter cubic honeycomb, quarter cubic cellulation or bitruncated alternated cubic honeycomb is a space-filling tessellation in Euclidean 3-space. It is composed of tetrahedra and truncated tetrahedra in a ratio of 1:1. It is called "quarter-cubic" because its symmetry unit – the minimal block from which the pattern is developed by reflections – is four times that of the cubic honeycomb.
In geometry, an alternation or partial truncation, is an operation on a polygon, polyhedron, tiling, or higher dimensional polytope that removes alternate vertices.
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. A novel honeycomb tessellation generator MATLAB code, HoneyMesher, can be found in Ref.
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.
The triakis truncated tetrahedral honeycomb is a space-filling tessellation in Euclidean 3-space made up of triakis truncated tetrahedra. It was discovered in 1914.
The order-6 cubic honeycomb is a paracompact regular space-filling tessellation in hyperbolic 3-space. It is paracompact because it has vertex figures composed of an infinite number of facets, with all vertices as ideal points at infinity. With Schläfli symbol {4,3,6}, the honeycomb has six ideal cubes meeting along each edge. Its vertex figure is an infinite triangular tiling. Its dual is the order-4 hexagonal tiling honeycomb.
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.
In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space.