Search results
Results From The WOW.Com Content Network
This file contains additional information, probably added from the digital camera or scanner used to create or digitize it. If the file has been modified from its original state, some details may not fully reflect the modified file.
In geometry, a triangular prism or trigonal prism [1] is a prism with 2 triangular bases. If the edges pair with each triangle's vertex and if they are perpendicular to the base, it is a right triangular prism. A right triangular prism may be both semiregular and uniform. The triangular prism can be used in constructing another polyhedron.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate; Help; Learn to edit; Community portal; Recent changes; Upload file
Truncated cubic prism, Truncated octahedral prism, Cuboctahedral prism, Rhombicuboctahedral prism, Truncated cuboctahedral prism, Snub cubic prism; Truncated dodecahedral prism, Truncated icosahedral prism, Icosidodecahedral prism, Rhombicosidodecahedral prism, Truncated icosidodecahedral prism, Snub dodecahedral prism; Uniform antiprismatic prism
b = the base side of the prism's triangular base, h = the height of the prism's triangular base L = the length of the prism see above for general triangular base Isosceles triangular prism: b = the base side of the prism's triangular base, h = the height of the prism's triangular base
The dual polyhedron of the triaugmented triangular prism has a face for each vertex of the triaugmented triangular prism, and a vertex for each face. It is an enneahedron (that is, a nine-sided polyhedron) [ 16 ] that can be realized with three non-adjacent square faces, and six more faces that are congruent irregular pentagons . [ 17 ]
Today's NYT Connections puzzle for Friday, December 13, 2024The New York Times
The graph of an n-gonal prism has 2n vertices and 3n edges. They are regular, cubic graphs. Since the prism has symmetries taking each vertex to each other vertex, the prism graphs are vertex-transitive graphs. As polyhedral graphs, they are also 3-vertex-connected planar graphs. Every prism graph has a Hamiltonian cycle. [2]