COMPLEXITY ISSUES IN DYNAMIC GEOMETRY

This article deals with the intrinsic complexity of tracing and reachability questions in the context of elementary geometric constructions. We consider constructions from elementary geometry as dynamic entities: while the free points of a construction perform a continuous motion the dependent points should move consistently and continuously. We focus on constructions that are entirely built up from join, meet and angular bisector operations. In particular the last operation introduces an intrinsic ambiguity: Two intersecting lines have two different angular bisectors. Under the requirement of continuity it is a fundamental algorithmic problem to resolve this ambiguity properly during motions of the free elements. After formalizing this intuitive setup we prove the following main results of this article: • It is NP-hard to trace the dependent elements in such a construction. • It is NP-hard to decide whether two instances of the same construction lie in the same component of the configuration space. • The last problem becomes PSPACE-hard if we allow one additional sidedness test which has to be satisfied during the entire motion. On the one hand the results have practical relevance for the implementations of Dynamic Geometry Systems. On the other hand the results can be interpreted as statements concerning the intrinsic complexity of analytic continuation.

[1]  John E. Hopcroft,et al.  Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..

[2]  S. Smale,et al.  Complexity of Bézout’s theorem. I. Geometric aspects , 1993 .

[3]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[4]  N. Mnev.  The universality theorems on the classification problem of configuration varieties and convex polytopes varieties , 1988 .

[5]  David A. Plaisted.  Sparse Complex Polynomials and Polynomial Reducibility , 1977, J. Comput. Syst. Sci..

[6]  David A. Plaisted,et al.  New NP-hard and NP-complete polynomial and integer divisibility problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  Stephen Smale,et al.  Complexity of Bezout's Theorem: III. Condition Number and Packing , 1993, J. Complex..

[8]  G. Barequet.  Cinderella: The Interactive Geometry Software , 2002 .

[9]  Ulrich Kortenkamp.  Foundations of dynamic geometry , 2000 .

[10]  Ulrich Kortenkamp.  Foundations of Dynamic Geometry , 2000 .

[11]  Ulrich Kortenkamp,et al.  Decision Complexity in Dynamic Geometry , 2000, Automated Deduction in Geometry.

[12]  M. Steiner,et al.  Configuration Spaces of Mechanical Linkages , 1999, Discret. Comput. Geom..

[13]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[14]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[15]  Peter W. Shor,et al.  Stretchability of Pseudolines is NP-Hard , 1990, Applied Geometry And Discrete Mathematics.

[16]  M. Kapovich,et al.  On the moduli space of polygons in the Euclidean plane , 1995 .

[17]  Robert E. Tarjan,et al.  The Pebbling Problem is Complete in Polynomial Space , 1980, SIAM J. Comput..

[18]  Jürgen Richter-Gebert.  Realization Spaces of Polytopes , 1996 .

[19]  Joseph Culberson,et al.  Sokoban is PSPACE-complete , 1997 .

[20]  Stephen Smale,et al.  Complexity of Bezout's Theorem V: Polynomial Time , 1994, Theor. Comput. Sci..

[21]  S. Smale,et al.  Complexity of Bezout's theorem IV: probability of success; extensions , 1996 .

[22]  David A. Plaisted.  Some Polynomial and Integer Divisibility problems are NP-Hard , 1978, SIAM J. Comput..

[23]  S. Smale,et al.  Complexity of Bezout’s Theorem II Volumes and Probabilities , 1993 .

[24]  Jürgen Richter-Gebert.  The Universality Theorems for Oriented Matroids and Polytopes , 1999 .

[25]  David A. Plaisted,et al.  Some polynomial and integer divisibility problems are NP-HARD , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[26]  Harald Günzel,et al.  The universal partition theorem for oriented matroids , 1996, Discret. Comput. Geom..