The four bars problem
From MaRDI portal
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Kinematics of mechanisms and robots (70B15) Combinatorial aspects of finite geometries (05B25) Dynamical systems involving maps of the circle (37E10) Polyhedral manifolds (52B70) Dynamical systems in solid mechanics (37N15)
Abstract: A four-bar linkage is a mechanism consisting of four rigid bars which are joined by their endpoints in a polygonal chain and which can rotate freely at the joints (or vertices). We assume that the linkage lies in the 2-dimensional plane so that one of the bars is held horizontally fixed. In this paper we consider the problem of reconfiguring a four-bar linkage using an operation called a emph{pop}. Given a polygonal cycle, a pop reflects a vertex across the line defined by its two adjacent vertices along the polygonal chain. Our main result shows that for certain conditions on the lengths of the bars of the four-bar linkage, the neighborhood of any configuration that can be reached by smooth motion can also be reached by pops. The proof relies on the fact that pops are described by a map on the circle with an irrational number of rotation.
Recommendations
Cited in
(3)
This page was built for publication: The four bars problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821957)
