1 citations · 1 across the 1 of their papers we have counts for
6 papers
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…
PLP -- Point-line Minimal Problems under Partial Visibility in Three Views
Timothy Duff, Kathlén Kohn, Anton Leykin +1
We present a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each…
PLMP -- Point-Line Minimal Problems in Complete Multi-View Visibility
Timothy Duff, Kathlén Kohn, Anton Leykin +1
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras. We show that there…
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…
Monodromy Solver: Sequential and Parallel
Nathan Bliss, Timothy Duff, Anton Leykin +1
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows…