Monogon
In geometry, a monogon, also known as a henagon, is a polygon with one edge and one vertex. It has Schläfli symbol .Coxeter, ''Introduction to geometry'', 1969, Second edition, sec 21.3 ''Regular maps'', p. 386-388 In Euclidean geometry In Euclidean geometry a ''monogon'' is a degenerate polygon because its endpoints must coincide, unlike any Euclidean line segment. Most definitions of a polygon in Euclidean geometry do not admit the monogon. In spherical geometry In spherical geometry, a monogon can be constructed as a vertex on a great circle (equator). This forms a dihedron, , with two hemispherical monogonal faces which share one 360° edge and one vertex. Its dual, a hosohedron, has two antipodal vertices at the poles, one 360° lune face, and one edge ( meridian) between the two vertices. See also * Digon References * Herbert Busemann Herbert Busemann (12 May 1905 – 3 February 1994) was a German-American mathematician specializing in convex and differential ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Henagonal Hosohedron
In geometry, a monogon, also known as a henagon, is a polygon with one edge and one vertex. It has Schläfli symbol .Coxeter, ''Introduction to geometry'', 1969, Second edition, sec 21.3 ''Regular maps'', p. 386-388 In Euclidean geometry In Euclidean geometry a ''monogon'' is a degenerate polygon because its endpoints must coincide, unlike any Euclidean line segment. Most definitions of a polygon in Euclidean geometry do not admit the monogon. In spherical geometry In spherical geometry, a monogon can be constructed as a vertex on a great circle ( equator). This forms a dihedron, , with two hemispherical monogonal faces which share one 360° edge and one vertex. Its dual, a hosohedron, has two antipodal vertices at the poles, one 360° lune face, and one edge ( meridian) between the two vertices. See also * Digon In geometry, a digon is a polygon with two sides (edges) and two vertices. Its construction is degenerate in a Euclidean plane because either the two sid ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Polygons By The Number Of Sides
In geometry, a polygon () is a plane figure that is described by a finite number of straight line segments connected to form a closed ''polygonal chain'' (or ''polygonal circuit''). The bounded plane region, the bounding circuit, or the two together, may be called a polygon. The segments of a polygonal circuit are called its '' edges'' or ''sides''. The points where two edges meet are the polygon's '' vertices'' (singular: vertex) or ''corners''. The interior of a solid polygon is sometimes called its ''body''. 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. Mathematicians are often concerned only with the bounding polygonal chains of simple polygons and they often define a polygon accordingly. A polygonal boundary may be allowed to cross over itself, creating star polygons and other self-intersecting polygons. A polygon is a 2-dimensional example of the more general polytope in any numb ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Digon
In geometry, a digon is a polygon with two sides (edges) and two vertices. Its construction is degenerate in a Euclidean plane because either the two sides would coincide or one or both would have to be curved; however, it can be easily visualised in elliptic space. A regular digon has both angles equal and both sides equal and is represented by Schläfli symbol . It may be constructed on a sphere as a pair of 180 degree arcs connecting antipodal points, when it forms a lune. The digon is the simplest abstract polytope of rank 2. A truncated ''digon'', t is a square, . An alternated digon, h is a monogon, . In Euclidean geometry The digon can have one of two visual representations if placed in Euclidean space. One representation is degenerate, and visually appears as a double-covering of a line segment. Appearing when the minimum distance between the two edges is 0, this form arises in several situations. This double-covering form is sometimes used for defining degener ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Polygon
In geometry, a polygon () is a plane figure that is described by a finite number of straight line segments connected to form a closed ''polygonal chain'' (or ''polygonal circuit''). The bounded plane region, the bounding circuit, or the two together, may be called a polygon. The segments of a polygonal circuit are called its '' edges'' or ''sides''. The points where two edges meet are the polygon's '' vertices'' (singular: vertex) or ''corners''. The interior of a solid polygon is sometimes called its ''body''. 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. Mathematicians are often concerned only with the bounding polygonal chains of simple polygons and they often define a polygon accordingly. A polygonal boundary may be allowed to cross over itself, creating star polygons and other self-intersecting polygons. A polygon is a 2-dimensional example of the more general polytope in any number ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Degeneracy (mathematics)
In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from (and usually simpler than) the rest of the class, and the term degeneracy is the condition of being a degenerate case. The definitions of many classes of composite or structured objects often implicitly include inequalities. For example, the angles and the side lengths of a triangle are supposed to be positive. The limiting cases, where one or several of these inequalities become equalities, are degeneracies. In the case of triangles, one has a ''degenerate triangle'' if at least one side length or angle is zero. Equivalently, it becomes a "line segment". Often, the degenerate cases are the exceptional cases where changes to the usual dimension or the cardinality of the object (or of some part of it) occur. For example, a triangle is an object of dimension two, and a degenerate triangle is contained in a line, which makes its dimension one. This is similar ... [...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, star polygon, star or Skew polygon, skew. 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 p ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Hosohedron
In spherical geometry, an -gonal hosohedron is a tessellation of lunes on a spherical surface, such that each lune shares the same two polar opposite vertices. A regular -gonal hosohedron has Schläfli symbol with each spherical lune having internal angle radians ( degrees). Hosohedra as regular polyhedra For a regular polyhedron whose Schläfli symbol is , the number of polygonal faces is : :N_2=\frac. The Platonic solids known to antiquity are the only integer solutions for ''m'' ≥ 3 and ''n'' ≥ 3. The restriction ''m'' ≥ 3 enforces that the polygonal faces must have at least three sides. When considering polyhedra as a spherical tiling, this restriction may be relaxed, since digons (2-gons) can be represented as spherical lunes, having non-zero area. Allowing ''m'' = 2 makes :N_2=\frac=n, and admits a new infinite class of regular polyhedra, which are the hosohedra. On a spherical surface, the polyhedron is represented as ''n'' abutting lunes, with interior ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Herbert Busemann
Herbert Busemann (12 May 1905 – 3 February 1994) was a German-American mathematician specializing in convex and differential geometry. He is the author of Busemann's theorem in Euclidean geometry and geometric tomography. He was a member of the Royal Danish Academy and a winner of the Lobachevsky Medal (1985), the first American mathematician to receive it. He was also a Fulbright scholar in New Zealand in 1952. Biography Herbert Busemann was born in Berlin to a well-to-do family. His father, Alfred Busemann, was a director of Krupp, where Busemann also worked for several years. He studied at University of Munich, Paris, and Rome. He defended his dissertation in University of Göttingen in 1931, where his advisor was Richard Courant. He remained in Göttingen as an assistant until 1933, when he escaped Nazi Germany to Copenhagen (he had a Jewish grandfather). He worked at the University of Copenhagen until 1936, when he left to the United States. There, he got marr ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Dihedron
A dihedron is a type of polyhedron, made of two polygon faces which share the same set of ''n'' edges. In three-dimensional Euclidean space, it is degenerate if its faces are flat, while in three-dimensional spherical space, a dihedron with flat faces can be thought of as a lens, an example of which is the fundamental domain of a lens space L(''p'',''q''). Dihedra have also been called bihedra, flat polyhedra, or doubly covered polygons. As a spherical tiling, a dihedron can exist as nondegenerate form, with two ''n''-sided faces covering the sphere, each face being a hemisphere, and vertices on a great circle. It is regular if the vertices are equally spaced. The dual of an ''n''-gonal dihedron is an ''n''-gonal hosohedron, where ''n'' digon faces share two vertices. As a flat-faced polyhedron A dihedron can be considered a degenerate prism whose two (planar) ''n''-sided polygon bases are connected "back-to-back", so that the resulting object has no depth. The polygons must b ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Meridian
Meridian or a meridian line (from Latin ''meridies'' via Old French ''meridiane'', meaning “midday”) may refer to Science * Meridian (astronomy), imaginary circle in a plane perpendicular to the planes of the celestial equator and horizon ** Central meridian (planets) * Meridian (geography), an imaginary arc on the Earth's surface from the North Pole to the South Pole ** Meridian arc, the distance between two points with the same longitude ** Prime meridian, origin of longitudes ** Principal meridian, arbitrary meridians used as references in land surveying * Meridian line, used with a gnomon to measure solar elevation and time of year * Autonomous sensory meridian response, a static-like or tingling sensation on the skin Places Cities and towns * Meridian, California (other), U.S., multiple California towns named Meridian * Meridian, Colorado, U.S. * Meridian, Florida, U.S. * Meridian, Georgia, U.S. * Meridian, Idaho, U.S. * Meridian, Mississippi, U.S. * Meri ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Lune (mathematics)
In plane geometry, a lune () is the concave-convex region bounded by two circular arcs. It has one boundary portion for which the connecting segment of any two nearby points moves outside the region and another boundary portion for which the connecting segment of any two nearby points lies entirely inside the region. A convex-convex region is termed a lens. Formally, a lune is the relative complement of one disk in another (where they intersect but neither is a subset of the other). Alternatively, if A and B are disks, then A \smallsetminus A \cap B is a lune. Squaring the lune In the 5th century BC, Hippocrates of Chios showed that the Lune of Hippocrates and two other lunes could be exactly squared (converted into a square having the same area) by straightedge and compass. In 1766 the Finnish mathematician Daniel Wijnquist, quoting Daniel Bernoulli, listed all five geometrical squareable lunes, adding to those known by Hippocrates. In 1771 Leonard Euler gave a general a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |