Method of cut-set matrix with modulo-2 operation is used to enumerate all possible tree graphs from a given tree graph. The typical kinematic chains corresponding to the tree graphs are the chains with cams and gears. The equations used to find the number of heavy edges (corresponding to cam or gear joints) and fine edges (corresponding to turning joints) required in the tree graphs are presented. A table of tree graphs and their corresponding cam kinematic chains is prepared. The method is potentially promising for computer-aided design application because of its simplicity, compact notation, and high degree of organization.

This content is only available via PDF.
You do not currently have access to this content.