The Four Bars Problem

TL;DR

This paper investigates how four-bar linkages can be reconfigured using a 'pop' operation, showing under certain conditions that pops can reach all configurations accessible by smooth motion, with implications for mechanism reconfiguration.

Contribution

It demonstrates that for specific bar length conditions, pops can replicate smooth reconfigurations in four-bar linkages, expanding understanding of discrete reconfiguration methods.

Findings

Pops can reach the same neighborhood of configurations as smooth motions under certain conditions.

The proof uses a circle map with irrational rotation number to establish reachability.

The result applies to four-bar linkages with specific length constraints.

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.