/eliminationTemplates

Automatic generators of fast and stable (Laurent) polynomial system solvers in MATLAB/Julia/Python

Primary LanguageJuliaMIT LicenseMIT

eliminationTemplates

Elimination template generators for solving polynomial systems and related problems and solvers in geometric computer vision published in

  1. Evgeniy Martyushev, Jana Vrablikova, Tomas Pajdla. Optimizing Elimination Templates by Greedy Parameter Search. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2022, pp. 15754-15764. [https://openaccess.thecvf.com/content/CVPR2022/html/Martyushev_Optimizing_Elimination_Templates_by_Greedy_Parameter_Search_CVPR_2022_paper.html]

  2. Evgeniy Martyushev, Snehal Bhayani, Tomas Pajdla. Automatic Solver Generator for Systems of Laurent Polynomial Equations, preprint: arXiv:2307.00320, 2023.

Folders:

  1. _greedyAG: automatic generator by greedy parameter search
  2. _redundantAG: automatic generator by redundant solving sets
  3. problems: minimal problem formulations
  4. solvers.matlab: collection of state-of-the-art solvers in MATLAB
  5. solvers.julia: collection of state-of-the-art solvers in Julia
  6. solvers.python: collection of state-of-the-art solvers in Python