Polygon

A planar geometric figure whose boundary is a finite cyclic sequence of straight line segments joined endpoint to endpoint under a declared simplicity and interior convention.

Version

v1 · 2026-09-28 · History

Domain-specific #

11394

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Plane Geometry, Geometry → Mathematics

Aliases

N-gon

Core Idea

A polygon is a planar geometric figure whose boundary is a finite cyclic sequence of straight line segments joined endpoint to endpoint. The segments are sides or edges, and their junctions are vertices. An (n)-gon has (n) sides, so triangles, quadrilaterals, and hexagons are side-count subtypes.

Mathematical conventions vary. Some sources restrict polygon to simple chains whose nonconsecutive sides do not intersect; others include star and other self-intersecting polygons. Some use polygon for the boundary alone, while others include the enclosed region. These choices must be stated rather than smuggled into the definition.

Polygon is domain-specific because its carrier is geometric: vertices, line segments, planar incidence, and metric or topological properties. It can stand as a graph root when no broader catalog identity supplies a sufficiently discriminating necessary genus.

Structural Signature

Sig role-phrases:

• Finite vertex cycle — orders finitely many vertices cyclically.
• Straight sides — connect each vertex to the next with line segments.
• Closure — joins the final side back to the first vertex.
• Ambient plane and incidence — determine intersections, orientation, and inside-outside relations.
• Convention profile — states whether self-intersection, degeneracy, boundary-only, and filled interior are admitted.
• Geometric predicates — side count, lengths, angles, convexity, symmetry, and circle incidence define narrower species.

The cyclic combinatorial structure survives many metric changes. Moving vertices can preserve a hexagon while changing regularity, convexity, area, and symmetry. Collapsing vertices or sides may create degeneracy and change the accepted side count under the chosen convention.

What It Is Not

• Not an open polygonal chain. Closure is constitutive.
• Not any closed curve. Ordinary polygon sides are straight segments.
• Not necessarily the filled region. Boundary-only and solid-polygon senses must be distinguished.
• Not necessarily simple. Self-intersecting cases depend on convention.
• Not a polyhedron. A polyhedron is a three-dimensional face complex whose faces may be polygons.
• Not a Reuleaux polygon in the strict side sense. Its boundary consists of circular arcs despite the inherited name.

Scope of Application

The abstraction applies in Euclidean plane geometry, analytic and computational geometry, graphics, mesh processing, optimization, and related fields. It supports convex, concave, regular, irregular, equilateral, equiangular, cyclic, tangential, simple, and conventionally admitted star forms.

Scope must qualify ambient geometry. Spherical polygons have geodesic arcs rather than Euclidean line segments, and skew polygons leave the plane. Generalized polygons in incidence geometry can be combinatorial structures. These uses share ancestry but should not silently inherit every Euclidean predicate.

Clarity

Polygon separates boundary, interior, and representation. A vertex list, inequality set, or drawing can represent one polygon; none is identical to the abstract figure. Reversing vertex order changes orientation but not necessarily the unoriented polygon.

It also separates combinatorial and metric identity. A quadrilateral remains four-sided across continuous deformations that preserve its vertex-edge cycle, although it can cease to be rectangular, cyclic, convex, or nondegenerate.

Manages Complexity

The abstraction compresses a plane boundary into an ordered finite list of vertices and edges. This makes perimeter, area, triangulation, containment, intersection, convexity, and rendering algorithmically tractable.

Different representations shift cost and robustness. Vertex lists are compact, half-edge structures expose adjacency, and inequalities suit convex analysis. Numerical tolerance matters because nearly collinear vertices and almost intersecting edges can make classification unstable.

Abstract Reasoning

The structure supports invariant reasoning. Side count follows the vertex-edge cycle; angle sums depend on simplicity and geometry; convexity constrains every segment between internal points; circle incidence defines cyclic species. Decomposition into triangles transfers many calculations to simpler pieces.

Counterfactuals expose the boundary. Break the final connection and the result is an open chain. Curve a side and the strict figure ceases to be polygonal. Let nonconsecutive sides cross and the object remains a polygon only under a self-intersection-admitting convention.

Knowledge Transfer

Vertex-edge cycles transfer to graph theory, meshes, graphics, geographic boundaries, and computational geometry. Polygonal approximation replaces curved boundaries with finite segments for calculation and rendering.

Literal transfer should preserve geometry. A “polygon” in an organizational or rhetorical diagram may borrow shape but does not instantiate the mathematical identity without vertices and straight sides in an applicable geometric space.

Examples

Hexagon

A hexagon is a polygon with six sides and six vertices. It can be regular or irregular, convex or concave, simple or—under broader conventions—self-intersecting.

Mapped back: vertex cycle = six vertices; straight sides = six segments; closure = sixth returns to first; plane = Euclidean incidence; convention = ordinarily simple unless qualified; predicate = side count six.

Cyclic quadrilateral

A cyclic quadrilateral is a four-sided polygon whose four vertices lie on one circle.

Mapped back: vertex cycle = four vertices; straight sides = four chords; closure = closed quadrilateral; plane = circle and chord incidence; convention = simple Euclidean figure; predicate = all vertices concyclic.

Structural Tensions

T1 — Broad generalized convention vs. simple-region intuition. Admitting crossed chains broadens algebraic treatment while disrupting ordinary inside-outside reasoning. Diagnostic: Does the current theorem require a simple boundary or only a closed segment cycle?

T2 — Combinatorial invariants vs. metric properties. Side count and adjacency survive deformation, while length, angle, area, and circle relations may not. Diagnostic: Which conclusions use only incidence and which require measurement?

Structural–Framed Character

Polygon is organized by a finite cyclic incidence structure realized as straight segments in a plane. The same structure supports both visual figure and formal computation.

The geometric frame matters. Closure alone is portable, but it does not supply planar straight-sidedness, angle, length, or interior.

Structural Core vs. Domain Accent

The core consists of Cycle and Closure: a finite ordered chain returns to its start. The domain accent consists of points, straight segments, a plane, incidence, metric predicates, and conventions for self-intersection and interior.

No existing live node combines those features into a proper genus. Root status is therefore more precise than attaching Polygon to Closure as though it were a subtype.

Instantiates / Related Primes

Polygon instantiates Closure and cyclic organization, and particular polygons can instantiate Symmetry, Decomposition, and Constraint. These are structural characteristics rather than an immediate taxonomic parent.

Cyclic Quadrilateral, Heronian Triangle, and Hexagon are supported children. Polygon Partition is a decomposition procedure or result applied to polygons, not a polygon subtype.

Relationships to Other Abstractions

Current abstraction Polygon Domain-specific

Foundational — no parent edges in the catalog.

Children (4) — more specific cases that build on this

• Cyclic quadrilateral Domain-specific is a kind of Polygon

  It is a four-sided polygon whose vertices lie on a circle.

• Heronian triangle Domain-specific is a kind of Polygon

  It is a triangular polygon satisfying integer side and area conditions.

• Hexagon Domain-specific is a kind of Polygon

  It is a six-sided polygon.

▸ Show 1 more

Neighborhood in Abstraction Space

Polygon sits in a moderately populated region (46^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Graph Structures & Algorithms (24 abstractions)

Nearest neighbors

• Polyhedron — 0.88
• Even-hole-free graph — 0.88
• Desargues's Theorem — 0.87
• Loop (Graph Theory) — 0.86
• Regular Polygon — 0.86

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

• Polygonal chain. A sequence of joined segments. Tell: it need not be closed.
• Polygonal region. The filled interior plus boundary. Tell: a polygon can denote boundary only.
• Polyhedron. A three-dimensional surface or solid assembled from faces. Tell: polygons are its possible faces.
• Cycle graph. A combinatorial graph with cyclic adjacency. Tell: no straight planar realization is required.
• Reuleaux polygon. A constant-width curved figure built from arcs. Tell: its named boundary is not straight-sided.
• Polygonal approximation. A segmented representation of another shape. Tell: the represented target may be curved.

References

Encyclopedia of Mathematics. EMS Press. https://encyclopediaofmath.org/ registry

nLab. https://ncatlab.org/nlab/show/HomePage registry

Mathematical Reviews and zbMATH. Mathematics Subject Classification 2020. https://msc2020.org/ registry