Reinhardt polygon

Last updated September 13, 2022

In geometry, a Reinhardt polygon is an equilateral polygon inscribed in a Reuleaux polygon. As in the regular polygons, each vertex of a Reinhardt polygon participates in at least one defining pair of the diameter of the polygon. Reinhardt polygons with $n$ sides exist, often with multiple forms, whenever $n$ is not a power of two. Among all polygons with $n$ sides, the Reinhardt polygons have the largest possible perimeter for their diameter, the largest possible width for their diameter, and the largest possible width for their perimeter. They are named after Karl Reinhardt, who studied them in 1922.^[1]^[2]

Definition and construction

A Reuleaux polygon is a convex shape with circular-arc sides, each centered on a vertex of the shape and all having the same radius; an example is the Reuleaux triangle. These shapes are curves of constant width. Some Reuleaux polygons have side lengths that are irrational multiples of each other, but if a Reuleaux polygon has sides that can be partitioned into a system of arcs of equal length, then the polygon formed as the convex hull of the endpoints of these arcs is defined as a Reinhardt polygon. Necessarily, the vertices of the underlying Reuleaux polygon are also endpoints of arcs and vertices of the Reinhardt polygon, but the Reinhardt polygon may also have additional vertices, interior to the sides of the Reuleaux polygon.^[3]

If $n$ is a power of two, then it is not possible to form a Reinhardt polygon with $n$ sides. If $n$ is an odd number, then the regular polygon with $n$ sides is a Reinhardt polygon. Any other natural number must have an odd divisor $d$ , and a Reinhardt polygon with $n$ sides may be formed by subdividing each arc of a regular $d$ -sided Reuleaux polygon into $n/d$ smaller arcs. Therefore, the possible numbers of sides of Reinhardt polygons are the polite numbers, numbers that are not powers of two. When $n$ is an odd prime number, or two times a prime number, there is only one shape of $n$ -sided Reinhardt polygon, but all other values of $n$ have Reinhardt polygons with multiple shapes.^[1]

Dimensions and optimality

The diameter pairs of a Reinhardt polygon form many isosceles triangles with the sides of the triangle, with apex angle $\pi /n$ , from which the dimensions of the polygon may be calculated. If the side length of a Reinhardt polygon is 1, then its perimeter is just $n$ . The diameter of the polygon (the longest distance between any two of its points) equals the side length of these isosceles triangles, $1/2\sin(\pi /2n)$ . The curves of constant width of the polygon (the shortest distance between any two parallel supporting lines) equals the height of this triangle, $1/2\tan(\pi /2n)$ . These polygons are optimal in three ways:

They have the largest possible perimeter among all $n$ -sided polygons with their diameter, and the smallest possible diameter among all $n$ -sided polygons with their perimeter.^[1]
They have the largest possible width among all $n$ -sided polygons with their diameter, and the smallest possible diameter among all $n$ -sided polygons with their width.^[1]
They have the largest possible width among all $n$ -sided polygons with their perimeter, and the smallest possible perimeter among all $n$ -sided polygons with their width.^[1]

The relation between perimeter and diameter for these polygons was proven by Reinhardt,^[4] and rediscovered independently multiple times.^[5]^[6] The relation between diameter and width was proven by Bezdek and Fodor in 2000; their work also investigates the optimal polygons for this problem when the number of sides is a power of two (for which Reinhardt polygons do not exist).^[7]

Symmetry and enumeration

The $n$ -sided Reinhardt polygons formed from $d$ -sided regular Reuleaux polygons are symmetric: they can be rotated by an angle of $2\pi /d$ to obtain the same polygon. The Reinhardt polygons that have this sort of rotational symmetry are called periodic, and Reinhardt polygons without rotational symmetry are called sporadic. If $n$ is a semiprime, or the product of a power of two with an odd prime power, then all $n$ -sided Reinhardt polygons are periodic. In the remaining cases, when $n$ has two distinct odd prime factors and is not the product of these two factors, sporadic Reinhardt polygons also exist.^[2]

For each $n$ , there are only finitely many distinct $n$ -sided Reinhardt polygons.^[3] If $p$ is the smallest prime factor of $n$ , then the number of distinct $n$ -sided periodic Reinhardt polygons is

{\frac {p2^{n/p}}{4n}}{\bigl (}1+o(1){\bigr )},

where the $o(1)$ term uses little O notation. However, the number of sporadic Reinhardt polygons is less well-understood, and for most values of $n$ the total number of Reinhardt polygons is dominated by the sporadic ones.^[2]

The numbers of these polygons for small values of $n$ (counting two polygons as the same when they can be rotated or flipped to form each other) are:^[1]

$n$ :	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20	21	22	23	24
#:	1	0	1	1	1	0	2	1	1	2	1	1	5	0	1	5	1	2	10	1	1	12

Related Research Articles

Area is the quantity that expresses the extent of a region on the plane or on a curved surface. The area of a plane region or plane area refers to the area of a shape or planar lamina, while surface area refers to the area of an open surface or the boundary of a three-dimensional object. Area can be understood as the amount of material with a given thickness that would be necessary to fashion a model of the shape, or the amount of paint necessary to cover the surface with a single coat. It is the two-dimensional analogue of the length of a curve or the volume of a solid.

<span class="mw-page-title-main">Circle</span> Simple curve of Euclidean geometry

A circle is a shape consisting of all points in a plane that are at a given distance from a given point, the centre. Equivalently, it is the curve traced out by a point that moves in a plane so that its distance from a given point is constant. The distance between any point of the circle and the centre is called the radius. Usually, the radius is required to be a positive number. A circle with $is a degenerate case. This article is about circles in Euclidean geometry, and, in particular, the Euclidean plane, except where otherwise noted.$

In geometry, a polygon is a plane figure that is described by a finite number of straight line segments connected to form a closed polygonal chain. The bounded plane region, the bounding circuit, or the two together, may be called a polygon.

A perimeter is a closed path that encompasses, surrounds, or outlines either a two dimensional shape or a one-dimensional length. The perimeter of a circle or an ellipse is called its circumference.

<span class="mw-page-title-main">Kite (geometry)</span> Quadrilateral symmetric across a diagonal

In Euclidean geometry, a kite is a quadrilateral with reflection symmetry across a diagonal. Because of this symmetry, a kite has two equal angles and two pairs of adjacent equal-length edges. Kite quadrilaterals are named for the wind-blown, flying kites, which often have this shape and which are in turn named for a bird. Kites are also known as deltoids, but the word "deltoid" may also refer to a deltoid curve, an unrelated geometric object sometimes studied in connection with quadrilaterals. A kite may also be called a dart, particularly if it is not convex.

In geometry, an equilateral polygon is a polygon which has all sides of the same length. Except in the triangle case, an equilateral polygon does not need to also be equiangular, but if it does then it is a regular polygon. If the number of sides is at least five, an equilateral polygon does not need to be a convex polygon: it could be concave or even self-intersecting.

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular and equilateral. Regular polygons may be either convex, star or skew. In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon, if the edge length is fixed.

In geometry, a diagonal is a line segment joining two vertices of a polygon or polyhedron, when those vertices are not on the same edge. Informally, any sloping line is called diagonal. The word diagonal derives from the ancient Greek διαγώνιος diagonios, "from angle to angle" ; it was used by both Strabo and Euclid to refer to a line connecting two vertices of a rhombus or cuboid, and later adopted into Latin as diagonus.

In geometry, a heptagon or septagon is a seven-sided polygon or 7-gon.

In geometry, a curve of constant width is a simple closed curve in the plane whose width is the same in all directions. The shape bounded by a curve of constant width is a body of constant width or an orbiform, the name given to these shapes by Leonhard Euler. Standard examples are the circle and the Reuleaux triangle. These curves can also be constructed using circular arcs centered at crossings of an arrangement of lines, as the involutes of certain curves, or by intersecting circles centered on a partial curve.

Reuleaux triangle Curved triangle with constant width

A Reuleaux triangle[ʁœlo] is a curved triangle with constant width, the simplest and best known curve of constant width other than the circle. It is formed from the intersection of three circular disks, each having its center on the boundary of the other two. Constant width means that the separation of every two parallel supporting lines is the same, independent of their orientation. Because all its diameters are the same, the Reuleaux triangle is one answer to the question "Other than a circle, what shape can a manhole cover be made so that it cannot fall down through the hole?"

In geometry, Barbier's theorem states that every curve of constant width has perimeter $π$ times its width, regardless of its precise shape. This theorem was first published by Joseph-Émile Barbier in 1860.

In Euclidean geometry, a square is a regular quadrilateral, which means that it has four equal sides and four equal angles. It can also be defined as a rectangle with two equal-length adjacent sides. It is the only regular polygon whose internal angle, central angle, and external angle are all equal (90°), and whose diagonals are all equal in length. A square with vertices ABCD would be denoted $ABCD .$

<span class="mw-page-title-main">Reuleaux polygon</span> Constant-width curve of equal-radius arcs

In geometry, a Reuleaux polygon is a curve of constant width made up of circular arcs of constant radius. These shapes are named after their prototypical example, the Reuleaux triangle, which in turn, is named after 19th-century German engineer Franz Reuleaux. The Reuleaux triangle can be constructed from an equilateral triangle by connecting each two vertices by a circular arc centered on the third vertex, and Reuleaux polygons can be formed by a similar construction from any regular polygon with an odd number of sides, or from certain irregular polygons. Every curve of constant width can be accurately approximated by Reuleaux polygons. They have been applied in coinage shapes.

In geometry, the area enclosed by a circle of radius $r$ is $π r 2$ . Here the Greek letter $π$ represents the constant ratio of the circumference of any circle to its diameter, approximately equal to 3.14159.

Reuleaux tetrahedron Shape formed by intersecting four balls

The Reuleaux tetrahedron is the intersection of four balls of radius s centered at the vertices of a regular tetrahedron with side length s. The spherical surface of the ball centered on each vertex passes through the other three vertices, which also form vertices of the Reuleaux tetrahedron. Thus the center of each ball is on the surfaces of the other three balls. The Reuleaux tetrahedron has the same face structure as a regular tetrahedron, but with curved faces: four vertices, and four curved faces, connected by six circular-arc edges.

In plane geometry the Blaschke–Lebesgue theorem states that the Reuleaux triangle has the least area of all curves of given constant width. In the form that every curve of a given width has area at least as large as the Reuleaux triangle, it is also known as the Blaschke–Lebesgue inequality. It is named after Wilhelm Blaschke and Henri Lebesgue, who published it separately in the early 20th century.

In discrete geometry, an opaque set is a system of curves or other set in the plane that blocks all lines of sight across a polygon, circle, or other shape. Opaque sets have also been called barriers, beam detectors, opaque covers, or opaque forests. Opaque sets were introduced by Stefan Mazurkiewicz in 1916, and the problem of minimizing their total length was posed by Frederick Bagemihl in 1959.

In geometry, a fat object is an object in two or more dimensions, whose lengths in the different dimensions are similar. For example, a square is fat because its length and width are identical. A 2-by-1 rectangle is thinner than a square, but it is fat relative to a 10-by-1 rectangle. Similarly, a circle is fatter than a 1-by-10 ellipse and an equilateral triangle is fatter than a very obtuse triangle.

In plane geometry the Kovner–Besicovitch measure is a number defined for any bounded convex set describing how close to being centrally symmetric it is. It is the fraction of the area of the set that can be covered by its largest centrally symmetric subset.

References

1 2 3 4 5 6 Mossinghoff, Michael J. (2011), "Enumerating isodiametric and isoperimetric polygons", Journal of Combinatorial Theory , Series A, 118 (6): 1801–1815, doi: 10.1016/j.jcta.2011.03.004 , MR 2793611
1 2 3 Hare, Kevin G.; Mossinghoff, Michael J. (2019), "Most Reinhardt polygons are sporadic", Geometriae Dedicata , 198: 1–18, arXiv: 1405.5233 , doi:10.1007/s10711-018-0326-5, MR 3933447, S2CID 119629098
1 2 Datta, Basudeb (1997), "A discrete isoperimetric problem", Geometriae Dedicata, 64 (1): 55–68, doi:10.1023/A:1004997002327, MR 1432534, S2CID 118797507
↑ Reinhardt, Karl (1922), "Extremale Polygone gegebenen Durchmessers", Jahresbericht der Deutschen Mathematiker-Vereinigung, 31: 251–270
↑ Vincze, Stephen (1950), "On a geometrical extremum problem", Acta Universitatis Szegediensis, 12: 136–142, MR 0038087
↑ Larman, D. G.; Tamvakis, N. K. (1984), "The decomposition of the $n$ -sphere and the boundaries of plane convex domains", Convexity and graph theory (Jerusalem, 1981), North-Holland Math. Stud., vol. 87, Amsterdam: North-Holland, pp. 209–214, doi:10.1016/S0304-0208(08)72828-7, MR 0791034
↑ Bezdek, A.; Fodor, F. (2000), "On convex polygons of maximal width", Archiv der Mathematik, 74 (1): 75–80, doi:10.1007/PL00000413, MR 1728365, S2CID 123299791

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[m-1] 1 2 3 4 5 6 Mossinghoff, Michael J. (2011), "Enumerating isodiametric and isoperimetric polygons", Journal of Combinatorial Theory , Series A, 118 (6): 1801–1815, doi: 10.1016/j.jcta.2011.03.004 , MR 2793611

[hm-2] 1 2 3 Hare, Kevin G.; Mossinghoff, Michael J. (2019), "Most Reinhardt polygons are sporadic", Geometriae Dedicata , 198: 1–18, arXiv: 1405.5233 , doi:10.1007/s10711-018-0326-5, MR 3933447, S2CID 119629098

[d-3] 1 2 Datta, Basudeb (1997), "A discrete isoperimetric problem", Geometriae Dedicata, 64 (1): 55–68, doi:10.1023/A:1004997002327, MR 1432534, S2CID 118797507

[r-4] Reinhardt, Karl (1922), "Extremale Polygone gegebenen Durchmessers", Jahresbericht der Deutschen Mathematiker-Vereinigung, 31: 251–270

[v-5] Vincze, Stephen (1950), "On a geometrical extremum problem", Acta Universitatis Szegediensis, 12: 136–142, MR 0038087

[lt-6] Larman, D. G.; Tamvakis, N. K. (1984), "The decomposition of the $n$ -sphere and the boundaries of plane convex domains", Convexity and graph theory (Jerusalem, 1981), North-Holland Math. Stud., vol. 87, Amsterdam: North-Holland, pp. 209–214, doi:10.1016/S0304-0208(08)72828-7, MR 0791034

[bf-7] Bezdek, A.; Fodor, F. (2000), "On convex polygons of maximal width", Archiv der Mathematik, 74 (1): 75–80, doi:10.1007/PL00000413, MR 1728365, S2CID 123299791

[1]

[2]

[3]

[4]

[5]

[6]

[7]