Gröbner Basis Methods for Minimal Problems in Computer Vision
A method is presented for building solvers for classes of multivariate polynomial equations. The method is based on solving an analogous template problem over a finite field, and then using the elimination order established for this problem for the original class of problems. A strength of this method is that this permits pivoting in the elimination. Solvers for several minimal problems in
