Search Results for ""

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

The ditrigonal dodecadodecahedron, also called the ditrigonal dodecahedron, is the uniform polyhedron with Maeder index 41 (Maeder 1997), Wenninger index 80 (Wenninger 1989), ...

A number of attractive 2-compounds of the regular dodecahedron can be constructed. The first (left figures) has the symmetry of the cube and arises by combining two regular ...

700 The great dodecahemicosahedron is the uniform polyhedron with Maeder index 65 (Maeder 1997), Wenninger index 102 (Wenninger 1989), Coxeter index 81 (Coxeter et al. 1954), ...

The great dodecahemidodecahedron is the uniform polyhedron with Maeder index 70 (Maeder 1997), Wenninger index 107 (Wenninger 1989), Coxeter index 86 (Coxeter et al. 1954), ...

The great dodecicosahedron is the uniform polyhedron with Maeder index 63 (Maeder 1997), Wenninger index 101 (Wenninger 1989), Coxeter index 79 (Coxeter et al. 1954), and ...

The great icosicosidodecahedron, not to be confused with the great icosahedron or great icosidodecahedron, is the uniform polyhedron with Maeder index 48 (Maeder 1997), ...

The great icosihemidodecahedron is the uniform polyhedron with Maeder index 71 (Maeder 1997), Wenninger index 106 (Wenninger 1989), Coxeter index 85 (Coxeter et al. 1954), ...

In the field of functional analysis, the Krein-Milman theorem is a result which characterizes all (nonempty) compact convex subsets K of "sufficiently nice" topological ...