ترغب بنشر مسار تعليمي؟ اضغط هنا

Generic Unlabeled Global Rigidity

85   0   0.0 ( 0 )
 نشر من قبل Louis Theran
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Let $mathbf{p}$ be a configuration of $n$ points in $mathbb{R}^d$ for some $n$ and some $d ge 2$. Each pair of points has a Euclidean length in the configuration. Given some graph $G$ on $n$ vertices, we measure the point-pair lengths corresponding to the edges of $G$. In this paper, we study the question of when a generic $mathbf{p}$ in $d$ dimensions will be uniquely determined (up to an unknowable Euclidean transformation) from a given set of point-pair lengths together with knowledge of $d$ and $n$. In this setting the lengths are given simply as a set of real numbers; they are not labeled with the combinatorial data that describes which point-pair gave rise to which length, nor is data about $G$ given. We show, perhaps surprisingly, that in terms of generic uniqueness, labels have no effect. A generic configuration is determined by an unlabeled set of point-pair lengths (together with $d$ and $n$) iff it is determined by the labeled edge lengths.



قيم البحث

اقرأ أيضاً

This note gives a detailed proof of the following statement. Let $din mathbb{N}$ and $m,n ge d + 1$, with $m + n ge binom{d+2}{2} + 1$. Then the complete bipartite graph $K_{m,n}$ is generically globally rigid in dimension $d$.
In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a graph is gener ically globally rigid in Euclidean space iff it is generically globally rigid in a complex or pseudo-Euclidean space. We also establish that global rigidity is always a generic property of a graph in complex space, and give a sufficient condition for it to be a generic property in a pseudo-Euclidean space. Extensions to hyperbolic space are also discussed.
142 - Bill Jackson , J. C. Owen 2014
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if every contin uous motion of the points and lines which preserves the constraints results in a point-line framework which can be obtained from the initial framework by a translation or a rotation. We characterise when a generic point-line framework is rigid. Our characterisation gives rise to a polynomial algorithm for solving this decision problem.
131 - Sean Dewar , Anthony Nixon 2021
A bar-joint framework $(G,p)$ in a (non-Euclidean) real normed plane $X$ is the combination of a finite, simple graph $G$ and a placement $p$ of the vertices in $X$. A framework $(G,p)$ is globally rigid in $X$ if every other framework $(G,q)$ in $X$ with the same edge lengths as $(G,p)$ arises from an isometry of $X$. The weaker property of local rigidity in normed planes (where only $(G,q)$ within a neighbourhood of $(G,p)$ are considered) has been studied by several researchers over the last 5 years after being introduced by Kitson and Power for $ell_p$-norms. However global rigidity is an unexplored area for general normed spaces, despite being intensely studied in the Euclidean context by many groups over the last 40 years. In order to understand global rigidity in $X$, we introduce new generalised rigid body motions in normed planes where the norm is determined by an analytic function. This theory allows us to deduce several geometric and combinatorial results concerning the global rigidity of bar-joint frameworks in $X$.
Let $G$ be a $3$-connected graph with $n$ vertices and $m$ edges. Let $mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $[1..2^b]$ for $bge m^2$. Let $mathbf{l}$ be the vector of $m$ Euclidean lengths of $G$s edges u nder $mathbf{p}$. In this paper, we show that, WHP over $mathbf{p}$, we can efficiently reconstruct both $G$ and $mathbf{p}$ from $mathbf{l}$. In contrast to this average case complexity, this reconstruction problem is NP-HARD in the worst case. In fact, even the labeled version of this problem (reconstructing $mathbf{p}$ given both $G$ and $mathbf{l}$) is NP-HARD. We also show that our results stand in the presence of small amounts of error in $mathbf{l}$, and in the real setting with approximate length measurements. Our method is based on older ideas that apply lattice reduction to solve certain SUBSET-SUM problems, WHP. We also rely on an algorithm of Seymour that can efficiently reconstruct a graph given an independence oracle for its matroid.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا