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

单自由度树可分解连杆机构的Cayley位形空间(II):复杂性的组合刻画

Cayley Configuration Spaces of 1-dof Tree-decomposable Linkages, Part II: Combinatorial Characterization of Complexity

Meera Sitharam, Menghan Wang, Heping Gao

摘要:

本文从第一部分开始,继续研究二维单自由度机构的凯莱位形空间,即非棱的可达长度集。在第二部分中,我们关注描述集合中区间端点的代数复杂性,即,凯莱复杂性具体来说,我们专注于Cayley配置空间的一个自然类的1-DOF连杆机构,称为1-DOF树可分解的连杆机构。基础图G满足:对于某个基非边f,G \cup f是二次根可解(QRS)的,这意味着G \cup f是极小刚性的,并且给定所有边的长度\bar{l},相应的连接(G \cup f,\bar{l})可以从f开始用直尺和圆规简单地实现.很明显,凯莱复杂度只取决于图G,可能还取决于非边f。在这里,我们问是否凯莱复杂性取决于一个基地非边缘f的选择。我们回答这个问题的否定,从而表明,低凯莱复杂性是一个性质的图G(独立于非边f)。然后,我们给出了一个简单的表征与低凯莱复杂度的图,导致一个有效的算法表征,即一个有效的算法识别这样的图。接下来,我们展示了一个令人惊讶的结果,即(图)平面性相当于1-dof三角可分解图的自然子类的低凯莱复杂性。虽然这是一个有限的禁止未成年人的图形表征低凯莱复杂性,我们提供了反例显示不可能的有限禁止未成年人的刻画时,上述子类扩大。

英文摘要:

We continue to study Cayley configuration spaces of 1-dof linkages in 2D begun in Part I of this paper, i.e. the set of attainable lengths for a non-edge. In Part II, we focus on the algebraic complexity of describing endpoints of the intervals in the set, i.e., the Cayley complexity. Specifically, We focus on Cayley configuration spaces of a natural class of 1-dof linkages, called 1-dof tree-decomposable linkages. The underlying graphs G satisfy the following: for some base non-edge f, G \cup f is quadratic-radically solvable (QRS), meaning that G \cup f is minimally rigid, and given lengths \bar{l} of all edges, the corresponding linkage (G \cup f, \bar{l}) can be simply realized by ruler and compass starting from f. It is clear that the Cayley complexity only depends on the graph G and possibly the non-edge f. Here we ask whether the Cayley complexity depends on the choice of a base non-edge f. We answer this question in the negative, thereby showing that low Cayley complexity is a property of the graph G (independent of the non-edge f). Then, we give a simple characterization of graphs with low Cayley complexity, leading to an efficient algorithmic characterization, i.e. an efficient algorithm for recognizing such graphs. Next, we show a surprising result that (graph) planarity is equivalent to low Cayley complexity for a natural subclass of 1-dof triangle-decomposable graphs. While this is a finite forbidden minor graph characterization of low Cayley complexity, we provide counterexamples showing impossibility of such finite forbidden minor characterizations when the above subclass is enlarged.

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

↑