Computing Circuit Polynomials in the Algebraic Rigidity Matroid
Computing Circuit Polynomials in the Algebraic Rigidity Matroid
We present an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley–Menger ideal for points in 2D. It relies on combinatorial resultants, a new operation on graphs that captures properties of the Sylvester resultant of two polynomials in this ideal. We show that every rigidity …