Abstract
The complete set of 12-bar planar simple-jointed kinematic chains is enumerated using the stratified or hierarchical representation- of Fang and Freudenstien (1990) in which post-priori isomorphism testing is not needed. This is achieved by directly enumerating the simplified and contracted graphs from which the kinematic chains are built up. The number obtained is compared with those from previous studies, and the list is catagorized by the link sets and by the numbers of major vertices and edges in the simplified graphs. A major feature of the technique is the use of an efficient rule-based technique for eliminating degenerate chains.
Original language | English (US) |
---|---|
Pages | 471-480 |
Number of pages | 10 |
DOIs | |
State | Published - 2002 |
Externally published | Yes |
Event | 27th Biennial Mechanisms and Robotics Conference - Montreal, Que., Canada Duration: Sep 29 2002 → Oct 2 2002 |
Conference
Conference | 27th Biennial Mechanisms and Robotics Conference |
---|---|
Country/Territory | Canada |
City | Montreal, Que. |
Period | 9/29/02 → 10/2/02 |
ASJC Scopus subject areas
- General Engineering
- Computer Networks and Communications
- Information Systems