Regular Polygon¶
A Euclidean polygon whose equally spaced vertices follow one constant edge-connection step, giving a connected rotationally symmetric boundary.
Core Idea¶
A regular polygon is a Euclidean closed straight-edge cycle built from equally spaced vertices around one center and a repeated connection step. Joining neighbors gives a convex \(\{n\}\); under a convention admitting self-intersection, joining every coprime \(m\)-th vertex gives a connected regular star \(\{n/m\}\). The repetition makes vertices and edges symmetry-equivalent, not merely equal-looking.[ref-eff2a97613db][ref-db11ddc4ba24]
Scope of Application¶
Squares and regular hexagons occur in regular Euclidean tilings, while the pentagram \(\{5/2\}\) connects every second of five equally spaced circular vertices. The convex interior-angle and plane-tiling claims do not transfer automatically to self-intersecting stars. A noncoprime step can produce several disconnected cycles rather than one polygon.[ref-db11ddc4ba24][ref-e22bb08fff1f]
Clarity¶
Let \(v_j\) be points separated by \(2\pi/n\) around a circle and join \(v_j\) to \(v_{j+m}\). The connection visits every vertex exactly when \(\gcd(n,m)=1\). Step one gives the ordinary convex polygon; \(n=5,m=2\) gives the pentagram. Merely equal side lengths or merely having vertices on a circle does not establish the full repeated structure.[ref-eff2a97613db][ref-db11ddc4ba24]
Manages Complexity¶
The parameters \(n,m\), center, radius and initial direction generate the whole vertex-edge configuration. Symmetry permits one edge or vertex to stand in for many geometric checks. But the compact notation hides whether the boundary is simple or star-shaped, so its interior convention must be stated.[ref-eff2a97613db][ref-db11ddc4ba24]
Abstract Reasoning¶
Rotation by \(2\pi/n\) maps each edge \((v_j,v_{j+m})\) to another edge of the same cycle, making regularity a whole-figure invariant. If \(n\) and \(m\) share a divisor, repeated stepping returns early and leaves multiple cycles; equal repeated chords alone then do not give one connected regular polygon.[^ref-db11ddc4ba24]
Knowledge Transfer¶
A square tile \(\{4\}\) and pentagram \(\{5/2\}\) share a polygonal carrier, equal-turn vertex orbit, fixed connected step and repeated symmetry. Tiling is a use of the convex square; self-intersection is admitted for the star. The common construction transfers, not the convex interior formulas.[ref-eff2a97613db][ref-db11ddc4ba24][^ref-e22bb08fff1f]
[^ref-eff2a97613db]: Eric W. Weisstein, “Regular Polygon,” MathWorld. [^ref-db11ddc4ba24]: Eric W. Weisstein, “Star Polygon,” MathWorld, construction and coprime-step distinction. [^ref-e22bb08fff1f]: Eric W. Weisstein, “Regular Tessellation,” MathWorld, three Euclidean regular tilings.
Relationships to Other Abstractions¶
Current abstraction Regular Polygon Domain-specific
Parents (1) — more general patterns this builds on
-
Regular Polygon is a kind of Polygon Domain-specific
A regular polygon is a closed straight-edge planar polygon with uniform vertex orbit and repeated edge step.
Hierarchy path (1) — routes to 1 parentless root
- Regular Polygon → Polygon
Neighborhood in Abstraction Space¶
Regular Polygon sits in a sparse region of the domain-specific corpus (66th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Geometric Figures & Constructions (32 abstractions)
Nearest neighbors
- Polygon — 0.86
- Uniform polyhedron — 0.85
- Reuleaux polygon — 0.84
- Hexagon — 0.84
- Ideal polyhedron — 0.84
Computed from structural-signature embeddings · 2026-10-08