In geometry, a star polyhedron is a polyhedron which has some repetitive quality of nonconvexity giving it a star-like visual quality.
There are two general kinds of star polyhedron:
Polyhedra which self-intersect in a repetitive way.
Concave polyhedra of a particular kind which alternate convex and concave or saddle vertices in a repetitive way. Mathematically these figures are examples of star domains.
Mathematical studies of star polyhedra are usually concerned with regular, uniform polyhedra, or the duals of the uniform polyhedra. All these stars are of the self-intersecting kind.
The regular star polyhedra are self-intersecting polyhedra. They may either have self-intersecting faces, or self-intersecting vertex figures.
There are four regular star polyhedra, known as the Kepler–Poinsot polyhedra. The Schläfli symbol {p,q} implies faces with p sides, and vertex figures with q sides. Two of them have pentagrammic {5/2} faces and two have pentagrammic vertex figures.
These images show each form with a single face colored yellow to show the visible portion of that face.
There are also an infinite number of regular star dihedra and hosohedra {2,p/q} and {p/q,2} for any star polygon {p/q}. While degenerate in Euclidean space, they can be realised spherically in nondegenerate form.
There are many uniform star polyhedra including two infinite series, of prisms and of antiprisms, and their duals.
The uniform and dual uniform star polyhedra are also self-intersecting polyhedra. They may either have self-intersecting faces, or self-intersecting vertex figures or both.
The uniform star polyhedra have regular faces or regular star polygon faces. The dual uniform star polyhedra have regular faces or regular star polygon vertex figures.
Beyond the forms above, there are unlimited classes of self-intersecting (star) polyhedra.
Two important classes are the stellations of convex polyhedra and their duals, the facettings of the dual polyhedra.
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.
In mathematics, a regular 4-polytope is a regular four-dimensional polytope. They are the four-dimensional analogues of the regular polyhedra in three dimensions and the regular polygons in two dimensions. There are six convex and ten star regular 4-polytopes, giving a total of sixteen. The convex regular 4-polytopes were first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. He discovered that there are precisely six such figures.
En géométrie, un polyèdre uniforme non convexe, ou polyèdre étoilé uniforme, est un polyèdre uniforme auto-coupant. Il peut contenir soit des faces polygonales non convexes, des figures de sommet non convexes ou les deux. Dans l'ensemble complet des 53 polyèdres étoilés uniformes non prismatiques, il y a les 4 réguliers, appelés les solides de Kepler-Poinsot. Il existe aussi deux ensembles infinis de prismes étoilés uniformes et des antiprismes étoilés uniformes. Ici, nous voyons deux exemples de polyèdres
In geometry, the density of a star polyhedron is a generalization of the concept of winding number from two dimensions to higher dimensions, representing the number of windings of the polyhedron around the center of symmetry of the polyhedron. It can be determined by passing a ray from the center to infinity, passing only through the facets of the polytope and not through any lower dimensional features, and counting how many facets it passes through.
Repetition of the basic concepts of quantum mechanics and main numerical algorithms used for practical implementions. Basic principles of electronic structure methods:Hartree-Fock, many body perturbat
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
Explore la solution de l'équation de Schrdinger pour les systèmes à plusieurs électrons en utilisant des ensembles de base et le concept de fonctions de base.
A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. An old conjecture states that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n). Fox and Pach showed that every k-quasi-pla ...
Nanocatalyst-by-design promises to empower the next generation of electrodes for energy devices. However, current numerical methods consider individual and often geometrical closed-shell nanoparticles, neglecting how the coexistence of several and structur ...
AMER CHEMICAL SOC2020
, ,
Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale u ...
Institute of Electrical and Electronics Engineers2015