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 {2}. 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{2} is a square, {4}. An alternated digon, h{2} is a monogon, {1}.
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 degenerate cases of some other polytopes; for example, a regular tetrahedron can be seen as an antiprism formed of such a digon. It can be derived from the alternation of a square (h{4}), as it requires two opposing vertices of said square to be connected. When higher-dimensional polytopes involving squares or other tetragonal figures are alternated, these digons are usually discarded and considered single edges.
A second visual representation, infinite in size, is as two parallel lines stretching to (and projectively meeting at; i.e. having vertices at) infinity, arising when the shortest distance between the two edges is greater than zero. This form arises in the representation of some degenerate polytopes, a notable example being the apeirogonal hosohedron, the limit of a general spherical hosohedron at infinity, composed of an infinite number of digons meeting at two antipodal points at infinity. However, as the vertices of these digons are at infinity and hence are not bound by closed line segments, this tessellation is usually not considered to be an additional regular tessellation of the Euclidean plane, even when its dual order-2 apeirogonal tiling (infinite dihedron) is.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In mathematics, a Euclidean plane is a Euclidean space of dimension two, denoted E2. It is a geometric space in which two real numbers are required to determine the position of each point. It is an affine space, which includes in particular the concept of parallel lines. It has also metrical properties induced by a distance, which allows to define circles, and angle measurement. A Euclidean plane with a chosen Cartesian coordinate system is called a Cartesian plane.
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 geometry, a spherical polyhedron or spherical tiling is a tiling of the sphere in which the surface is divided or partitioned by great arcs into bounded regions called spherical polygons. Much of the theory of symmetrical polyhedra is most conveniently derived in this way. The most familiar spherical polyhedron is the soccer ball, thought of as a spherical truncated icosahedron. The next most popular spherical polyhedron is the beach ball, thought of as a hosohedron.
Many scientific inquiries in natural sciences involve approximating a spherical field –namely a scalar quantity defined over a continuum of directions– from generalised samples of the latter. Typically, a convex optimisation problem is formulated in terms ...