首页> 外文期刊>ACM transactions on mathematical software >Algorithm 951: Cayley Analysis of Mechanism Configuration Spaces using CayMos: Software Functionalities and Architecture
【24h】

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

机译:算法951:使用CayMos进行机构配置空间的Cayley分析:软件功能和体系结构

获取原文
获取原文并翻译 | 示例

摘要

For a common class of two-dimensional (2D) mechanisms called 1-dof tree-decomposable linkages, we present a software package, CayMos, which uses new theoretical results from Sitharam and Wang [2014] and Sitharam et al. [2011a, 2011b] 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); and (c) finding two "closest" realizations in different connected components.
机译:对于一类称为1-dof树可分解链接的二维(2D)机制,我们提供了一个软件包CayMos,该软件包使用了Sitharam和Wang [2014]和Sitharam等人的新理论结果。 [2011a,2011b]为以下目的实施有效的算法解决方案:(a)有意义地表示和可视化欧几里得实现空间中的连接组件; (b)在有或没有限制实现类型(有时称为定向类型)的情况下,在同一连接组件中的两个实现之间找到连续运动的路径; (c)在不同的连接组件中找到两个“最接近”的实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号