Fact-checked by Grok 2 weeks ago

Digon

A digon, also known as a bigon or 2-gon, is a degenerate polygon in geometry consisting of two edges and two vertices.^[1]^[2] In Euclidean space, it manifests as a line segment where the two edges coincide, lacking an interior or area, and is thus considered degenerate.^[1] The term derives from the prefix di- meaning "two" combined with -gon, the suffix denoting a plane figure with a specified number of angles, rooted in Proto-Indo-European origins for "two" and "angle."^[3] A regular digon features two equal-length edges meeting at equal angles, denoted by the Schläfli symbol {2}.^[1]^[2] While abstract and non-standard in flat geometry, digons gain significance in non-Euclidean contexts such as spherical or elliptic geometry, where they form a lune—a two-sided region bounded by two great circle arcs connecting antipodal points on a sphere.^[4] In these spaces, a digon encloses a meaningful area and serves as a foundational element in tilings, polyhedra like hosohedra, and topological studies.^[5] For instance, regular digons appear in spherical tilings as the simplest uniform polyhedron components.^[5] Beyond geometry, the concept extends to graph theory, where a digon represents a pair of parallel or antiparallel edges in multigraphs.^[3]

Introduction and Definition

Basic Definition

A digon, also known as a bigon or 2-gon, is a degenerate polygon consisting of exactly two edges and two vertices.^[1] In standard Euclidean geometry, it is degenerate because the two edges coincide along the same line, effectively forming a single line segment traversed twice, once in each direction.^[1] Not generally recognised as a polygon in the Euclidean plane, although it can exist as a spherical polygon.^[6] The digon exhibits fundamental properties arising from its minimal form, including rotational symmetry of order 2, whereby a 180-degree rotation around the midpoint of the edges maps the figure onto itself.^[1] Its interior angle is interpreted as 0 degrees in the Euclidean plane due to the collinear edges.^[7] As the limiting case of an n-gon when n approaches 2, the digon represents the boundary of polygonal degeneration, where the formula for the sum of interior angles, (n-2)×180 degrees, yields 0 degrees.^[8] Visually, the digon appears as two coincident rays emanating from each vertex, creating a "doubled" line segment.^[1] All digons are regular by default, as the two edges must be of equal length to connect the vertices consistently.^[1]

Etymology

The term "digon" derives from the Greek prefix di-, meaning "two," combined with the suffix -gon, from gōnia ("angle" or "corner"), following the standard nomenclature for polygons such as trigōnon (triangle) and pentagōnon (pentagon).^[9] Alternative terms include "bigon," blending the Latin prefix bi- ("two") with the Greek -gon, and the descriptive "2-gon"; while a 1-sided figure is termed a "henagon" or "monogon," the digon remains the conventional designation for the two-sided polygon in contemporary mathematical literature.^[1] The earliest recorded uses of "digon" appear in Talmudic and medieval Hebrew geometric texts, where it denotes a biangular figure, such as a semicircular "biangular house," representing a transitional angle-based geometry distinct from ancient Greek traditions that began polygons at three sides. This nomenclature evolved in the 20th century through spherical trigonometry, where the digon equates to a lune bounded by two great-circle arcs, before H.S.M. Coxeter's systematic introduction in his foundational work on regular polytopes, extending polygonal families for theoretical completeness. In this context, the digon corresponds to the Schläfli symbol {2}, underscoring its role in higher-dimensional generalizations.

Geometric Constructions

In Euclidean Geometry

In Euclidean geometry, a digon is a degenerate polygon consisting of two vertices connected by two coincident edges that overlap exactly along a single line segment. This construction requires the edges to coincide completely, as distinct straight-line edges between two points cannot form a closed figure without violating the planarity and non-intersecting requirements of simple polygons in the flat plane. Unlike polygons with three or more sides, the digon cannot enclose a positive area, reducing instead to a one-dimensional line segment traversed twice. The properties of the digon in the Euclidean plane reflect its degeneracy: it has zero area and no interior, while its perimeter equals twice the length of the underlying line segment. The boundary is mathematically described as a doubled traversal of the line segment between the two vertices, say points A and B, where the path proceeds from A to B and returns along the identical path. This configuration ensures closure but lacks the topological distinction of higher-sided polygons, rendering it invalid as a simple closed curve in standard Euclidean embeddings. Despite its limitations, the digon holds abstract utility in mathematical analysis, such as in limiting processes that collapse an n-gon to two sides as n approaches 2, providing a foundational case for generalizing polygonal theorems and polytope constructions. In the framework of uniform polytopes, it serves as the 2-dimensional base with Schläfli symbol \{2\}, facilitating extensions to higher dimensions. Additionally, in computational geometry, digons emerge as artifacts during mesh degeneration, where they indicate collapsed or invalid polygons that algorithms must identify and eliminate to maintain numerical stability and prevent errors in triangulation or rendering processes.

In Spherical Geometry

In spherical geometry, the digon appears as a non-degenerate spherical lune, a region on the surface of a sphere bounded by two great circle arcs that intersect at antipodal points, forming a two-sided wedge analogous to a slice of the sphere. These arcs serve as geodesics connecting the two vertices (the poles), with the shape defined by the dihedral angle θ between the planes containing the great circles.^[10] The geometric properties of the spherical digon include an area of $2 \theta r^{2}, where \theta is the dihedral angle in radians and r is the sphere's radius; for a unit sphere (r = 1), this simplifies to $2 \theta. The two edges are semicircular great circle arcs, each of length \pi r, while the vertices coincide with the antipodal poles. The spherical excess E of the digon, calculated as the sum of its interior angles minus (n-2)\pi for n = 2 sides (yielding E = 2\theta), equals the area divided by r^{2}, underscoring its role in spherical trigonometry for computing areas via angular measures. This excess is particularly relevant in lune-based triangulations, where overlapping lunes help derive the area-excess relation for more complex spherical polygons, as established in classical proofs like Girard's theorem.^[11] The digon serves as a foundational element in spherical polyhedra, providing the basic building block for tilings and structures on the sphere. It also finds practical application in early map projections, such as the globe gores of Martin Waldseemüller's 1507 cosmographic globe, which divided the terrestrial sphere into digon-like sectors for assembly. In astronomy, lunes corresponding to digons divide the celestial sphere along meridians, facilitating coordinate systems like right ascension for tracking stellar positions and timekeeping.^[12]^[13]

Polyhedral and Higher-Dimensional Analogues

Hosohedra and Dihedra

A hosohedron is a type of polyhedron consisting of n digonal faces that all meet at two apical vertices, resembling a spindly sphere divided into longitudinal sections. These faces are spherical digons, or lunes, each bounded by two great circle arcs connecting the poles. For n=2, the digonal hosohedron features two such digonal faces, forming a simple division of the sphere along a single great circle into two hemispheres treated as digons. This construction embeds the digons as meridians on the sphere, providing a regular tessellation where the vertex figure is an n-gon.^[5]^[14] The dual of the hosohedron is the dihedron, a polyhedron with two n-gonal faces, each occupying a hemisphere, connected along their boundaries by edges that form digons in the abstract sense. The regular dihedron, denoted in Schläfli notation as {n,2}, has its faces as spherical n-gons separated by n great circle edges of length 2π/n on a unit sphere. In a Euclidean approximation, dihedra can be visualized as two cones joined at their bases, though this loses the spherical regularity. A specific example is the digonal dihedron, which manifests as a lune solid—a wedge-shaped volume bounded by two digonal faces.^[15]^[14] Both hosohedra and dihedra exhibit the Euler characteristic χ = 2, consistent with their spherical topology: for a hosohedron, there are 2 vertices, n edges, and n faces (V − E + F = 2 − n + n = 2); the dihedron, as its dual, shares this property with n vertices, n edges, and 2 faces (V − E + F = n − n + 2 = 2). These structures are employed in the enumeration of uniform polyhedra, serving as limiting cases in classifications of regular figures. However, in Euclidean space, they are degenerate, collapsing to a line segment where the apical vertices coincide and the faces flatten along the axis, rendering them non-convex and unrealizable without spherical curvature.^[14]^[16]

Schläfli Symbols in Uniform Polytopes

The Schläfli symbol {2} denotes the digon as a regular 2-gon, serving as the foundational element in the notation for regular polytopes and their uniform variants. This symbol extends naturally to higher dimensions, where {2,p} represents hosohedra—polytopes with p digonal faces meeting at two opposite vertices—and {p,2} denotes dihedra, featuring two p-gonal faces connected by p edges, applicable in three dimensions and beyond.^[17] In the context of uniform polytopes, the digon qualifies as a regular polygon with density 1, ensuring vertex-transitivity and regular 2-faces in encompassing structures. Within Coxeter-Dynkin diagrams, the digon manifests as a single node, while integrations into higher-dimensional diagrams incorporate bonds labeled 2, corresponding to dihedral angles of \pi/2.^[17] In four dimensions, digons appear in degenerate uniform polychora, such as the hosohedral polychoron with Schläfli symbol {2,2,p}, where p digons meet at vertices in a higher-dimensional analogue of the spherical lune.^[18] These constructions play a key role in Wythoff symbols, enabling the generation of uniform polytopes by reflecting over mirrors in Coxeter groups, where digonal components yield prismatic and antiprismatic figures. The digon's incorporation into Schläfli symbols completes the spectrum of regular polytopes, bridging convex and degenerate cases across dimensions. It further aids in density computations for star polytopes, where digonal elements contribute to winding numbers and intersection densities, as seen in complex uniform figures like the great dirhombicosidodecahedron.^[17]

Abstract and Topological Interpretations

In Topology

In topology, the digon is realized as a 2-dimensional cell homeomorphic to a closed disk, whose boundary circle is partitioned into two arcs that are identified via a homeomorphism, yielding a quotient space that serves as a fundamental domain for certain surfaces.^[19] This structure arises naturally in the construction of closed surfaces through edge identifications on polygonal schemas, where the digon represents the simplest such polygon with two sides. The spherical lune provides a prototypical geometric embedding of this topological object, though the abstract treatment focuses on the quotient topology independent of embedding.^[19] In the framework of CW-complexes, the digon is modeled as a single 2-cell attached to a 1-skeleton consisting of a single 0-cell and a single 1-cell forming a loop, with the attaching map determined by the edge labels.^[20] For the gluing scheme denoted aa^{-1}, where the two boundary arcs are identified with opposite orientations, the attaching map is nullhomotopic (degree 0), resulting in the sphere S^2, which is simply connected with trivial fundamental group.^[19] In contrast, the scheme aa identifies the arcs with matching orientations, yielding the real projective plane \mathbb{RP}^2, a non-orientable surface whose fundamental group is \mathbb{Z}/2\mathbb{Z}.^[19] Gluing two such digons along their boundaries, as in the case of two hemispherical lunes, reconstructs the sphere, while multiple digons with appropriate twisted gluings can generate higher non-orientable surfaces like the projective plane or Klein bottle via successive identifications.^[19] Regarding simplicial homology, the digon contributes a generator to the 2-chains in the cellular chain complex of the resulting surface. The boundary map applied to the digon cycle [\sigma] is given by

\partial_2([\sigma]) = [e_1] - [e_2],

where e_1 and e_2 are the 1-chains corresponding to the two boundary edges. Upon identification, e_1 and e_2 become the same chain e (up to sign from orientation), rendering \partial_2([\sigma]) = 0 in the degenerate case of the sphere, where the digon generates H_2(S^2; \mathbb{Z}) \cong \mathbb{Z}. For the projective plane under the aa gluing, the attaching map has degree 2, so \partial_2([\sigma]) = 2, yielding H_2(\mathbb{RP}^2; \mathbb{Z}) = 0 as the kernel of \partial_2 vanishes. The digon plays a key role in classifying surfaces via polygonal schemas, serving as a foundational building block for decomposing closed orientable and non-orientable surfaces into quotients of disks with paired edge identifications.^[19] In orbifold theory, digons model regions around singular points, such as cone points of order 2, facilitating the study of quotient spaces with local group actions.^[21] Additionally, in computational topology, digons appear as degenerate 2-faces in simplicial meshes and are routinely eliminated during refinement processes to ensure manifold properties and improve numerical stability in geometry processing algorithms.^[22]

In Graph Theory

In graph theory, a digon is defined as a cycle of length two in a multigraph, formed by two parallel undirected edges connecting the same pair of vertices.^[23] This structure arises naturally in multigraphs where multiple edges between vertices are permitted, distinguishing it from simple graphs that prohibit such multiples.^[3] The presence of a digon reduces the girth of a graph to 2, as the girth is the length of its shortest cycle, and a digon qualifies as the minimal such cycle in multigraphs allowing parallels.^[24] In planar embeddings of multigraphs, digons manifest as faces of degree two, which are often regarded as degenerate because traditional analyses of planar graphs assume minimum face degrees of at least three; nevertheless, Euler's formula v - e + f = 2 remains valid, though it permits looser edge bounds compared to the standard e \leq 3v - 6 derived under the no-digon assumption.^[25] In algebraic graph theory, digons influence the spectrum of the adjacency matrix, where the multiplicity of edges (such as two for a digon) replaces binary entries with higher integers, thereby adjusting eigenvalues to reflect the strengthened connections between vertices.^[26] Applications extend to network analysis, where digons enable modeling of multiple interactions between entities, such as repeated ties in social or biological networks, and algorithms for detecting such multiples aid in identifying redundant or intensified links.^[27] A basic example is the complete multigraph K_2 with exactly two edges between its vertices, which forms a isolated digon.^[23] In graph studies like the Petersen graph, which has girth 5 and thus excludes digons, such structures are absent to preserve higher cycle lengths essential for properties like non-Hamiltonicity.^[28] Similarly, expander graphs often forbid digons by design to ensure girth greater than 2, enhancing their pseudorandom expansion characteristics in theoretical constructions.^[29]

References

[1]
Digon -- from Wolfram MathWorld
The digon is the degenerate polygon (corresponding to a line segment) with Schläfli symbol {2}.Missing: definition | Show results with:definition
[2]
Digon - AoPS Wiki
### Summary of Digon
[3]
digon - Wiktionary, the free dictionary
On a flat surface, a digon would look like a line. From di- (prefix meaning 'two') +‎ -gon (suffix forming the names of plane figures containing a given number ...
[4]
Definition of Polygons - Department of Mathematics at UTSA
Dec 11, 2021 · A polygon (/ˈpɒlɪɡɒn/) is a plane figure that is described by a finite number of straight line segments connected to form a closed polygonal chain.
[5]
Formula for interior angles (shapes) - Number in Math Wiki - Fandom
The formula for each interior angle in a more-than-1-sided regular polygon is used in geometry to calculate some angles in a regular polygon.
[6]
Polygon -- from Wolfram MathWorld
A polygon can be defined (as illustrated above) as a geometric object consisting of a number of points (called vertices) and an equal number of line segments ( ...
[7]
Polygon - Etymology, Origin & Meaning
Polygon, from Greek polygōnon meaning "many-angled," combines polys (many) + gōnia (angle). Originating in the 1570s, it denotes a plane figure with ...
[8]
Spherical Lune -- from Wolfram MathWorld
. The surface area of the lune is. S=2r^2theta,. which is just the area of the sphere times theta/(2pi) . The volume of the associated spherical wedge has ...
[9]
Spherical Excess -- from Wolfram MathWorld
The difference between the sum of the angles A, B, and C of a spherical triangle and pi radians ( 180 degrees ), E=A+B+C-pi.Missing: digon properties
[10]
The Waldseemüller Map: Charting the New World
Two obscure 16th-century German scholars named the American continent and changed the way people thought about the world.Missing: digons | Show results with:digons
[11]
Martin Waldseemüller Creates the First Map to Name America
The Waldseemüller map depicts North and South America as two large continents. The main map shows the two continents slightly separated.Missing: digons | Show results with:digons
[12]
Hosohedron -- from Wolfram MathWorld
A hosohedron is a regular tiling or map on a sphere composed of p digons or spherical lunes, all with the same two vertices and the same vertex angles.
[13]
regular polytopes : h.s.m coxeter - Internet Archive
Aug 17, 2022 · regular polytopes. by: h.s.m coxeter. Publication date: 1948. Collection: internetarchivebooks; inlibrary; printdisabled. Contributor: Internet ...
[14]
Dihedron -- from Wolfram MathWorld
A dihedron is a regular tiling or map on a sphere composed of two regular p-gons, each occupying a hemisphere and with edge lengths of 2pi/p on a unit sphere.
[15]
[PDF] Regular Polytopes
conclude that the Coxeter diagram of G is a chain Chas no branches. So we have,. Page 10. Theorem (Schläfli, 1855):. The regular polytopes correspond to the.
[16]
[PDF] Constructions of k-orbit abstract polytopes - Northeastern University
Apr 5, 2013 · Two polyhedra which will be of particular concern to us are the universal polytopes of 23 Page 24 Schläfli types {p,2} and {2,p}. As it turns ...<|control11|><|separator|>
[17]
Fundamental polygons with infinite pairwise identifications
Sep 4, 2010 · The topology of a closed surface can be constructed by identifying ... digon with the word aa−1. Victor Protsak. – Victor Protsak. 2010 ...
[18]
The relation between abstract polytope and acyclic category
Jan 5, 2023 · For example, consider a digon: digon. The top left is the digon, which is a regular CW complex. The top right is its face lattice, which is a ...
[19]
[PDF] Gentle algebras arising from surfaces with orbifold points, Part II - arXiv
Let ♢ be its topological interior in Σ \ ∂Σ. Thus, if k is not pending, then ♢ is an open quadrilateral; whereas if k is pending, then ♢ is an open digon.
[20]
[PDF] Intrinsic Triangulations in Geometry Processing
This thesis introduces the theory and practice of intrinsic triangulations, from their basic representation, to new data structures and algorithms, to ...
[21]
[PDF] Removable Circuits in Multigraphs
2. A 2-connected graph containing circuit decompositions in which every circuit has length at least 3, but containing no removable circuit of length at least 3.
[22]
[PDF] Multigraphs with Unique Partition into Cycles - arXiv
Apr 10, 2025 · If we replace every edge of a tree with a cycle of length ě 2, we obtain a bridgeless cactus multigraph. ... A cycle of length d “ 2 is a digon.
[23]
Edge-colouring seven-regular planar graphs - ScienceDirect.com
A conjecture due to the fourth author states that every d-regular planar multigraph ... digon-regions among the regions that remain, and we have done it in the ...
[24]
[PDF] Chapter 16 - Spectral Graph Theory - Computer Science
Graphs that have multiple-edges or self-loops are often called multi- graphs. Many different matrices arise in the field of Spectral Graph Theory. In this ...
[25]
[PDF] A Multigraph Approach to Social Network Analysis
In this paper we present a new multigraph approach that may be used to analyse networks with multiple edges and loops of different kinds. We describe multigraph ...
[26]
Petersen Graph -- from Wolfram MathWorld
The Petersen graph is a cubic graph with 10 vertices and 15 edges, introduced as a counterexample to an edge coloring problem. It has a girth of 5 and diameter ...
[27]
[PDF] An introduction to expander graphs - ETH Zürich
Jul 6, 2011 · (5) Show that if a graph Γ is finite and not bipartite, then its girth is finite. In fact, show that girth(Γ) ⩽ 2 diam(Γ) + 1, and that this is ...