Search Results for ""
11 - 20 of 213 for Tetrahedral TessellationSearch Results
A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...
The tetrahedral group T_d is the point group of symmetries of the tetrahedron including the inversion operation. It is one of the 12 non-Abelian groups of order 24. The ...
A surface given by the parametric equations x = A(u-a)^m(v-a)^n (1) y = B(u-b)^m(v-b)^n (2) z = C(u-c)^m(v-c)^n. (3)
A tetrahedral ring is a term given in this work to a set of n regular tetrahedra joined face-to-face sharing a common edge (with internal conjoined faces removed). These ...
Coordinates useful for plotting projective three-dimensional curves of the form f(x_0,x_1,x_2,x_3)=0 which are defined by x_0 = 1-z-sqrt(2)x (1) x_1 = 1-z+sqrt(2)x (2) x_2 = ...
The tetrahedral equation, by way of analogy with the icosahedral equation, is a set of related equations derived from the projective geometry of the octahedron. Consider a ...
"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...
A figurate number constructed by taking the (3n-2)th tetrahedral number and removing the (n-1)th tetrahedral number from each of the four corners, Ttet_n = ...
The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...
The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron. It is implemented in the Wolfram ...
...
View search results from all Wolfram sites (480 matches)

