How To Find Sides Of Regular Polygon

A regular polygon is a geometric shape defined by two strict conditions: all sides are equal in length (equilateral) and all interior angles are equal in measure (equiangular). Still, when you know one measurement, you can often derive the rest. This symmetry makes regular polygons—from the simple equilateral triangle to the complex chiliagon—uniquely predictable. Even so, "finding the sides" can mean two very different things: calculating the length of a side ($s$) when you know other properties like area or radius, or determining the number of sides ($n$) when you know angle measures.

Worth pausing on this one.

Mastering these calculations requires understanding the relationships between the side length, the apothem, the radius (circumradius), the perimeter, the area, and the central angles. Whether you are a student solving geometry homework, a woodworker cutting precise angles for a gazebo, or a programmer generating shapes for a simulation, this guide covers every standard method to find the sides of a regular polygon.

Understanding the Core Components

Before diving into formulas, visualize a regular polygon dissected into congruent isosceles triangles. Draw lines from the center to each vertex. This creates $n$ identical triangles, each with a vertex angle at the center of $\frac{360^\circ}{n}$ Which is the point..

Three radii define the polygon’s geometry:

• Circumradius ($R$): The distance from the center to a vertex (radius of the circumscribed circle).
• Inradius / Apothem ($a$): The perpendicular distance from the center to the midpoint of a side (radius of the inscribed circle).
• Side Length ($s$): The length of one edge.

The apothem bisects the central angle and the side length, creating two right triangles per sector. This right triangle—with legs $a$ and $\frac{s}{2}$, and hypotenuse $R$—is the "master key" for almost every calculation involving side length.

Scenario 1: Finding Side Length ($s$) from Radius or Apothem

This is the most common trigonometric approach. Because the apothem creates a right triangle with half the side, basic sine, cosine, and tangent functions apply directly.

Using the Circumradius ($R$)

In the right triangle, the angle at the center is half the central angle: $\frac{180^\circ}{n}$ (or $\frac{\pi}{n}$ radians). The opposite side to this angle is $\frac{s}{2}$, and the hypotenuse is $R$. $ \sin\left(\frac{180^\circ}{n}\right) = \frac{s/2}{R} $ Formula: $ s = 2R \sin\left(\frac{180^\circ}{n}\right) $ Use this when you know the radius of the circle passing through the vertices.

Using the Apothem / Inradius ($a$)

In the same right triangle, the adjacent side to the central half-angle is the apothem $a$, and the opposite side remains $\frac{s}{2}$. $ \tan\left(\frac{180^\circ}{n}\right) = \frac{s/2}{a} $ Formula: $ s = 2a \tan\left(\frac{180^\circ}{n}\right) $ Use this when you know the radius of the inscribed circle (or the distance from center to side midpoint).

Using the Perimeter ($P$)

If you know the total distance around the shape and the number of sides, the calculation is simple division. $ s = \frac{P}{n} $

Scenario 2: Finding Side Length ($s$) from Area ($A$)

Area problems are frequent in standardized tests and practical design. In real terms, find Perimeter: $P = \frac{2A}{a}$. The standard area formula for a regular polygon is: $ A = \frac{1}{2} a P = \frac{1}{2} a (n s) $ Since $a = \frac{s}{2 \tan(\pi/n)}$, we can substitute to get area purely in terms of $s$ and $n$: $ A = \frac{n s^2}{4 \tan(\pi/n)} $ Solving for $s$: $ s = \sqrt{\frac{4A \tan(\pi/n)}{n}} $ Alternatively, if you are given the Area ($A$) and the Apothem ($a$) but not $n$:

1. You still need $n$ to find $s$ ($s = P/n$). On the flip side, 2. Without $n$, you cannot isolate $s$ from Area and Apothem alone.

Scenario 3: Finding the Number of Sides ($n$)

Sometimes the "side" you are looking for is the count of sides ($n$). This shifts the problem from algebra to trigonometry/algebra involving inverse functions Worth keeping that in mind. Still holds up..

Method A: Given Interior Angle

The formula for a single interior angle ($I$) of a regular polygon is: $ I = \frac{(n-2) \times 180^\circ}{n} $ Solving for $n$: $ nI = 180n - 360 $ $ 180n - nI = 360 $ $ n(180 - I) = 360 $ $ n = \frac{360}{180 - I} $ Check: The result must be an integer $\ge 3$. If $I = 140^\circ$, $n = 360/40 = 9$ (Nonagon).

Method B: Given Exterior Angle

Exterior angles ($E$) are supplementary to interior angles ($E = 180 - I$). The sum of exterior angles is always $360^\circ$. $ n = \frac{360^\circ}{E} $ This is often faster. If the exterior angle is $30^\circ$, $n = 12$ (Dodecagon).

Method C: Given Side Length ($s$) and Radius ($R$) or Apothem ($a$)

If you have physical measurements of a constructed object (e.g., a machined part), you can find $n$ using inverse trig functions. From $s = 2R \sin(\pi/n)$: $ \sin(\pi/n) = \frac{s}{2R} $ $ \pi/n = \arcsin(s / 2R) $ $ n = \frac{\pi}{\arcsin(s / 2R)} $ Calculate the value and round to the nearest integer.

From $s = 2a \tan(\pi/n)$: $ n = \frac{\pi}{\arctan(s / 2a)} $

Method D: Given Area ($A$) and Side Length ($s$) (Trial/Iteration)

There is no closed-form algebraic solution for $n$ in the area formula $A = \frac{n s^2}{4 \tan(\pi/n)}$ because $n$ appears both inside and outside the trigonometric function. You must use numerical iteration or a lookup table.

1. Rearrange: $\frac{4A}{s^2} = n \cot(\pi/n)$.
2. Test integer values of $n$ (3, 4, 5...) until the Right Hand Side matches the Left Hand Side constant.

Scenario 4: Coordinate Geometry (Vertices on a Plane)

In computer graphics, CAD, or game development, "finding the sides" often means calculating the Cartesian coordinates $(x, y)$ of the vertices to draw the edges No workaround needed..

Assuming a polygon centered at $(0,0)$ with circumradius $R$ and one vertex at angle $\theta_0$ (usually $90^\circ$ or $0^\circ

$0^\circ$ for standard orientation), the coordinates of the $k$-th vertex ($k = 0, 1, \dots, n-1$) are:

$ x_k = R \cos\left(\theta_0 + \frac{2\pi k}{n}\right) $ $ y_k = R \sin\left(\theta_0 + \frac{2\pi k}{n}\right) $

The "Side" as a Vector: The vector representing the $k$-th side (from vertex $k$ to vertex $k+1$) is: $ \vec{v}k = (x{k+1} - x_k,\ y_{k+1} - y_k) $ The length of this vector confirms the side length $s = 2R \sin(\pi/n)$.

Rotation and Translation: To position the polygon at center $(h, k)$ with a rotation offset $\phi$: $ x_k = h + R \cos\left(\phi + \frac{2\pi k}{n}\right) $ $ y_k = k + R \sin\left(\phi + \frac{2\pi k}{n}\right) $ This parametric form is the standard implementation for rendering regular polygons in shaders (GLSL/HLSL), SVG path generation (<polygon points="...">), and CNC toolpath generation And it works..

Scenario 5: The "Inverse" Problem — Polygon Reconstruction from Noisy Data

In engineering metrology, computer vision, and GIS, you often possess a set of discrete, noisy coordinate points ${(x_i, y_i)}$ sampled from the boundary of a supposedly regular polygon. "Finding the sides" here means regularization: estimating the true $n$, center $(h,k)$, radius $R$, and rotation $\phi$ that best fit the data.

1. Estimating $n$ (Model Selection)

• Fourier Descriptor / Spectral Analysis: Compute the centroid of the point cloud. Convert boundary points to a radius-angle function $r(\theta)$. Perform an FFT. The dominant harmonic frequency corresponds to $n$.
• Hough Transform for Polygons: Parameterize lines in Hough space ($\rho, \theta$). Peaks in the accumulator array correspond to sides. The number of distinct, equally spaced angular peaks ($\Delta\theta = \pi/n$) yields $n$.
• Minimum Description Length (MDL) / BIC: Fit models for $n=3, 4, \dots, N_{max}$. Penalize complexity to avoid overfitting noise as extra sides.

2. Parameter Estimation (Given $n$)

Once $n$ is hypothesized, solve for the geometric parameters $(h, k, R, \phi)$ via Non-linear Least Squares (e.g., Levenberg-Marquardt) minimizing the orthogonal distance from points to the theoretical edges: $ \min_{h,k,R,\phi} \sum_i \text{dist}\left( (x_i, y_i),\ \text{Polygon}(h,k,R,\phi,n) \right)^2 $ A reliable initial guess is critical:

• Center $(h,k)$: Mean of points (centroid) or center of Minimum Bounding Box.
• Radius $R$: Mean distance from center to points.
• Rotation $\phi$: Angle of the first principal component (PCA) aligned to the nearest symmetry axis ($2\pi/n$).

3. Side Line Equations

The final output—the equations of the $n$ sides in Hesse normal form ($x\cos\alpha_j + y\sin\alpha_j = p_j$)—are derived directly from the optimized parameters: $ \alpha_j = \phi + \frac{\pi}{n} + \frac{2\pi j}{n} \quad (\text{normal angle}) $ $ p_j = h\cos\alpha_j + k\sin\alpha_j + R\cos(\pi/n) \quad (\text{distance from origin}) $ This yields the precise, infinite lines containing the polygon edges, suitable for CAD constraint solving or tolerance analysis.

Summary Reference Table