|
Edge-transitive
In geometry, a polytope (for example, a polygon or a polyhedron) or a Tessellation, tiling is isotoxal () or edge-transitive if its Symmetry, symmetries act Transitive group action, transitively on its Edge (geometry), edges. Informally, this means that there is only one type of edge to the object: given two edges, there is a Translation (geometry), translation, Rotation (mathematics), rotation, and/or Reflection (mathematics), 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 Duality (mathematics)#Dimension-reversing dualities, duals of isotoxal polygons are isogonal polygons. Isotoxal 4n-gons are Central symmetry, 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 isotoxa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedron
In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal Face (geometry), faces, straight Edge (geometry), edges and sharp corners or Vertex (geometry), vertices. The term "polyhedron" may refer either to a solid figure or to its boundary surface (mathematics), 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 (mathematics), 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 Eule ... [...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] |
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] |
Polygon
In geometry, a polygon () is a plane figure made up of line segments connected to form a closed polygonal chain. The segments of a closed polygonal chain are called its '' edges'' or ''sides''. The points where two edges meet are the polygon's '' vertices'' or ''corners''. 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. More precisely, the only allowed intersections among the line segments that make up the polygon are the shared endpoints of consecutive segments in the polygonal chain. A simple polygon is the boundary of a region of the plane that is called a ''solid polygon''. The interior of a solid polygon is its ''body'', also known as a ''polygonal region'' or ''polygonal area''. In contexts where one is concerned only with simple and solid polygons, a ''polygon'' may refer only to a simple polygon or to a solid polygon. A polygonal chain may cross over itself, creating star polyg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equilateral Polygon
In geometry, an equilateral polygon is a polygon which has all sides of the same length. Except in the triangle case, an equilateral polygon does not need to also be equiangular (have all angles equal), but if it does then it is a regular polygon. If the number of sides is at least four, an equilateral polygon does not need to be a convex polygon: it could be concave or even self-intersecting. Examples All regular polygons and edge-transitive polygons are equilateral. When an equilateral polygon is non-crossing and cyclic (its vertices are on a circle) it must be regular. An equilateral quadrilateral must be convex; this polygon is a rhombus (possibly a square). A convex equilateral pentagon can be described by two consecutive angles, which together determine the other angles. However, equilateral pentagons, and equilateral polygons with more than five sides, can also be concave, and if concave pentagons are allowed then two angles are no longer sufficient to determine the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Greatest Common Divisor
In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers , , the greatest common divisor of and is denoted \gcd (x,y). For example, the GCD of 8 and 12 is 4, that is, . In the name "greatest common divisor", the adjective "greatest" may be replaced by "highest", and the word "divisor" may be replaced by "factor", so that other names include highest common factor, etc. Historically, other names for the same concept have included greatest common measure. This notion can be extended to polynomials (see ''Polynomial greatest common divisor'') and other commutative rings (see ' below). Overview Definition The ''greatest common divisor'' (GCD) of integers and , at least one of which is nonzero, is the greatest positive integer such that is a divisor of both and ; that is, there are integers and such that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turning Number
In mathematics, the winding number or winding index of a closed curve in the plane around a given point is an integer representing the total number of times that the curve travels counterclockwise around the point, i.e., the curve's number of turns. For certain open plane curves, the number of turns may be a non-integer. The winding number depends on the orientation of the curve, and it is negative if the curve travels around the point clockwise. Winding numbers are fundamental objects of study in algebraic topology, and they play an important role in vector calculus, complex analysis, geometric topology, differential geometry, and physics (such as in string theory). Intuitive description Suppose we are given a closed, oriented curve in the ''xy'' plane. We can imagine the curve as the path of motion of some object, with the orientation indicating the direction in which the object moves. Then the winding number of the curve is equal to the total number of counterclockwi ... [...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] |
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] |
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] |
Degree (geometry)
A degree (in full, a degree of arc, arc degree, or arcdegree), usually denoted by ° (the degree symbol), is a measurement of a plane angle in which one full rotation is 360 degrees. It is not an SI unit—the SI unit of angular measure is the radian—but it is mentioned in the SI brochure as an accepted unit. Because a full rotation equals 2 radians, one degree is equivalent to radians. History The original motivation for choosing the degree as a unit of rotations and angles is unknown. One theory states that it is related to the fact that 360 is approximately the number of days in a year. Ancient astronomers noticed that the sun, which follows through the ecliptic path over the course of the year, seems to advance in its path by approximately one degree each day. Some ancient calendars, such as the Persian calendar and the Babylonian calendar, used 360 days for a year. The use of a calendar with 360 days may be related to the use of sexagesimal numbers. Another theory ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
