|
Anisohedral Tiling
In geometry, a shape is said to be anisohedral if it admits a tiling, but no such tiling is isohedral (tile-transitive); that is, in any tiling by that shape there are two tiles that are not equivalent under any symmetry of the tiling. A tiling by an anisohedral tile is referred to as an anisohedral tiling. Existence The first part of Hilbert's eighteenth problem asked whether there exists an anisohedral polyhedron in Euclidean 3-space; Grünbaum and Shephard suggestGrünbaum and Shephard, section 9.6 that Hilbert was assuming that no such tile existed in the plane. Reinhardt answered Hilbert's problem in 1928 by finding examples of such polyhedra, and asserted that his proof that no such tiles exist in the plane would appear soon. However, Heesch then gave an example of an anisohedral tile in the plane in 1935. Convex tiles Reinhardt had previously considered the question of anisohedral convex polygons, showing that there were no anisohedral convex hexagons but being unable ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heesch Anisohedral Tiling
Heesch can refer to: * Heesch, Netherlands, a town in the Bernheze municipality * Heinrich Heesch Heinrich Heesch (June 25, 1906 – July 26, 1995) was a German mathematician. He was born in Kiel and died in Hanover. In Göttingen, he worked on Group theory. In 1933, Heesch witnessed the National Socialist purges of university staff. Not ... (1906–1995), German mathematician * Heesch's problem in mathematics {{Disambig, surname Surnames of German origin ... [...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] |
Tessellation
A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called ''tiles'', with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries. A periodic tiling has a repeating pattern. Some special kinds include '' regular tilings'' with regular polygonal tiles all of the same shape, and '' semiregular tilings'' with regular tiles of more than one shape and with every corner identically arranged. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups. A tiling that lacks a repeating pattern is called "non-periodic". An '' aperiodic tiling'' uses a small set of tile shapes that cannot form a repeating pattern (an aperiodic set of prototiles). A '' tessellation of space'', also known as a space filling or honeycomb, can be defined in the geometry of higher dimensions. A real physical tessellation is a tiling made of materials such as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isohedral
In geometry, a tessellation of dimension (a plane tiling) or higher, or a polytope of dimension (a polyhedron) or higher, is isohedral or face-transitive if all its faces are the same. More specifically, all faces must be not merely congruent but must be ''transitive'', i.e. must lie within the same '' symmetry orbit''. In other words, for any two faces and , there must be a symmetry of the ''entire'' figure by translations, rotations, and/or reflections that maps onto . For this reason, convex isohedral polyhedra are the shapes that will make fair dice. Isohedral polyhedra are called isohedra. They can be described by their face configuration. An isohedron has an even number of faces. The dual of an isohedral polyhedron is vertex-transitive, i.e. isogonal. The Catalan solids, the bipyramids, and the trapezohedra are all isohedral. They are the duals of the (isogonal) Archimedean solids, prisms, and antiprisms, respectively. The Platonic solids, which are either sel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hilbert's Eighteenth Problem
Hilbert's eighteenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by mathematician David Hilbert. It asks three separate questions about lattices and sphere packing in Euclidean space. Symmetry groups in dimensions The first part of the problem asks whether there are only finitely many essentially different space groups in n-dimensional Euclidean space. This was answered affirmatively by Bieberbach. Anisohedral tiling in 3 dimensions The second part of the problem asks whether there exists a polyhedron which tiles 3-dimensional Euclidean space but is not the fundamental region of any space group; that is, which tiles but does not admit an isohedral (tile- transitive) tiling. Such tiles are now known as anisohedral. In asking the problem in three dimensions, Hilbert was probably assuming that no such tile exists in two dimensions; this assumption later turned out to be incorrect. The first such tile in three dimensions was found b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean 3-space
In geometry, a three-dimensional space (3D space, 3-space or, rarely, tri-dimensional space) is a mathematical space in which three values (''coordinates'') are required to determine the position of a point. Most commonly, it is the three-dimensional Euclidean space, that is, the Euclidean space of dimension three, which models physical space. More general three-dimensional spaces are called ''3-manifolds''. The term may also refer colloquially to a subset of space, a ''three-dimensional region'' (or 3D domain), a ''solid figure''. Technically, a tuple of numbers can be understood as the Cartesian coordinates of a location in a -dimensional Euclidean space. The set of these -tuples is commonly denoted \R^n, and can be identified to the pair formed by a -dimensional Euclidean space and a Cartesian coordinate system. When , this space is called the three-dimensional Euclidean space (or simply "Euclidean space" when the context is clear). In classical physics, it serves as a m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heinrich Heesch
Heinrich Heesch (June 25, 1906 – July 26, 1995) was a German mathematician. He was born in Kiel and died in Hanover. In Göttingen, he worked on Group theory. In 1933, Heesch witnessed the National Socialist purges of university staff. Not willing to become a member of the National Socialist organization of university teachers as required, he resigned from his university position in 1935 and worked privately at his parents' home in Kiel until 1948. During this time, he did research on tilings. In 1955, Heesch began teaching at Leibniz University Hannover and worked on graph theory. In this period, Heesch did pioneering work in developing methods for a computer-aided proof of the then unproved four color theorem. In particular, he was the first to investigate the notion of "discharging", which turned out to be a fundamental ingredient of the eventual computer-aided proof by Kenneth Appel and Wolfgang Haken. Between 1967 and 1971, Heesch made several visits to the United ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polygon
In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon. In particular, it is a simple polygon (not self-intersecting). Equivalently, a polygon is convex if every line that does not contain any edge intersects the polygon in at most two points. Strictly convex polygon A convex polygon is ''strictly'' convex if no line contains more than two vertices of the polygon. In a convex polygon, all interior angles are less than ''or equal'' to 180 degrees, while in a strictly convex polygon all interior angles are strictly less than 180 degrees. Properties The following properties of a simple polygon are all equivalent to convexity: *Every internal angle is less than or equal to 180 degrees. *Every point on every line segment between two points inside or on the boundary of the polygon remains inside or on the bou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hexagon
In geometry, a hexagon (from Greek , , meaning "six", and , , meaning "corner, angle") is a six-sided polygon. The total of the internal angles of any simple (non-self-intersecting) hexagon is 720°. Regular hexagon A regular hexagon is defined as a hexagon that is both equilateral and equiangular. In other words, a hexagon is said to be regular if the edges are all equal in length, and each of its internal angle is equal to 120°. The Schläfli symbol denotes this polygon as \ . However, the regular hexagon can also be considered as the cutting off the vertices of an equilateral triangle, which can also be denoted as \mathrm\ . A regular hexagon is bicentric, meaning that it is both cyclic (has a circumscribed circle) and tangential (has an inscribed circle). The common length of the sides equals the radius of the circumscribed circle or circumcircle, which equals \tfrac times the apothem (radius of the inscribed circle). Measurement The longest diagonals of a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pentagon
In geometry, a pentagon () is any five-sided polygon or 5-gon. The sum of the internal angles in a simple polygon, simple pentagon is 540°. A pentagon may be simple or list of self-intersecting polygons, self-intersecting. A self-intersecting ''regular pentagon'' (or ''star polygon, star pentagon'') is called a pentagram. Regular pentagons A ''regular polygon, regular pentagon'' has Schläfli symbol and interior angles of 108°. A ''regular polygon, regular pentagon'' has five lines of reflectional symmetry, and rotational symmetry of order 5 (through 72°, 144°, 216° and 288°). The diagonals of a convex polygon, convex regular pentagon are in the golden ratio to its sides. Given its side length t, its height H (distance from one side to the opposite vertex), width W (distance between two farthest separated points, which equals the diagonal length D) and circumradius R are given by: :\begin H &= \frac~t \approx 1.539~t, \\ W= D &= \frac~t\approx 1.618~t, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pentagon Tiling
In geometry, a pentagonal tiling is a tiling of the plane where each individual piece is in the shape of a pentagon. A regular tiling, regular pentagonal tiling on the Euclidean plane is impossible because the internal angle of a Pentagon#Regular pentagons, regular pentagon, 108°, is not a divisor of 360°, the angle measure of a whole turn (geometry), turn. However, regular pentagons can tile the hyperbolic plane with Order-4 pentagonal tiling, four pentagons around each vertex (Order-5 pentagonal tiling, or more) and sphere with Spherical dodecahedron, three pentagons; the latter produces a tiling that is topologically equivalent to the regular dodecahedron, dodecahedron. Monohedral convex pentagonal tilings Fifteen types of convex pentagons are known to tile the plane monohedral tiling, monohedrally (i.e., with one type of tile). The most recent one was discovered in 2015. This list has been shown to be complete by (result subject to peer-review). showed that there are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Group
In mathematics, a Euclidean group is the group of (Euclidean) isometries of a Euclidean space \mathbb^n; that is, the transformations of that space that preserve the Euclidean distance between any two points (also called Euclidean transformations). The group depends only on the dimension ''n'' of the space, and is commonly denoted E(''n'') or ISO(''n''), for ''inhomogeneous special orthogonal'' group. The Euclidean group E(''n'') comprises all translations, rotations, and reflections of \mathbb^n; and arbitrary finite combinations of them. The Euclidean group can be seen as the symmetry group of the space itself, and contains the group of symmetries of any figure (subset) of that space. A Euclidean isometry can be ''direct'' or ''indirect'', depending on whether it preserves the handedness of figures. The direct Euclidean isometries form a subgroup, the special Euclidean group, often denoted SE(''n'') and E+(''n''), whose elements are called rigid motions or Euclidean ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
