• CN：11-2187/TH
• ISSN：0577-6686

›› 2005, Vol. 41 ›› Issue (8): 140-143.

• 论文 •

平面图形放缩机构

1. 北京邮电大学自动化学院
• 发布日期:2005-08-15

MECHANISMS FOR SCALING PLANAR GRAPHS

Liao Qizheng;Li Duanling

1. Automation School, Beijing University of Posts and Telecommunications
• Published:2005-08-15

Abstract: Traditional pantograph mechanism consists of a parallelogram with two extended sides. It can scale the distance from the pole to a given point. However it can not scale the distance between any given points. This goal is achieved by using inter-connected multi parallelograms with a link chosen as a driver. The result is a class of linkages that can enlarge or shrink a planar graph by driving a revolute pair. These mechan- isms can be single degree-of-freedom or over-constrained.