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 postpriori 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 rote-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 | ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC/CIE 2002 - Montreal, Canada Duration: Sep 29 2002 → Oct 2 2002 |
Conference
Conference | ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC/CIE 2002 |
---|---|
Country/Territory | Canada |
City | Montreal |
Period | 9/29/02 → 10/2/02 |
ASJC Scopus subject areas
- Mechanical Engineering
- Computer Graphics and Computer-Aided Design
- Computer Science Applications
- Modeling and Simulation