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

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Yaakov S. Kupitz / rank
Normal rank
 
Property / author
 
Property / author: Brigitte Wegner / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Egon Schulte / rank
Normal rank
 

Revision as of 21:09, 10 February 2024

scientific article
Language Label Description Also known as
English
A linear-time construction of Reuleaux polygons
scientific article

    Statements

    A linear-time construction of Reuleaux polygons (English)
    0 references
    0 references
    18 November 1997
    0 references
    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.
    0 references
    \(n\) vertices
    0 references
    Reuleaux polygon
    0 references
    constant width
    0 references
    algorithms
    0 references
    equi-intersectors
    0 references

    Identifiers