|
Isotoxal
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. Isotoxal polygons An isotoxal polygon is an even-sided i.e. equilateral polygon, but not all equilateral polygons are isotoxal. The duals of isotoxal polygons are isogonal polygons. Isotoxal 4n-gons are centrally symmetric, thus are also zonogons. In general, a (non-regular) isotoxal 2n-gon has \mathrm_n, (^*nn) dihedral symmetry. For example, a (non-square) rhombus is an isotoxal "2×2-gon" (quadrilateral) with \mathrm_2, (^*22) symmetry. All regular -gons (also with odd n) are isotoxal, having double the minimum symmetry order: a regular n-gon has \mathrm_n, (^*nn) dihedral ... [...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; these 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 its group notation: the sequence of the reflection orders of the fundamental domain vertices. A fundamental domain triangle is denoted (''p q r''), where ''p'', ''q'', ''r'' are whole numbers > 1, i.e. ≥ 2; a fundamental domain right triangle is denoted (''p q'' 2). The triangle may exist as a spherical triangle, a Euclidean plane triangle, or a hyperbolic plane triangle, depending on the values of ''p'', ''q'', ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Star Polygon
In geometry, a star polygon is a type of non-convex polygon. Regular star polygons have been studied in depth; while star polygons in general appear not to have been formally defined, Decagram (geometry)#Related figures, certain notable ones can arise through truncation operations on regular simple or star polygons. Branko Grünbaum identified two primary usages of this terminology by Johannes Kepler, one corresponding to the regular star polygons with List of self-intersecting polygons, intersecting edges that do not generate new vertices, and the other one to the isotoxal Concave polygon, concave simple polygons.Grünbaum & Shephard (1987). Tilings and Patterns. Section 2.5 Polygram (geometry), Polygrams include polygons like the pentagram, but also compound figures like the hexagram. One definition of a ''star polygon'', used in turtle graphics, is a polygon having ''q'' ≥ 2 Turn (geometry), turns (''q'' is called the turning number or Density (polygon), density), like in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isogonal Polygon
In geometry, a polytope (e.g. a polygon or polyhedron) or a Tessellation, tiling is isogonal or vertex-transitive if all its vertex (geometry), vertices are equivalent under the Symmetry, symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face (geometry), face in the same or reverse order, and with the same Dihedral angle, angles between corresponding faces. Technically, one says that for any two vertices there exists a symmetry of the polytope Map (mathematics), mapping the first isometry, isometrically onto the second. Other ways of saying this are that the automorphism group, group of automorphisms of the polytope ''Group action#Remarkable properties of actions, acts transitively'' on its vertices, or that the vertices lie within a single ''symmetry orbit''. All vertices of a finite -dimensional isogonal figure exist on an n-sphere, -sphere. The term isogonal has long been used for polyhedra. Vertex-transitive is a synonym borrowed fro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tilings And Patterns
''Tilings and patterns'' is a book by mathematicians Branko Grünbaum and Geoffrey Colin Shephard published in 1987 by W.H. Freeman. The book was 10 years in development, and upon publication it was widely reviewed and highly acclaimed. Structure and topics The book is concerned with Tessellation, tilings—a partition of the plane into regions (the tiles)—and patterns—repetitions of a motif in the plane in a regular manner. The book is divided into two parts. The first seven chapters define concepts and terminology, establish the general theory of tilings, survey tilings by regular polygons, review the theory of patterns, and discuss tilings in which all the tiles, or all the edges, or all the vertices, play the same role. The last five chapters survey a variety of advanced topics in tiling theory: Dichromatic symmetry, colored patterns and tilings, Euclidean tilings by convex regular polygons, polygonal tilings, aperiodic tilings, Wang tiles, and tilings with unusual kin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isogonal Tiling
In geometry, a polytope (e.g. a polygon or polyhedron) or a tiling is isogonal or vertex-transitive if all its vertices are equivalent under the symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face in the same or reverse order, and with the same angles between corresponding faces. Technically, one says that for any two vertices there exists a symmetry of the polytope mapping the first isometrically onto the second. Other ways of saying this are that the group of automorphisms of the polytope '' acts transitively'' on its vertices, or that the vertices lie within a single '' symmetry orbit''. All vertices of a finite -dimensional isogonal figure exist on an -sphere. The term isogonal has long been used for polyhedra. Vertex-transitive is a synonym borrowed from modern ideas such as symmetry groups and graph theory. The pseudorhombicuboctahedronwhich is ''not'' isogonaldemonstrates that simply asserting that "all vertices look th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rhombus
In plane Euclidean geometry, a rhombus (: 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), diamonds suit in playing cards which resembles the projection of an Octahedron#Orthogonal projections, octahedral diamond, or a lozenge (shape), lozenge, though the former sometimes refers specifically to a rhombus with a 60° angle (which some authors call a calisson after calisson, the French sweet—also see Polyiamond), and the latter sometimes refers specifically to a rhombus with a 45° angle. Every rhombus is simple polygon, simple (non-self-intersecting), and is a special case of a parallelogram and a Kite (geometry), kite. A rhombus with right angles is a square. Etymology The word "rhombus" comes from , meaning something that spins, which derives from the verb , roman ... [...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] |
Octagon
In geometry, an octagon () is an eight-sided polygon or 8-gon. A '' regular octagon'' has Schläfli symbol and can also be constructed as a quasiregular truncated square, t, which alternates two types of edges. A truncated octagon, t is a hexadecagon, . A 3D analog of the octagon can be the rhombicuboctahedron with the triangular faces on it like the replaced edges, if one considers the octagon to be a truncated square. Properties The sum of all the internal angles of any octagon is 1080°. As with all polygons, the external angles total 360°. If squares are constructed all internally or all externally on the sides of an octagon, then the midpoints of the segments connecting the centers of opposite squares form a quadrilateral that is both equidiagonal and orthodiagonal (that is, whose diagonals are equal in length and at right angles to each other).Dao Thanh Oai (2015), "Equilateral triangles and Kiepert perspectors in complex numbers", ''Forum Geometricorum'' 15, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polygon
In Euclidean geometry, a regular polygon is a polygon that is Equiangular polygon, direct equiangular (all angles are equal in measure) and Equilateral polygon, equilateral (all sides have the same length). Regular polygons may be either ''convex polygon, convex'' or ''star polygon, star''. In the limit (mathematics), limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a Line (geometry), straight line), if the edge length is fixed. General properties These properties apply to all regular polygons, whether convex or star polygon, star: *A regular ''n''-sided polygon has rotational symmetry of order ''n''. *All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon. *Together with the property of equal-length sides, this implies that every regular polygon also h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decagon
In geometry, a decagon (from the Greek δέκα ''déka'' and γωνία ''gonía,'' "ten angles") is a ten-sided polygon or 10-gon.. The total sum of the interior angles of a simple decagon is 1440°. Regular decagon A '' regular decagon'' has all sides of equal length and each internal angle will always be equal to 144°. Its Schläfli symbol is and can also be constructed as a truncated pentagon, t, a quasiregular decagon alternating two types of edges. Side length The picture shows a regular decagon with side length a and radius R of the circumscribed circle. * The triangle E_E_1M has two equally long legs with length R and a base with length a * The circle around E_1 with radius a intersects ]M\,E_ in a point P (not designated in the picture). * Now the triangle \; is an isosceles triangle">/math> in a point P (not designated in the picture). * Now the triangle \; is an isosceles triangle with vertex E_1 and with base angles m\angle E_1 E_ P = m\angle E_ P E_1 = 72 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Density (polygon)
In geometry, the density of a star polyhedron is a generalization of the concept of winding number from two dimensions to higher dimensions, representing the number of windings of the polyhedron around the center of symmetry of the polyhedron. It can be determined by passing a ray from the center to infinity, passing only through the facets of the polytope and not through any lower dimensional features, and counting how many facets it passes through. For polyhedra for which this count does not depend on the choice of the ray, and for which the central point is not itself on any facet, the density is given by this count of crossed facets. The same calculation can be performed for any convex polyhedron, even one without symmetries, by choosing any point interior to the polyhedron as its center. For these polyhedra, the density will be 1. More generally, for any non-self-intersecting (acoptic) polyhedron, the density can be computed as 1 by a similar calculation that choos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
