# Dual polygon

In geometry, polygons are associated into pairs called **duals**, where the vertices of one correspond to the edges of the other.

The dual of an isogonal (vertex-transitive) polygon is an isotoxal (edge-transitive) polygon. For example, the (isogonal) rectangle and (isotoxal) rhombus are duals.

In a cyclic polygon, longer sides correspond to larger exterior angles in the dual (a tangential polygon), and shorter sides to smaller angles.^{[citation needed]} Further, congruent sides in the original polygon yields congruent angles in the dual, and conversely. For example, the dual of a highly acute isosceles triangle is an obtuse isosceles triangle.

In the Dorman Luke construction, each face of a dual polyhedron is the dual polygon of the corresponding vertex figure.

As an example of the side-angle duality of polygons we compare properties of the cyclic and tangential quadrilaterals.^{[1]}

This duality is perhaps even more clear when comparing an isosceles trapezoid to a kite.

The simplest qualitative construction of a dual polygon is a rectification operation, where the edges of a polygon are truncated down to vertices at the center of each original edge. New edges are formed between these new vertices.

This construction is not reversible. That is, the polygon generated by applying it twice is in general not similar to the original polygon.

As with dual polyhedra, one can take a circle (be it the inscribed circle, circumscribed circle, or if both exist, their midcircle) and perform polar reciprocation in it.

Under projective duality, the dual of a point is a line, and of a line is a point – thus the dual of a polygon is a polygon, with edges of the original corresponding to vertices of the dual and conversely.

From the point of view of the dual curve, where to each point on a curve one associates the point dual to its tangent line at that point, the projective dual can be interpreted thus:

Combinatorially, one can define a polygon as a set of vertices, a set of edges, and an incidence relation (which vertices and edges touch): two adjacent vertices determine an edge, and dually, two adjacent edges determine a vertex. Then the dual polygon is obtained by simply switching the vertices and edges.

This is not a particularly fruitful avenue, as combinatorially, there is a single family of polygons (given by number of sides); geometric duality of polygons is more varied, as are combinatorial dual polyhedra.