The two main concepts of Rigidity Theory are rigidity, where the framework has no continuous deformation, and global rigidity where the given distance set determines the locations of the points up to isometry. We consider the following augmentation problem. Given a minimally rigid graph $G=(V,E)$ in $\R^2$, find a minimum cardinality edge set $F$ such that the graph $G'=(V,E+F)$ is globally rigid in $\R^2$. We provide a min-max theorem and an $O(|V|^3)$ time algorithm for this problem.
Bibtex entry:
@techreport{egres-20-07,
AUTHOR | = | {Kir{\'a}ly, Csaba and Mih{\'a}lyk{\'o}, Andr{\'a}s}, |
TITLE | = | {Globally rigid augmentation of minimally rigid graphs in R^2}, |
NOTE | = | {{\tt egres.elte.hu}}, |
INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
YEAR | = | {2020}, |
NUMBER | = | {TR-2020-07} |