arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1112.6008cs.CG
收藏

二维中一类常见机构的Cayley构型空间

Cayley Configuration Spaces of a Common Class of Mechanisms in Two Dimensions

University of Florida(佛罗里达大学);Netflix(网飞);Illinois State University(伊利诺伊州立大学);Meta

Meera Sitharam, Menghan Wang, William Sims, Heping Gao

AI总结:

研究一类1自由度树可分解连杆的Cayley构型空间,证明了低Cayley复杂度(LCC)定义的稳健性,给出其算法刻画,并证明了平面性与LCC的等价性,同时提供了寻找连续运动路径的线性时间算法。

摘要:

我们研究了一类1自由度连杆(指定边长的图)的Cayley构型空间,该类连杆是通过从树可分解图中删除一条边得到的。该类包括基于四杆的著名机构,以及strandbeest、cardioid、limacon等。Cayley构型空间是连杆的二维实现中一个基础非边(例如被删除的边)可达长度区间的集合。我们要求区间端点满足二次根式可解性(QRS)(尺规可作图性的一种扩展),并且树可分解性保证了在给定Cayley构型的情况下,能够高效地用尺规构造连杆实现。由于Kempe通用性的这些限制,这类低Cayley复杂度(LCC)图在机械计算机辅助设计和运动学中很常见。我们的主要贡献如下。(1)我们证明了LCC的定义是稳健的,并且仅依赖于图,而与为确保树可分解性而添加的基础非边的选择无关。(2)我们给出了LCC图的高效算法刻画。(3)我们证明对于1自由度树可分解图的一个自然子类,图的平面性等价于LCC。反例表明,当上述子类扩大时,不可能存在这种有限的禁用子式刻画。(4)我们基于边长给出了LCC连杆(即具有底层LCC图的连杆)通用性的易于测试的定义。(5)对于通用LCC连杆,我们给出了一种算法,用于在路径长度的离散测度呈线性关系的时间内,寻找两个不同实现之间连续运动的路径(如果存在)。这些结果向非LCC、1自由度树可分解连杆进行了非平凡的推广。提出了若干易于入手的开放问题。

英文摘要:

We study Cayley configuration spaces of a class of 1 degree-of-freedom linkages (graphs with specified edge lengths), obtained by dropping an edge from a tree-decomposable graph. The class includes well-known mechanisms based on the four-bar, as well as strandbeest, cardioid, limacon etc. The Cayley configuration space is the set of intervals of attainable lengths for a \emph{base} nonedge (e.g. the dropped edge) over the linkage's 2 dimensional realizations. We require \emph{quadratic radical solvability (QRS)} (an extension of ruler-and-compass-realizability) of the interval endpoints, and tree-decomposability guarantees efficient, ruler-and-compass construction of the linkage realization, given the Cayley configuration. Due to these restrictions of Kempe universality, this class of \emph{low Cayley complexity (LCC)} graphs is common in mechanical computer aided design and kinematics. Our main contributions are the following. (1) We show that the definition of LCC is robust, and depends only on the graph, no matter the choice of base nonedge whose addition ensures tree-decomposability. (2) We give an efficient algorithmic characterization of LCC graphs (3) We show (graph) planarity is equivalent to LCC for a natural subclass of 1-degree-of-freedom tree-decomposable graphs. Counterexamples show impossibility of such finite forbidden minor characterizations when the above subclass is enlarged. (4) We give an easily testable definition of genericity of LCC linkages (i.e. with underlying LCC graphs) based on their edge lengths. (5) For generic LCC linkages, we give an algorithm to find both paths of continuous motion (provided they exist) between two distinct realizations, in time linear in a discrete measure of the length of the path. Nontrivial generalizations of these results to non-LCC, 1-degree-of-freedom tree-decomposable linkages. Several accessible open problems are posed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑