Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with rigidity
Search options answers only
not deleted
user 14832
5
votes
Accepted
Does there exist a 3-connected, chordal graph which is not globally rigid?
(Note that you need to be a bit careful with universal rigidity as there are graphs that have some generic frameworks that are universally rigid in $E^2$, and other generic frameworks that are not universally …
- 306
3
votes
Is the following two-dimensional graph likely to be globally rigid?
The main ones to avoid are places where the rigidity matrix, or the stress matrix has a "less than maximal rank". … At such points, global rigidity can be lost. Avoiding such places is needed in Connelly's sufficiency proof. …
- 306
3
votes
Is the following two-dimensional graph likely to be globally rigid?
Note that condions 1 and 2 define a so called "unit-disk" graph. Even in this case, finding an embedding from distances is still NP-HARD.
(see "A Theory of Network Localization" by Aspnes et al.) Thou …
- 306