cs.LG, math.CO

Learning Minimally Rigid Graphs with High Realization Counts

arXiv:2605.12427v1 Announce Type: new
Abstract: For minimally rigid graphs, the same edge-length data can admit multiple realizations (up to translations and rotations). Finding graphs with exceptionally many realizations is an extremal problem in rig…