A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications

Abstract This paper describes an effective procedure for stratifying a real semi-algebraic set into cells of constant description size. The attractive feature of our method is that the number of cells produced is singly exponential in the number of input variables. This compares favorably with the doubly exponential size of Collins' decomposition. Unlike Collins' construction, however, our scheme does not produce a cell complex but only a smooth stratification. Nevertheless, we are able to apply our results in interesting ways to problems of point location and geometric optimization.

[1]  John F. Canny,et al.  A new algebraic method for robot motion planning and real geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  Micha Sharir,et al.  Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.

[3]  M-F Roy,et al.  Géométrie algébrique réelle , 1987 .

[4]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[5]  David Prill.  On Approximations and Incidence in Cylindrical Algebraic Decompositions , 1986, SIAM J. Comput..

[6]  J. Milnor.  On the Betti numbers of real varieties , 1964 .

[7]  Bernard Chazelle,et al.  An Algorithm for Generalized Point Location and its Applications , 1990, J. Symb. Comput..

[8]  Micha Sharir,et al.  Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.

[9]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[10]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[11]  Bernard Chazelle,et al.  A deterministic view of random sampling and its use in geometry , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  Chee-Keng Yap,et al.  Algebraic cell decomposition in NC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Richard Cole,et al.  Searching and Storing Similar Lists , 2018, J. Algorithms.

[14]  Leonidas J. Guibas,et al.  The complexity of many faces in arrangements of lines of segments , 1988, SCG '88.

[15]  André Galligo,et al.  Some New Effectivity Bounds in Computational Geometry , 1988, AAECC.

[16]  Joseph F. Traub,et al.  On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[17]  Rüdiger Loos,et al.  Polynomial real root isolation by differentiation , 1976, SYMSAC '76.

[18]  Dennis Soule Arnon.  Algorithms for the geometry of semi-algebraic sets , 1981 .

[19]  Michel Coste,et al.  Thom's Lemma, the Coding of Real Algebraic Numbers and the Computation of the Topology of Semi-Algebraic Sets , 1988, J. Symb. Comput..

[20]  Bruno Buchberger,et al.  Computer algebra symbolic and algebraic computation , 1982, SIGS.

[21]  Kenneth L. Clarkson,et al.  Combinatorial complexity bounds for arrangements of curves and surfaces , 2015, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[22]  Bernard Chazelle.  Some techniques for geometric searching with implicit set representations , 1987, Acta Informatica.

[23]  Mikhail J. Atallah,et al.  Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[24]  Bernard Chazelle,et al.  Triangulating a non-convex polytype , 1989, SCG '89.

[25]  K. Mahler.  An inequality for the discriminant of a polynomial. , 1964 .

[26]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[27]  James H. Davenport,et al.  Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..

[28]  J. Schwartz,et al.  Differential geometry and topology , 1968 .

[29]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[30]  Bernard Chazelle,et al.  Triangulating a nonconvex polytope , 1990, Discret. Comput. Geom..

[31]  George E. Collins,et al.  Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane , 1984, SIAM J. Comput..

[32]  H. Whitney.  Elementary Structure of Real Algebraic Varieties , 1957 .

[33]  R. Loos.  Generalized Polynomial Remainder Sequences , 1983 .

[34]  M. Spivak.  A comprehensive introduction to differential geometry , 1979 .

[35]  Kenneth L. Clarkson,et al.  A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..

[36]  Micha Sharir,et al.  Triangles in space or building (and analyzing) castles in the air , 1990, Comb..

[37]  C. Traverso,et al.  Shape determination for real curves and surfaces , 1983, ANNALI DELL UNIVERSITA DI FERRARA.

[38]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[39]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

[40]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[41]  M. Atallah.  Some dynamic computational geometry problems , 1985 .

[42]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[43]  R. Loos.  Computing in Algebraic Extensions , 1983 .

[44]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[45]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[46]  James Renegar,et al.  A faster PSPACE algorithm for deciding the existential theory of the reals , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[47]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[48]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..