|
List Of Uniform Polyhedra
In geometry, a uniform polyhedron is a polyhedron 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 polyhedron has a high degree of reflectional and rotational symmetry. Uniform polyhedra can be divided between convex forms with convex regular polygon faces and star forms. Star forms have either regular star polygon faces or vertex figures or both. This list includes these: * all 75 nonprismatic uniform polyhedra; * a few representatives of the infinite sets of prisms and antiprisms; * one degenerate polyhedron, Skilling's figure with overlapping edges. It was proven in that there are only 75 uniform polyhedra other than the infinite families of prisms and antiprisms. John Skilling discovered an overlooked degenerate example, by relaxing the condition that only two faces may meet at an edge. This is a degenerate u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geometries ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Antiprism
In geometry, an antiprism or is a polyhedron composed of two parallel direct copies (not mirror images) of an polygon, connected by an alternating band of triangles. They are represented by the Conway notation . Antiprisms are a subclass of prismatoids, and are a (degenerate) type of snub polyhedron. Antiprisms are similar to prisms, except that the bases are twisted relatively to each other, and that the side faces (connecting the bases) are triangles, rather than quadrilaterals. The dual polyhedron of an -gonal antiprism is an -gonal trapezohedron. History At the intersection of modern-day graph theory and coding theory, the triangulation of a set of points have interested mathematicians since Isaac Newton, who fruitlessly sought a mathematical proof of the kissing number problem in 1694. The existence of antiprisms was discussed, and their name was coined by Johannes Kepler, though it is possible that they were previously known to Archimedes, as they satisfy the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Octahedral Symmetry
A regular octahedron has 24 rotational (or orientation-preserving) symmetries, and 48 symmetries altogether. These include transformations that combine a reflection and a rotation. A cube has the same set of symmetries, since it is the polyhedron that is dual polyhedron, dual to an octahedron. The group of orientation-preserving symmetries is ''S''4, the symmetric group or the group of permutations of four objects, since there is exactly one such symmetry for each permutation of the four diagonals of the cube. Details Chiral and full (or achiral) octahedral symmetry are the Point groups in three dimensions, discrete point symmetries (or equivalently, List of spherical symmetry groups, symmetries on the sphere) with the largest symmetry groups compatible with translational symmetry. They are among the Crystal system#Overview of point groups by crystal system, crystallographic point groups of the cubic crystal system. As the hyperoctahedral group of dimension 3 the full oct ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tetrahedral Symmetry
150px, A regular tetrahedron, an example of a solid with full tetrahedral symmetry A regular tetrahedron has 12 rotational (or orientation-preserving) symmetries, and a symmetry order of 24 including transformations that combine a reflection and a rotation. The group of all (not necessarily orientation preserving) symmetries is isomorphic to the group S4, the symmetric group of permutations of four objects, since there is exactly one such symmetry for each permutation of the vertices of the tetrahedron. The set of orientation-preserving symmetries forms a group referred to as the alternating subgroup A4 of S4. Details Chiral and full (or achiral tetrahedral symmetry and pyritohedral symmetry) are discrete point symmetries (or equivalently, symmetries on the sphere). They are among the crystallographic point groups of the cubic crystal system. Seen in stereographic projection the edges of the tetrakis hexahedron form 6 circles (or centrally radial lines) in the plane. Ea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedral Symmetry In Three Dimensions
In geometry, dihedral symmetry in three dimensions is one of three infinite sequences of point groups in three dimensions which have a symmetry group that as an abstract group is a dihedral group Dih''n'' (for ''n'' ≥ 2). Types There are 3 types of dihedral symmetry in three dimensions, each shown below in 3 notations: Schönflies notation, Coxeter notation, and orbifold notation. ;Chiral: *''Dn'', 'n'',2sup>+, (22''n'') of order 2''n'' – dihedral symmetry or para-n-gonal group (abstract group: ''Dihn''). ;Achiral: *''Dnh'', 'n'',2 (*22''n'') of order 4''n'' – prismatic symmetry or full ortho-n-gonal group (abstract group: ''Dihn'' × ''Z''2). *''Dnd'' (or ''Dnv''), ''n'',2+ (2*''n'') of order 4''n'' – antiprismatic symmetry or full gyro-n-gonal group (abstract group: ''Dih''2''n''). For a given ''n'', all three have ''n''-fold rotational symmetry about one axis (rotation by an angle of 360°/''n'' does not change the object), and 2-fold rotational symmetr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polyhedron
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
4-polytopes
In geometry, a 4-polytope (sometimes also called a polychoron, polycell, or polyhedroid) is a four-dimensional polytope. It is a connected and closed figure, composed of lower-dimensional polytopal elements: vertices, edges, faces (polygons), and cells (polyhedra). Each face is shared by exactly two cells. The 4-polytopes were discovered by the Swiss mathematician Ludwig Schläfli before 1853. The two-dimensional analogue of a 4-polytope is a polygon, and the three-dimensional analogue is a polyhedron. Topologically 4-polytopes are closely related to the uniform honeycombs, such as the cubic honeycomb, which tessellate 3-space; similarly the 3D cube is related to the infinite 2D square tiling. Convex 4-polytopes can be ''cut and unfolded'' as nets in 3-space. Definition A 4-polytope is a closed four-dimensional figure. It comprises vertices (corner points), edges, faces and cells. A cell is the three-dimensional analogue of a face, and is therefore a polyhedron. Each face ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polygons
In geometry, a polygon () is a plane figure that is described by a finite number of straight line segments connected to form a closed ''polygonal chain'' (or ''polygonal circuit''). The bounded plane region, the bounding circuit, or the two together, may be called a polygon. The segments of a polygonal circuit are called its '' edges'' or ''sides''. The points where two edges meet are the polygon's '' vertices'' (singular: vertex) or ''corners''. The interior of a solid polygon is sometimes called its ''body''. An ''n''-gon is a polygon with ''n'' sides; for example, a triangle is a 3-gon. A simple polygon is one which does not intersect itself. Mathematicians are often concerned only with the bounding polygonal chains of simple polygons and they often define a polygon accordingly. A polygonal boundary may be allowed to cross over itself, creating star polygons and other self-intersecting polygons. A polygon is a 2-dimensional example of the more general polytope in any number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 tilings can be identified by their vertex configuration, a sequence of numbers representing the number of sides of the polygons around each vertex. For example, 7.7.7 represents the heptagonal tiling which has 3 heptagons around each vertex. It is also regular since all the polygons are the same size, so it can also be given the Schläfli symbol . Uniform tilings may be regular (if also face- and edge-transitive), quasi-regular (if edge-transitive but not face-transitive) or semi-regular (if neither edge- nor face-transitive). For ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Tiling
In geometry, a uniform tiling is a tessellation of the plane by regular polygon faces with the restriction of being vertex-transitive. Uniform tilings can exist in both the Euclidean plane and hyperbolic plane. Uniform tilings are related to the finite uniform polyhedra which can be considered uniform tilings of the sphere. Most uniform tilings can be made from a Wythoff construction starting with a symmetry group and a singular generator point inside of the fundamental domain. A planar symmetry group has a polygonal fundamental domain and can be represented by the group name represented by the order of the mirrors in sequential vertices. A fundamental domain triangle is (''p'' ''q'' ''r''), and a right triangle (''p'' ''q'' 2), where ''p'', ''q'', ''r'' are whole numbers greater than 1. The triangle may exist as a spherical triangle, a Euclidean plane triangle, or a hyperbolic plane triangle, depending on the values of ''p'', ''q'' and ''r''. There are a number of symbolic sc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Tilings Of Regular Polygons
Euclidean plane tilings by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Kepler in his '' Harmonices Mundi'' ( Latin: ''The Harmony of the World'', 1619). Notation of Euclidean tilings Euclidean tilings are usually named after Cundy & Rollett’s notation. This notation represents (i) the number of vertices, (ii) the number of polygons around each vertex (arranged clockwise) and (iii) the number of sides to each of those polygons. For example: 36; 36; 34.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a ‘3-uniform (2-vertex types)’ tiling. Broken down, 36; 36 (both of different transitivity class), or (36)2, tells us that there are 2 vertices (denoted by the superscript 2), each with 6 equilateral 3-sided polygons (triangles). With a final vertex 34.6, 4 more contiguous equilateral triangles and a single regular hexagon. However, this notation has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coxeter
Harold Scott MacDonald "Donald" Coxeter, (9 February 1907 – 31 March 2003) was a British and later also Canadian geometer. He is regarded as one of the greatest geometers of the 20th century. Biography Coxeter was born in Kensington to Harold Samuel Coxeter and Lucy (). His father had taken over the family business of Coxeter & Son, manufacturers of surgical instruments and compressed gases (including a mechanism for anaesthetising surgical patients with nitrous oxide), but was able to retire early and focus on sculpting and baritone singing; Lucy Coxeter was a portrait and landscape painter who had attended the Royal Academy of Arts. A maternal cousin was the architect Sir Giles Gilbert Scott. In his youth, Coxeter composed music and was an accomplished pianist at the age of 10. Roberts, Siobhan, ''King of Infinite Space: Donald Coxeter, The Man Who Saved Geometry'', Walker & Company, 2006, He felt that mathematics and music were intimately related, outlining his ide ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
