No label defined (Q4797604)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1877248
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1877248

      Statements

      0 references
      0 references
      13 November 2003
      0 references
      flexible structure
      0 references
      opening a convex chain linkage
      0 references
      ruler folding
      0 references
      locked tree linkage of Biedl
      0 references
      flipping a pocket
      0 references
      deflation
      0 references
      deflated polygon
      0 references
      flipturn
      0 references
      locked knitting needles chain
      0 references
      locked polygon of Biedl
      0 references
      locked hexagon
      0 references
      four-bar mechanism
      0 references
      Peacellier's inversor
      0 references
      Verdier's model
      0 references
      Verdier's planar model
      0 references
      pivot on the planar model
      0 references
      To convexify a polygon is to reconfigure it with respect to a given set of operations until the polygon becomes convex. The authors survey (1) the problem of unfolding linkages in the plane and in the Euclidean 3-space, summarizing work by mathematicians, kinematic engineers, and polymer physicists, and (2) the problem of convexifying polygons with flips and flipturns. The list of references contains 86 items. For the entire collection see [Zbl 1003.00020].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references