Augmenting the Rigidity of a Graph in R (2)
Given a Laman graph G, i.e. a minimally rigid graph in R (2), we provide a I similar to(n (2)) algorithm to augment G to a redundantly rigid graph, by adding a minimum number of edges. Moreover, we prove that this problem of augmenting is NP-hard for an arbitrary rigid graph G in R (2).
laman graph rigid graph augmenting problem np-completeness