This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: • Edge Addition: Take any 2 vertices without any edges and just put an edge between them. • Redundantly Rigid/2-Rigid: Removing any one edge still leaves the graph Rigid. 1 Consider the following Statements 1. G is d+1 Connected 2. G is 2-Rigid 3. G can be obtained from K 4 by extensions. 4. G is globally rigid. Some observations on these statements • 2 implies 3 and 3 implies 2, The ﬁrst implication is shown in Theorem 6.1 in the paper. The second implication is shown in Lem 3.9 of the paper. to be continued . .. 2...
View Full Document
This note was uploaded on 11/09/2011 for the course CIS 6930 taught by Professor Staff during the Fall '08 term at University of Florida.
- Fall '08