Re-parameterization reduces irreducible geometric constraint systems

Abstract

You recklessly told your boss that solving a non-linear system of size n (n unknowns and n equations) requires a time proportional to n, as you were not very attentive during algorithmic complexity lectures. So now, you have only one night to solve a problem of big size (e.g., 1000 equations/unknowns), otherwise you will be fired in the next morning. The… (More)
DOI: 10.1016/j.cad.2015.07.011

11 Figures and Tables

Topics

  • Presentations referencing similar topics