Name
Abstract | ||
|---|---|---|
We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $$(K(n,m),\\mathbf{p},\\mathbf{q})$$(K(n,m),p,q). This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general position. Even without any of these assumptions, in complete generality, we extend these ideas to obtain an efficient algorithm, based on a sequence of linear programs, that determines whether an input framework of a complete bipartite graph is universally rigid or not. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00454-016-9836-9 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Rigidity,Prestress stability,Universal rigidity | Rigidity (psychology),Topology,Complete bipartite graph,Combinatorics,General position,Bipartite graph,Mathematics,Generality | Journal |
Volume | Issue | ISSN |
57 | 2 | 0179-5376 |
Citations | PageRank | References |
1 | 0.37 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Connelly | 1 | 5 | 2.20 |
| Steven J. Gortler | 2 | 4205 | 366.17 |