Graphical Solution of the Branch and Order Problems of Linkage Synthesis for Multiply Separated Positions

Abstract

The graphical solutions to the order and branch problems previously developed for the P-P-P-P case are extended to cover all finitely separated, infinitesimally separated, and multiply separated four-bar Burmester synthesis problems. Two examples are given in detail: a P-P-P-P-P problem and a PP-P-P problem.