|
Rhombille Prismatic Honeycomb
In geometry, the rhombille tiling, also known as tumbling blocks, reversible cubes, or the dice lattice, is a tessellation of identical 60° rhombi on the Euclidean plane. Each rhombus has two 60° and two 120° angles; rhombi with this shape are sometimes also called diamonds. Sets of three rhombi meet at their 120° angles, and sets of six rhombi meet at their 60° angles. Properties The rhombille tiling can be seen as a subdivision of a hexagonal tiling with each hexagon divided into three rhombi meeting at the center point of the hexagon. This subdivision represents a regular compound tiling. It can also be seen as a subdivision of four hexagonal tilings with each hexagon divided into 12 rhombi. The diagonals of each rhomb are in the ratio 1:. This is the dual tiling of the trihexagonal tiling or kagome lattice. As the dual to a uniform tiling, it is one of eleven possible Laves tilings, and in the face configuration for monohedral tilings it is denoted .6.3.6 It is al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Laves Tiling
This table shows the 11 convex uniform tilings (regular and semiregular) of the Euclidean plane, and their dual tilings. There are three regular and eight semiregular tilings in the plane. The semiregular tilings form new tilings from their duals, each made from one type of irregular face. John Conway calls these uniform duals ''Catalan tilings'', in parallel to the Catalan solid polyhedra. Uniform tilings are listed by their vertex configuration, the sequence of faces that exist on each vertex. For example ''4.8.8'' means one square and two octagons on a vertex. These 11 uniform tilings have 32 different ''uniform colorings''. A uniform coloring allows identical sided polygons at a vertex to be colored differently, while still maintaining vertex-uniformity and transformational congruence between vertices. (Note: Some of the tiling images shown below are ''not'' color-uniform) In addition to the 11 convex uniform tilings, there are also 14 known nonconvex tilings, using sta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rhombi
In plane Euclidean geometry, a rhombus (plural rhombi or rhombuses) is a quadrilateral whose four sides all have the same length. Another name is equilateral quadrilateral, since equilateral means that all of its sides are equal in length. The rhombus is often called a "diamond", after the diamonds suit in playing cards which resembles the projection of an octahedral diamond, or a lozenge, though the former sometimes refers specifically to a rhombus with a 60° angle (which some authors call a calisson after the French sweet – also see Polyiamond), and the latter sometimes refers specifically to a rhombus with a 45° angle. Every rhombus is simple (non-self-intersecting), and is a special case of a parallelogram and a kite. A rhombus with right angles is a square. Etymology The word "rhombus" comes from grc, ῥόμβος, rhombos, meaning something that spins, which derives from the verb , romanized: , meaning "to turn round and round." The word was used both by Eucli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isometric Projection
Isometric projection is a method for visually representing three-dimensional objects in two dimensions in technical and engineering drawings. It is an axonometric projection in which the three coordinate axes appear equally foreshortened and the angle between any two of them is 120 degrees. Overview The term "isometric" comes from the Greek for "equal measure", reflecting that the scale along each axis of the projection is the same (unlike some other forms of graphical projection). An isometric view of an object can be obtained by choosing the viewing direction such that the angles between the projections of the ''x'', ''y'', and ''z'' axes are all the same, or 120°. For example, with a cube, this is done by first looking straight towards one face. Next, the cube is rotated ±45° about the vertical axis, followed by a rotation of approximately 35.264° (precisely arcsin or arctan , which is related to the Magic angle) about the horizontal axis. Note that with the cub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Cube
In graph theory, a partial cube is a graph that is isometric to a subgraph of a hypercube. In other words, a partial cube can be identified with a subgraph of a hypercube in such a way that the distance between any two vertices in the partial cube is the same as the distance between those vertices in the hypercube. Equivalently, a partial cube is a graph whose vertices can be labeled with bit strings of equal length in such a way that the distance between two vertices in the graph is equal to the Hamming distance between their labels. Such a labeling is called a ''Hamming labeling''; it represents an isometric embedding of the partial cube into a hypercube. History was the first to study isometric embeddings of graphs into hypercubes. The graphs that admit such embeddings were characterized by and , and were later named partial cubes. A separate line of research on the same structures, in the terminology of families of sets rather than of hypercube labelings of graphs, was foll ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unit Distance Graph
In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some non-adjacent pairs of vertices to be at distance one, they may also be called strict unit distance graphs or faithful unit distance graphs. As a hereditary family of graphs, they can be characterized by forbidden induced subgraphs. The unit distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict unit distance graphs. An unsolved problem of Paul Erdős asks how many edges a unit distance graph on n vertices can have. The best known lower bound is slightly above linear in n—far from the upper bound, proportional to n^. The number of colors required to color unit distance graphs is also unknown (t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Manhattan Distance
A taxicab geometry or a Manhattan geometry is a geometry whose usual distance function or Metric (mathematics), metric of Euclidean geometry is replaced by a new metric in which the distance between two points is the sum of the absolute differences of their Cartesian coordinates. The taxicab metric is also known as rectilinear distance, ''L''1 distance, ''L''1 distance or \ell_1 norm (see Lp space, ''Lp'' space), Snake (video game), snake distance, city block distance, Manhattan distance or Manhattan length. The latter names refer to the rectilinear street layout on the island of Manhattan, where the shortest path a taxi travels between two points is the sum of the absolute values of distances that it travels on avenues and on streets. The geometry has been used in regression analysis since the 18th century, and is often referred to as Lasso (statistics), LASSO. The geometric interpretation dates to non-Euclidean geometry of the 19th century and is due to Hermann Minkowski. In \mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integer Lattice
In mathematics, the -dimensional integer lattice (or cubic lattice), denoted , is the lattice in the Euclidean space whose lattice points are -tuples of integers. The two-dimensional integer lattice is also called the square lattice, or grid lattice. is the simplest example of a root lattice. The integer lattice is an odd unimodular lattice. Automorphism group The automorphism group (or group of congruences) of the integer lattice consists of all permutations and sign changes of the coordinates, and is of order 2''n'' ''n''!. As a matrix group it is given by the set of all ''n''×''n'' signed permutation matrices. This group is isomorphic to the semidirect product :(\mathbb Z_2)^n \rtimes S_n where the symmetric group ''S''''n'' acts on (Z2)''n'' by permutation (this is a classic example of a wreath product). For the square lattice, this is the group of the square, or the dihedral group of order 8; for the three-dimensional cubic lattice, we get the group of the cube, o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isohedral Tiling
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 self-du ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monohedral Tiling
A tessellation or tiling is the covering of a surface, often a plane (mathematics), plane, using one or more geometric shapes, called ''tiles'', with no overlaps and no gaps. In mathematics, tessellation can be generalized to high-dimensional spaces, 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. 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 a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Face Configuration
In geometry, a vertex configurationCrystallography of Quasicrystals: Concepts, Methods and Structures by Walter Steurer, Sofia Deloudi, (2009) pp. 18–20 and 51–53Physical Metallurgy: 3-Volume Set, Volume 1 edited by David E. Laughlin, (2014) pp. 16–20 is a shorthand notation for representing the of a or |
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] |
Kagome Lattice
In geometry, the trihexagonal tiling is one of 11 uniform tilings of the Euclidean plane by regular polygons. See in particular Theorem 2.1.3, p. 59 (classification of uniform tilings); Figure 2.1.5, p.63 (illustration of this tiling), Theorem 2.9.1, p. 103 (classification of colored tilings), Figure 2.9.2, p. 105 (illustration of colored tilings), Figure 2.5.3(d), p. 83 (topologically equivalent star tiling), and Exercise 4.1.3, p. 171 (topological equivalence of trihexagonal and two-triangle tilings). It consists of equilateral triangles and regular hexagons, arranged so that each hexagon is surrounded by triangles and vice versa. The name derives from the fact that it combines a regular hexagonal tiling and a regular triangular tiling. Two hexagons and two triangles alternate around each vertex, and its edges form an infinite arrangement of lines. Its dual is the rhombille tiling. This pattern, and its place in the classification of uniform tilings, was already known to Johann ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
