A linear-time construction of Reuleaux polygons (Q2365262): Difference between revisions

A Reuleaux polygon \(C\) with \(n\) vertices is a planar convex set of constant width with the following properties: \(\partial C\) contains a set \(V\) of \(n\) points, the vertices, such that every diameter of \(C\) has an end in \(V\); and \(\partial C\) contains no such set of \(n-1\) points. The authors describe two algorithms for the construction of Reuleaux polygons with \(n\) vertices; the first is quadratic and the second is linear in \(n\). Each Reuleaux polygon can potentially be obtained by these constructions. The algorithms are based on a one-to-one correspondence between Reuleaux polygons and planar geometric graphs which are full equi-intersectors.