Concept

Quasiregular polyhedron

Related concepts (33)
Uniform tilings in hyperbolic plane
In hyperbolic geometry, a uniform hyperbolic tiling (or regular, quasiregular or semiregular hyperbolic tiling) is an edge-to-edge filling of the hyperbolic plane which has regular polygons as faces and is vertex-transitive (transitive on its vertices, isogonal, i.e. there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent, and the tiling has a high degree of rotational and translational symmetry.
Uniform polyhedron
In geometry, a uniform polyhedron has regular polygons as faces and is vertex-transitive (i.e., there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent. Uniform polyhedra may be regular (if also face- and edge-transitive), quasi-regular (if also edge-transitive but not face-transitive), or semi-regular (if neither edge- nor face-transitive). The faces and vertices need not be convex, so many of the uniform polyhedra are also star polyhedra.
Small ditrigonal icosidodecahedron
In geometry, the small ditrigonal icosidodecahedron (or small ditrigonary icosidodecahedron) is a nonconvex uniform polyhedron, indexed as U30. It has 32 faces (20 triangles and 12 pentagrams), 60 edges, and 20 vertices. It has extended Schläfli symbol a{5,3}, as an altered dodecahedron, and Coxeter diagram or . It is constructed from Schwarz triangle (3 3 ) with Wythoff symbol 3 | 3. Its hexagonal vertex figure alternates equilateral triangle and pentagram faces. Its convex hull is a regular dodecahedron.
Truncation (geometry)
In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new facet in place of each vertex. The term originates from Kepler's names for the Archimedean solids. In general any polyhedron (or polytope) can also be truncated with a degree of freedom as to how deep the cut is, as shown in Conway polyhedron notation truncation operation. A special kind of truncation, usually implied, is a uniform truncation, a truncation operator applied to a regular polyhedron (or regular polytope) which creates a resulting uniform polyhedron (uniform polytope) with equal edge lengths.
Isotoxal figure
In geometry, a polytope (for example, a polygon or a polyhedron) or a tiling is isotoxal () or edge-transitive if its symmetries act transitively on its edges. Informally, this means that there is only one type of edge to the object: given two edges, there is a translation, rotation, and/or reflection that will move one edge to the other while leaving the region occupied by the object unchanged. An isotoxal polygon is an even-sided i.e. equilateral polygon, but not all equilateral polygons are isotoxal.
Faceting
Stella octangula as a faceting of the cube In geometry, faceting (also spelled facetting) is the process of removing parts of a polygon, polyhedron or polytope, without creating any new vertices. New edges of a faceted polyhedron may be created along face diagonals or internal space diagonals. A faceted polyhedron will have two faces on each edge and creates new polyhedra or compounds of polyhedra. Faceting is the reciprocal or dual process to stellation. For every stellation of some convex polytope, there exists a dual faceting of the dual polytope.
Complex polytope
In geometry, a complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A complex polytope may be understood as a collection of complex points, lines, planes, and so on, where every point is the junction of multiple lines, every line of multiple planes, and so on. Precise definitions exist only for the regular complex polytopes, which are configurations.
Star polyhedron
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.
Great ditrigonal icosidodecahedron
In geometry, the great ditrigonal icosidodecahedron (or great ditrigonary icosidodecahedron) is a nonconvex uniform polyhedron, indexed as U47. It has 32 faces (20 triangles and 12 pentagons), 60 edges, and 20 vertices. It has 4 Schwarz triangle equivalent constructions, for example Wythoff symbol 3 | 3 gives Coxeter diagram = . It has extended Schläfli symbol a{,3} or c{3,}, as an altered great stellated dodecahedron or converted great icosahedron. Its circumradius is times the length of its edge, a value it shares with the cube.
Small dodecahemidodecahedron
In geometry, the small dodecahemidodecahedron is a nonconvex uniform polyhedron, indexed as U_51. It has 18 faces (12 pentagons and 6 decagons), 60 edges, and 30 vertices. Its vertex figure alternates two regular pentagons and decagons as a crossed quadrilateral. It is a hemipolyhedron with six decagonal faces passing through the model center. It shares its edge arrangement with the icosidodecahedron (its convex hull, having the pentagonal faces in common), and with the small icosihemidodecahedron (having the decagonal faces in common).

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.