Search Results for ""
131 - 140 of 641 for Polyhedron NetSearch Results
A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...
The dual polyhedron of the small ditrigonal dodecicosidodecahedron U_(43) and Wenninger dual W_(82).
The dual polyhedron of the small snub icosicosidodecahedron U_(32) and Wenninger dual W_(110).
The dual polyhedron of the small retrosnub icosicosidodecahedron and Wenninger dual W_(118).
A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.
The truncated pentakis dodecahedron is a polyhedron on 180 vertices, 270 edges, and 92 faces. Its canonical polyhedron has edges of three different lengths and faces ...
Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...
The dual polyhedron of the cubohemioctahedron U_(15) and Wenninger dual W_(78). When rendered, the octahemioctacron and hexahemioctacron appear the same.
The octahemioctacron is the dual polyhedron of the octahemioctahedron U_3 and Wenninger dual W_(68). When rendered, the octahemioctacron and hexahemioctacron appear the same.
The pentagrammic concave deltohedron (Har'El 1993) is the dual polyhedron of the pentagrammic crossed antiprism U_(80). It is perhaps more commonly known as the pentagrammic ...
...
View search results from all Wolfram sites (3590 matches)

