arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.04035eess.SYcs.SYmath.COmath.MG
收藏

Laman图在任意维度下是普遍具有刚性的

Laman Graphs are Generically Bearing Rigid in Arbitrary Dimensions

University of Sheffield(谢菲尔德大学);Australian National University(澳大利亚国立大学);Technion–Israel Institute of Technology(以色列理工学院);Gwangju Institute of Science and Technology(光州科学技术院)

Shiyu Zhao, Zhiyong Sun, Daniel Zelazo, Minh-Hoang Trinh, Hyo-Sung Ahn

AI总结:

本文研究了在任意维度下构造具有承载刚性的网络问题,证明Laman图在任意维度下普遍具有刚性,为构建刚性网络提供了理论基础。

摘要:

本文探讨了在任意维度下构建承载刚性网络的问题。我们首先证明网络的承载刚性是一种由其底层图决定的泛性质。定义了新的概念'泛承载刚性',若网络的底层图是泛承载刚性的,则网络在几乎所有配置下都是承载刚性的;否则在任何配置下都不是。因此,构建承载刚性的网络的关键在于构建泛承载刚性的图。本文的主要贡献是证明Laman图(可通过Henneberg构造生成)在任意维度下是泛承载刚性的。因此,若网络的底层图是Laman图,则在任意维度下网络在几乎所有配置下都是承载刚性的。

英文摘要:

This paper addresses the problem of constructing bearing rigid networks in arbitrary dimensions. We first show that the bearing rigidity of a network is a generic property that is critically determined by the underlying graph of the network. A new notion termed generic bearing rigidity is defined for graphs. If the underlying graph of a network is generically bearing rigid, then the network is bearing rigid for almost all configurations; otherwise, the network is not bearing rigid for any configuration. As a result, the key to construct bearing rigid networks is to construct generically bearing rigid graphs. The main contribution of this paper is to prove that Laman graphs, which can be generated by the Henneberg construction, are generically bearing rigid in arbitrary dimensions. As a consequence, if the underlying graph of a network is Laman, the network is bearing rigid for almost all configurations in arbitrary dimensions.

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

↑