|
Omnitruncated
In geometry, an omnitruncation of a convex polytope is a simple polytope of the same dimension, having a vertex for each Flag (geometry), flag of the original polytope and a Facet (geometry), facet for each face of any dimension of the original polytope. Omnitruncation is the Dual polyhedron, dual operation to barycentric subdivision. Because the barycentric subdivision of any polytope can be realized as another polytope, the same is true for the omnitruncation of any polytope. When omnitruncation is applied to a regular polytope (or Honeycomb (geometry), honeycomb) it can be described geometrically as a Wythoff construction that creates a maximum number of Facet (geometry), facets. It is represented in a Coxeter–Dynkin diagram with all nodes ringed. It is a ''shortcut'' term which has a different meaning in progressively-higher-dimensional polytopes: * Uniform polytope#Truncation operators, Uniform polytope truncation operators ** For regular polygons: Truncation (geometry), An ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 5-polytope
In geometry, a uniform 5-polytope is a five-dimensional uniform polytope. By definition, a uniform 5-polytope is vertex-transitive and constructed from uniform 4-polytope Facet (geometry), facets. The complete set of convex uniform 5-polytopes has not been determined, but many can be made as Wythoff constructions from a small set of Coxeter groups, symmetry groups. These construction operations are represented by the permutations of rings of the Coxeter diagrams. History of discovery *Regular polytopes: (convex faces) **1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 3 regular polytopes in 5 or more dimensions. *Convex semiregular polytopes: (Various definitions before Coxeter's uniform category) **1900: Thorold Gosset enumerated the list of nonprismatic semiregular convex polytopes with regular facets (convex regular 4-polytopes) in his publication ''On the Regular and Semi-Regular Figures in Space of n Dimension ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Polyhedron
In geometry, a uniform polyhedron has regular polygons as Face (geometry), faces and is vertex-transitive—there is an isometry mapping any vertex onto any other. It follows that all vertices are congruence (geometry), congruent. Uniform polyhedra may be Regular polyhedron, regular (if also Isohedral figure, face- and Isotoxal figure, edge-transitive), Quasiregular polyhedron, quasi-regular (if also edge-transitive but not face-transitive), or Semiregular polyhedron, semi-regular (if neither edge- nor face-transitive). The faces and vertices don't need to be Convex polyhedron, convex, so many of the uniform polyhedra are also Star polyhedron, star polyhedra. There are two infinite classes of uniform polyhedra, together with 75 other polyhedra. They are 2 infinite classes of Prism (geometry), prisms and antiprisms, the convex polyhedrons as in 5 Platonic solids and 13 Archimedean solids—2 Quasiregular polyhedron, quasiregular and 11 Semiregular polyhedron, semiregular&m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 4-polytope
In geometry, a uniform 4-polytope (or uniform polychoron) is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedron, uniform polyhedra, and faces are regular polygons. There are 47 non-Prism (geometry), prismatic Convex polytope, convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the convex uniform polyhedra. There are also an unknown number of non-convex star forms. History of discovery * Convex Regular polytopes: ** 1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 6 regular polytopes in 4 dimensions and only 3 in 5 or more dimensions. * Schläfli-Hess polychoron, Regular star 4-polytopes (star polyhedron cells and/or vertex figures) ** 1852: Ludwig Schläfli also found 4 of the 10 regular star 4-polytopes, discounting 6 with cells or vertex figures small stellated dodecahedron, and great dodecahedron, . ** ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Omnitruncated Polyhedron
In geometry, an Omnitruncation, omnitruncated polyhedron is a truncation (geometry), truncated quasiregular polyhedron. When they are Alternation (geometry), alternated, they produce the snub polyhedron, snub polyhedra. All omnitruncated polyhedra are considered as zonohedron, zonohedra. They have Wythoff symbol ''p q r , '' and vertex figures as ''2p.2q.2r''. More generally, an omnitruncated polyhedron is a bevel operator in Conway polyhedron notation. List of convex omnitruncated polyhedra There are three Convex polytope, convex forms. These forms can be seen as red faces of one regular polyhedron, yellow or green faces of the dual polyhedron, and blue faces at the truncated vertices of the quasiregular polyhedron. List of nonconvex omnitruncated polyhedra There are 5 nonconvex uniform polyhedron, nonconvex uniform omnitruncated polyhedra. Other even-sided nonconvex polyhedra There are 8 nonconvex forms with mixed Wythoff symbols ''p q (r s) , '', a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sterication
In geometry, a uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform Facet (mathematics), facets. Here, "vertex-transitive" means that it has symmetries taking every vertex to every other vertex; the same must also be true within each lower-dimensional face of the polytope. In two dimensions (and for two-dimensional faces of higher-dimensional polytopes) a stronger definition is used: only the regular polygons are considered as uniform, disallowing polygons that alternate between two different lengths of edges. This is a generalization of the older category of semiregular polytope, ''semiregular'' polytopes, but also includes the regular polytopes. Further, star regular faces and vertex figures (star polygons) are allowed, which greatly expand the possible solutions. A strict definition requires uniform polytopes to be finite, while a more expansive definition allows uniform honeycombs (2-dimensional uniform tiling, tilings and higher di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a ''List of geometers, geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point (geometry), point, line (geometry), line, plane (geometry), plane, distance, angle, surface (mathematics), surface, and curve, as fundamental concepts. Originally developed to model the physical world, geometry has applications in almost all sciences, and also in art, architecture, and other activities that are related to graphics. Geometry also has applications in areas of mathematics that are apparently unrelated. For example, methods of algebraic geometry are fundamental in Wiles's proof of Fermat's Last Theorem, Wiles's proof of Fermat's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedra
In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal faces, straight edges and sharp corners or vertices. The term "polyhedron" may refer either to a solid figure or to its boundary surface. The terms solid polyhedron and polyhedral surface are commonly used to distinguish the two concepts. Also, the term ''polyhedron'' is often used to refer implicitly to the whole structure formed by a solid polyhedron, its polyhedral surface, its faces, its edges, and its vertices. There are many definitions of polyhedron. Nevertheless, the polyhedron is typically understood as a generalization of a two-dimensional polygon and a three-dimensional specialization of a polytope, a more general concept in any number of dimensions. Polyhedra have several general characteristics that include the number of faces, topological classification by Euler characteristic, duality, vertex figures, surface area, volume, interior lines, Dehn invari ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Norman Johnson (mathematician)
Norman Woodason Johnson (November 12, 1930 – July 13, 2017) was an American mathematician at Wheaton College, Norton, Massachusetts. Early life and education Norman Johnson was born on in Chicago. His father had a bookstore and published a local newspaper. Johnson earned his undergraduate mathematics degree in 1953 at Carleton College in Northfield, Minnesota followed by a master's degree from the University of Pittsburgh. After graduating in 1953, Johnson did alternative civilian service as a conscientious objector. He earned his PhD from the University of Toronto in 1966 with a dissertation title of ''The Theory of Uniform Polytopes and Honeycombs'' under the supervision of H. S. M. Coxeter. From there, he accepted a position in the Mathematics Department of Wheaton College in Massachusetts and taught until his retirement in 1998. Career In 1966, he enumerated 92 convex non-uniform polyhedra with regular faces. Victor Zalgaller later proved (1969) that Johnson's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polytopes (book)
''Regular Polytopes'' is a geometry book on regular polytopes written by Harold Scott MacDonald Coxeter. It was originally published by Methuen in 1947 and by Pitman Publishing in 1948, with a second edition published by Macmillan in 1963 and a third edition by Dover Publications in 1973. The Basic Library List Committee of the Mathematical Association of America has recommended that it be included in undergraduate mathematics libraries. Overview The main topics of the book are the Platonic solids (regular convex polyhedra), related polyhedra, and their higher-dimensional generalizations. It has 14 chapters, along with multiple appendices, providing a more complete treatment of the subject than any earlier work, and incorporating material from 18 of Coxeter's own previous papers. It includes many figures (both photographs of models by Paul Donchian and drawings), tables of numerical values, and historical remarks on the subject. The first chapter discusses regular polygons, regula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coxeter
Harold Scott MacDonald "Donald" Coxeter (9 February 1907 – 31 March 2003) was a British-Canadian geometer and mathematician. He is regarded as one of the greatest geometers of the 20th century. Coxeter was born in England and educated at the University of Cambridge, with student visits to Princeton University. He worked for 60 years at the University of Toronto in Canada, from 1936 until his retirement in 1996, becoming a full professor there in 1948. His many honours included membership in the Royal Society of Canada, the Royal Society, and the Order of Canada. He was an author of 12 books, including ''The Fifty-Nine Icosahedra'' (1938) and ''Regular Polytopes'' (1947). Many concepts in geometry and group theory are named after him, including the Coxeter graph, Coxeter groups, Coxeter's loxodromic sequence of tangent circles, Coxeter–Dynkin diagrams, and the Todd–Coxeter algorithm. Biography Coxeter was born in Kensington, England, to Harold Samuel Coxeter an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
