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.
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.
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.
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.
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.
-
Regular Polygon Domain-specific is a kind of Polygon
A regular polygon is a closed straight-edge planar polygon with uniform vertex orbit and repeated edge step.
Neighborhood in Abstraction Space¶
Polygon sits in a moderately populated region (46th 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