1 citations · 1 across the 1 of their papers we have counts for
4 papers · 1 filter
Galois/monodromy groups for decomposing minimal problems in 3D reconstruction
Timothy Duff, Viktor Korotynskiy, Tomas Pajdla +1
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to…
Polyhedral Homotopies in Cox Coordinates
Timothy Duff, Simon Telen, Elise Walker +1
We introduce the Cox homotopy algorithm for solving a sparse system of polynomial equations on a compact toric variety . The algorithm lends its name from a construction, desc…
Signatures of algebraic curves via numerical algebraic geometry
Timothy Duff, Michael Ruddy
We apply numerical algebraic geometry to the invariant-theoretic problem of detecting symmetries between two plane algebraic curves. We describe an efficient equality test which de…
Certification for Polynomial Systems via Square Subsystems
Timothy Duff, Nickolas Hein, Frank Sottile
We consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a square subsyst…