Partial Reflections and Globally Linked Pairs in Rigid Graphs
Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
Cited by 2 publications
References 18 publications
Globally Linked Pairs of Vertices in Generic Frameworks
A d-dimensional framework is a pair (G, p), where $$G=(V,E)$$ G = ( V , E ) is a graph and p is a map from V to $${\mathbb {R}}^d$$ R d . The length of an edge $$xy\in E$$ x y ∈ E in (G, p) is the distance between p(x) and p(y). A vertex pair $$\{u,v\}$$ { u , v } of G is said to be globally linked in (G, p) if the distance between p(u) and p(v) is equal to the distance between q(u) and q(v) for every d-dimensional framework (G, q) in which the corresponding edge lengths are the same as in (G, p). We call (G, p) globally rigid in $${\mathbb {R}}^d$$ R d when each vertex pair of G is globally linked in (G, p). A pair $$\{u,v\}$$ { u , v } of vertices of G is said to be weakly globally linked in G in $${\mathbb {R}}^d$$ R d if there exists a generic framework (G, p) in which $$\{u,v\}$$ { u , v } is globally linked. In this paper we first give a sufficient condition for the weak global linkedness of a vertex pair of a $$(d+1)$$ ( d + 1 ) -connected graph G in $${\mathbb {R}}^d$$ R d and then show that for $$d=2$$ d = 2 it is also necessary. We use this result to obtain a complete characterization of weakly globally linked pairs in graphs in $${\mathbb {R}}^2$$ R 2 , which gives rise to an algorithm for testing weak global linkedness in the plane in $$O(|V|^2)$$ O ( | V | 2 ) time. Our methods lead to a new short proof for the characterization of globally rigid graphs in $${\mathbb {R}}^2$$ R 2 , and further results on weakly globally linked pairs and globally rigid graphs in the plane and in higher dimensions.
Globally Linked Pairs of Vertices in Generic Frameworks
A d-dimensional framework is a pair (G, p), where $$G=(V,E)$$ G = ( V , E ) is a graph and p is a map from V to $${\mathbb {R}}^d$$ R d . The length of an edge $$xy\in E$$ x y ∈ E in (G, p) is the distance between p(x) and p(y). A vertex pair $$\{u,v\}$$ { u , v } of G is said to be globally linked in (G, p) if the distance between p(u) and p(v) is equal to the distance between q(u) and q(v) for every d-dimensional framework (G, q) in which the corresponding edge lengths are the same as in (G, p). We call (G, p) globally rigid in $${\mathbb {R}}^d$$ R d when each vertex pair of G is globally linked in (G, p). A pair $$\{u,v\}$$ { u , v } of vertices of G is said to be weakly globally linked in G in $${\mathbb {R}}^d$$ R d if there exists a generic framework (G, p) in which $$\{u,v\}$$ { u , v } is globally linked. In this paper we first give a sufficient condition for the weak global linkedness of a vertex pair of a $$(d+1)$$ ( d + 1 ) -connected graph G in $${\mathbb {R}}^d$$ R d and then show that for $$d=2$$ d = 2 it is also necessary. We use this result to obtain a complete characterization of weakly globally linked pairs in graphs in $${\mathbb {R}}^2$$ R 2 , which gives rise to an algorithm for testing weak global linkedness in the plane in $$O(|V|^2)$$ O ( | V | 2 ) time. Our methods lead to a new short proof for the characterization of globally rigid graphs in $${\mathbb {R}}^2$$ R 2 , and further results on weakly globally linked pairs and globally rigid graphs in the plane and in higher dimensions.
Global rigidity of triangulated manifolds
No abstract
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Contact Info
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Product
Resources
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.
