tetrahedron

(redirected from tetrahedra)
Also found in: Dictionary, Thesaurus.
Related to tetrahedra: regular tetrahedron

tetrahedron:

see polyhedronpolyhedron
, closed solid bounded by plane faces; each face of a polyhedron is a polygon. A cube is a polyhedron bounded by six polygons (in this case squares) meeting at right angles.
..... Click the link for more information.
.

Tetrahedron

A polygon with four plane surfaces.

Tetrahedron

 

(or triangular pyramid), a polyhedron with four triangular faces, six edges, and four vertices. At each vertex three edges intersect. The regular tetrahedron (Figure 1) is one

Figure 1

of the five regular polyhedrons. If a is the length of an edge of a regular tetrahedron, the volume of the tetrahedron is Tetrahedron.

tetrahedron

[‚te·trə′hē·drən]
(crystallography)
An isometric crystal form in cubic crystals, in the shape of a four-faced polyhedron, each face of which is a triangle.
(mathematics)
A four-sided polyhedron.

tetrahedron

tetrahedron
A device to indicate wind direction, and, in turn, landing direction. It is tetrahedronshaped—four triangular sides. This device is generally located at uncontrolled airports. The small end of a tetrahedron points in the direction of landing. At controlled airports, the tetrahedron should be disregarded because tower instructions supercede the indicator. On approach charts, a tetrahedron is shown as.

tetrahedron

1. a solid figure having four plane faces. A regular tetrahedron has faces that are equilateral triangles
2. any object shaped like a tetrahedron
References in periodicals archive ?
i], we denote the collection of all triangular faces f of tetrahedra [tau] [member of] [[XI].
j] needed for the MRA, we use a sequence of tetrahedra, beginning with a basic net [T.
According to Salvatore Torquato of Princeton University, tetrahedra may be able to pack together randomly even more efficiently.
h] [intersection] [partial derivative][OMEGA] being the curved side of an ideal tetrahedra and with [S.
Tetrahedra are dimension 3 simplices whose faces are simplices of dimension 2 (triangles), whose edges are simplices of dimension 1 (segment lines), whose vertices are simplices of dimension 0 (points).
The main result of this paper is the proof that there always exists a through-vertex Hamiltonian path in grids consisting of triangles or tetrahedra, under very mild conditions.
When doing one tetrahedron subdivision, 8 tetrahedra are generated.
The stable quasicrystals and the approximants are made of two (38) or more chemical components, allowing irregular tetrahedra t hat have a better chance of filling space.
Because brick and hybrid meshes can represent complex geometry with fewer nodes than tetrahedral meshes at the same, high level of accuracy, analyses for brick and hybrid meshes process faster than for tetrahedra.
Not just that, Torquato and Jiao have also formulated a way of placing pairs of tetrahedra face-to-face, forming a "kissing" pattern which looks jumbled and irregular when seen from the outside of the container.
It's possible to construct an infinite lattice of interpenetrating tetrahedra, where each face of each tetrahedron is pierced by the vertex of another.