Optimal Curve Straightening is $\exists \mathbb{R}$-Complete

Abstract

We prove that the following problem has the same computational complexity as the existential theory of the reals: Given a generic self-intersecting closed curve $\gamma$ in the plane and an integer $m$, is there a polygon with $m$ vertices that is isotopic to $\gamma$? Our reduction implies implies two stronger results, as corollaries of similar results for pseudoline arrangements. First, there are isotopy classes in which every $m$-gon with integer coordinates requires $2^{\Omega (m)}$ bits of precision. Second, for any semi-algebraic set $V$, there is an integer $m$ and a closed curve $\gamma$ such that the space of all $m$-gons isotopic to $\gamma$ is homotopy equivalent to $V$.

17 pages, 10 figures (v2 fixes a utf8 encoding issue)

References in corpus (3)

• The complexity of computing the minimum rank of a sign pattern matrix
• The Art Gallery Problem is $\exists \mathbb{R}$-complete
• A Universality Theorem for Nested Polytopes

Cited by in corpus (2)

• Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
• On Classifying Continuous Constraint Satisfaction Problems