In geometry, a uniform star polyhedron is a self-intersecting uniform polyhedron. They are also sometimes called nonconvex polyhedra to imply self-intersecting. Each polyhedron can contain either star polygon faces, star polygon vertex figures, or both.
The complete set of 57 nonprismatic uniform star polyhedra includes the 4 regular ones, called the Kepler–Poinsot polyhedra, 5 quasiregular ones, and 48 semiregular ones.
There are also two infinite sets of uniform star prisms and uniform star antiprisms.
Just as (nondegenerate) star polygons (which have polygon density greater than 1) correspond to circular polygons with overlapping tiles, star polyhedra that do not pass through the center have polytope density greater than 1, and correspond to spherical polyhedra with overlapping tiles; there are 47 nonprismatic such uniform star polyhedra. The remaining 10 nonprismatic uniform star polyhedra, those that pass through the center, are the hemipolyhedra as well as Miller's monster, and do not have well-defined densities.
The nonconvex forms are constructed from Schwarz triangles.
All the uniform polyhedra are listed below by their symmetry groups and subgrouped by their vertex arrangements.
Regular polyhedra are labeled by their Schläfli symbol. Other nonregular uniform polyhedra are listed with their vertex configuration.
An additional figure, the pseudo great rhombicuboctahedron, is usually not included as a truly uniform star polytope, despite consisting of regular faces and having the same vertices.
Note: For nonconvex forms below an additional descriptor nonuniform is used when the convex hull vertex arrangement has same topology as one of these, but has nonregular faces. For example an nonuniform cantellated form may have rectangles created in place of the edges rather than squares.
See Prismatic uniform polyhedron.
There is one nonconvex form, the tetrahemihexahedron which has tetrahedral symmetry (with fundamental domain Möbius triangle (3 3 2)).
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer s
You will learn about the bonding and structure of several important families of solid state materials. You will gain insight into common synthetic and characterization methods and learn about the appl
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept
In geometry, a hemipolyhedron is a uniform star polyhedron some of whose faces pass through its center. These "hemi" faces lie parallel to the faces of some other symmetrical polyhedron, and their count is half the number of faces of that other polyhedron – hence the "hemi" prefix. The prefix "hemi" is also used to refer to certain projective polyhedra, such as the hemi-cube, which are the image of a 2 to 1 map of a spherical polyhedron with central symmetry.
Cette liste recense les polyèdres uniformes, ainsi que certaines de leurs propriétés. page connexe : Polyèdre régulier Un polyèdre uniforme est un polyèdre dont les faces sont des polygones réguliers et qui est isogonal (c'est-à-dire que pour tout couple de ses sommets, il existe une isométrie du polyèdre qui transforme l'un en l'autre).
En géométrie, le tétrahémihexaèdre, appelé aussi heptaèdre de Reinhardt (du nom de Curt Reinhardt, qui l'a inventé en 1885) est un polyèdre uniforme non convexe, indexé sous le nom U4. Il a 6 sommets, 12 arêtes, et 7 faces : 4 triangulaires (qui font partie de celles de l'octaèdre régulier) et 3 carrées. C'est le seul polyèdre uniforme non prismatique avec un nombre impair de faces. Il est le seul polyèdre uniforme avec une caractéristique d'Euler égale à 1 et est par conséquent une représentation du plan projectif réel très similaire à la surface romaine.
A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust met ...
We derive a new upper bound on the diameter of a polyhedron , where . The bound is polynomial in and the largest absolute value of a sub-determinant of , denoted by . More precisely, we show that the diameter of is bounded by . If is bounded, then we show ...
We develop an analytical model to predict equilibrium shapes of two-component heterogeneous vesicles or capsules. Using a free energy functional including the bending energies of the two components and line tension contributions, the model describes shape ...