# Axiality (geometry)

In the geometry of the Euclidean plane, axiality is a measure of how much axial symmetry a shape has. It is defined as the ratio of areas of the largest axially symmetric subset of the shape to the whole shape. Equivalently it is the largest fraction of the area of the shape that can be covered by a mirror reflection of the shape (with any orientation).
A shape that is itself axially symmetric, such as an isosceles triangle, will have an axiality of exactly one, whereas an asymmetric shape, such as a scalene triangle, will have axiality less than one.

## Upper and lower bounds

Lassak (2002) showed that every convex set has axiality at least 2/3. This result improved a previous lower bound of 5/8 by Krakowski (1963). The best upper bound known is given by a particular convex quadrilateral, found through a computer search, whose axiality is less than 0.816.
For triangles and for centrally symmetric convex bodies, the axiality is always somewhat higher: every triangle, and every centrally symmetric convex body, has axiality at least $2({\sqrt {2}}-1)\approx 0.828$. In the set of obtuse triangles whose vertices have $x$-coordinates $0$, ${\sqrt {2}}$, and $1$, the axiality approaches $2({\sqrt {2}}-1)$ in the limit as the $y$-coordinates approach zero, showing that the lower bound is as large as possible. It is also possible to construct a sequence of centrally symmetric parallelograms whose axiality has the same limit, again showing that the lower bound is tight.

## Algorithms

The axiality of a given convex shape can be approximated arbitrarily closely in sublinear time, given access to the shape by oracles for finding an extreme point in a given direction and for finding the intersection of the shape with a line.
Barequet & Rogol (2007) consider the problem of computing the axiality exactly, for both convex and non-convex polygons. The set of all possible reflection symmetry lines in the plane is (by projective duality) a two-dimensional space, which they partition into cells within which the pattern of crossings of the polygon with its reflection is fixed, causing the axiality to vary smoothly within each cell. They thus reduce the problem to a numerical computation within each cell, which they do not solve explicitly. The partition of the plane into cells has $O(n^{4})$ cells in the general case, and $O(n^{3})$ cells for convex polygons; it can be constructed in an amount of time which is larger than these bounds by a logarithmic factor. Barequet and Rogol claim that in practice the area maximization problem within a single cell can be solved in $O(n)$ time, giving (non-rigorous) overall time bounds of $O(n^{4})$ for the convex case and $O(n^{5})$ for the general case.

## Related concepts

de Valcourt (1966) lists 11 different measures of axial symmetry, of which the one described here is number three. He requires each such measure to be invariant under similarity transformations of the given shape, to take the value one for symmetric shapes, and to take a value between zero and one for other shapes. Other symmetry measures with these properties include the ratio of the area of the shape to its smallest enclosing symmetric superset, and the analogous ratios of perimeters.
Lassak (2002), as well as studying axiality, studies a restricted version of axiality in which the goal is to find a halfspace whose intersection with a convex shape has large area lies entirely within the reflection of the shape across the halfspace boundary. He shows that such an intersection can always be found to have area at least 1/8 that of the whole shape.
In the study of computer vision, Marola (1989) proposed to measure the symmetry of a digital image (viewed as a function $w$ from points in the plane to grayscale intensity values in the interval $0\leq w(p)\leq 1$) by finding a reflection $\sigma$ that maximizes the area integral
    ${\frac {\int \int w(p)w(\sigma (p))dx\,dy}{\int \int w(p)^{2}dx\,dy}}.$
When $w$ is the indicator function of a given shape, this is the same as the axiality.