For a common class of 2D mechanisms called 1-dof tree decomposable linkages, we present a software CayMos which uses new theoretical results to implement efficient algorithmic solutions for: (a) meaningfully representing and visualizing the connected components in the Euclidean realization space; (b) finding a path of continuous motion between two realizations in the same connected component, with or without restricting the realization type (sometimes called orientation type); (c) finding two ``closest'' realizations in different connected components.
@article{arxiv.1402.7347,
title = {Cayley Analysis of Mechanism Configuration Spaces using CayMos: Software Functionalities and Architecture},
author = {Menghan Wang and Meera Sitharam},
journal= {arXiv preprint arXiv:1402.7347},
year = {2014}
}
Comments
arXiv admin note: text overlap with arXiv:1112.6008