pith. sign in

arxiv: 1402.7347 · v1 · pith:MVMKYEFPnew · submitted 2014-02-28 · 💻 cs.CG

Cayley Analysis of Mechanism Configuration Spaces using CayMos: Software Functionalities and Architecture

classification 💻 cs.CG
keywords connectedcalledcaymoscomponentsfindingrealizationrealizationssoftware
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.