[Paper Review] Laman Graphs are Generically Bearing Rigid in Arbitrary Dimensions

Shiyu Zhao, Zhiyong Sun+3 more|arXiv (Cornell University)|Mar 11, 2017

Structural Analysis and Optimization8 references4 citations

TL;DR

This paper proves that Laman graphs—constructed via the Henneberg method—are generically bearing rigid in any dimension, meaning they ensure bearing rigidity for almost all node configurations. The key contribution is establishing that 2n−3 edges are sufficient for generic bearing rigidity in arbitrary dimensions, extending Laman’s theorem from distance rigidity to bearing rigidity.

ABSTRACT

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.

Motivation & Objective

• To establish that bearing rigidity is fundamentally determined by the underlying graph structure, not node configuration.
• To define and analyze the concept of generic bearing rigidity for graphs, distinguishing it from configuration-specific rigidity.
• To prove that Laman graphs are generically bearing rigid in arbitrary dimensions, extending classical Laman's theorem to bearing rigidity.
• To determine the minimal edge requirement for generic bearing rigidity and explore its necessity and sufficiency in different dimensions.

Proposed method

• Define generic bearing rigidity as a graph property where a network is bearing rigid for almost all configurations in ℝ^d.
• Use the bearing Laplacian matrix and its rank condition (rank = dn−d−1) to characterize infinitesimal bearing rigidity.
• Leverage the invariance of infinitesimal bearing rigidity under dimension extension to prove that Laman graphs remain generically rigid in higher dimensions.
• Apply the Henneberg construction to generate Laman graphs and show that edge addition preserves generic bearing rigidity.
• Prove that if a graph contains a Laman spanning subgraph, it is generically bearing rigid via edge-addition invariance.
• Use counterexamples to show that Laman graphs are sufficient but not necessary for generic bearing rigidity, especially in higher dimensions.

Experimental results

Research questions

• RQ1 Can the concept of generic bearing rigidity be defined for graphs, independent of specific node configurations?
• RQ2 Is the Laman graph construction sufficient for generic bearing rigidity in arbitrary dimensions, not just in 2D?
• RQ3 What is the minimum number of edges required to ensure generic bearing rigidity in higher-dimensional networks?
• RQ4 Are Laman graphs both necessary and sufficient for generic bearing rigidity in two-dimensional networks?
• RQ5 How does the number of independent constraints provided by bearings scale with dimension, and how does this affect network rigidity?

Key findings

• Laman graphs are generically bearing rigid in any dimension d ≥ 2, meaning they ensure bearing rigidity for almost all node configurations.
• A network with a Laman graph as its underlying graph achieves bearing rigidity with only 2n−3 edges, regardless of the ambient dimension.
• The Laman graph construction via the Henneberg method ensures generic bearing rigidity in arbitrary dimensions, extending Laman’s theorem beyond distance rigidity.
• In two dimensions, Laman graphs are both necessary and sufficient for generic bearing rigidity, but this does not hold in higher dimensions.
• Graphs with fewer than 2n−3 edges can still be generically bearing rigid in higher dimensions, indicating that Laman is sufficient but not necessary.
• The number of independent constraints from bearings increases with dimension: each bearing in ℝ^d provides d−1 independent constraints, explaining why 4 bearings in ℝ^3 (providing 8 constraints) can achieve rigidity where 4 bearings in ℝ^2 (providing 4 constraints) cannot.