mlsanityData to 7 Oct 2026

GAPS: Generator for Automatic Polynomial Solvers

arXiv 2004.11765 ↗First posted 24 Apr 2020cs.CV cs.MS cs.ROcited by 7

Not on the map. Why?

Abstract (arXiv)

Minimal problems in computer vision raise the demand of generating efficient automatic solvers for polynomial equation systems. Given a polynomial system repeated with different coefficient instances, the traditional Gr"obner basis or normal form based solution is very inefficient. Fortunately the Gr"obner basis of a same polynomial system with different coefficients is found to share consistent inner structure. By precomputing such structures offline, Gr"obner basis as well as the polynomial system solutions can be solved automatically and efficiently online. In the past decade, several tools have been released to generate automatic solvers for a general minimal problems. The most recent tool autogen from Larsson et al. is a representative of these tools with state-of-the-art performance in solver efficiency. GAPS wraps and improves autogen with more user-friendly interface, more functionality and better stability. We demonstrate in this report the main approach and enhancement features of GAPS. A short tutorial of the software is also included.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1; 2026: 3.

7 papers.