Multilevel Polynomial Partitions and Simplified Range Searching

The polynomial partitioning method of Guth and Katz (arXiv:1011.4105) has numerous applications in discrete and computational geometry. It partitions a given n-point set $$P\subset {\mathbb {R}}^d$$P⊂Rd using the zero set Z(f) of a suitable d-variate polynomial f. Applications of this result are often complicated by the problem, “What should be done with the points of P lying within Z(f)?” A natural approach is to partition these points with another polynomial and continue further in a similar manner. So far this has been pursued with limited success—several authors managed to construct and apply a second partitioning polynomial, but further progress has been prevented by technical obstacles. We provide a polynomial partitioning method with up to d polynomials in dimension d, which allows for a complete decomposition of the given point set. We apply it to obtain a new algorithm for the semialgebraic range searching problem. Our algorithm has running time bounds similar to a recent algorithm by Agarwal et al. (SIAM J Comput 42:2039–2062, 2013), but it is simpler both conceptually and technically. While this paper has been in preparation, Basu and Sombra, as well as Fox, Pach, Sheffer, Suk, and Zahl, obtained results concerning polynomial partitions which overlap with ours to some extent.

[1]  Haim Kaplan,et al.  Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique , 2011, Discret. Comput. Geom..

[2]  Erich Kaltofen,et al.  Polynomial Factorization 1987-1991 , 1992, LATIN.

[3]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[4]  Micha Sharir,et al.  Incidences between points and lines in R4: Extended Abstract , 2014, SoCG.

[5]  Micha Sharir,et al.  Incidences between Points and Lines in Three Dimensions , 2015, SoCG.

[6]  Bernard Mourrain,et al.  A new algorithm for the geometric decomposition of a variety , 1999, ISSAC '99.

[7]  J. Pach,et al.  A semi-algebraic version of Zarankiewicz's problem , 2014, 1407.5705.

[8]  Saugata Basu,et al.  On a real analogue of Bezout inequality and the number of connected of connected components of sign conditions , 2013 .

[9]  Craig Huneke,et al.  Integral closure of ideals, rings, and modules , 2006 .

[10]  József Solymosi,et al.  An Incidence Theorem in Higher Dimensions , 2012, Discret. Comput. Geom..

[11]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[12]  Ernst W. Mayr,et al.  Exponential space computation of Gröbner bases , 1996, ISSAC '96.

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

[14]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[15]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[16]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[17]  Grete Hermann,et al.  Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .

[18]  Ruixiang Zhang,et al.  Bounds of incidences between points and algebraic curves , 2013, 1308.0861.

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

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

[21]  Joshua Zahl,et al.  Improved bounds for incidences between points and circles , 2012, SoCG '13.

[22]  S. Basu,et al.  On a real analog of Bezout inequality and the number of connected components of sign conditions , 2013, 1303.1577.

[23]  T. Willmore.  Algebraic Geometry , 1973, Nature.

[24]  Micha Sharir,et al.  On Range Searching with Semialgebraic Sets II , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[25]  J JacobFox,et al.  A semi-algebraic version of Zarankiewicz's problem , 2014 .

[26]  Ernst W. Mayr,et al.  Space-efficient Gröbner basis computation without degree bounds , 2011, ISSAC '11.

[27]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[28]  Saugata Basu,et al.  Polynomial Partitioning on Varieties of Codimension Two and Point-Hypersurface Incidences in Four Dimensions , 2014, Discret. Comput. Geom..

[29]  Haim Kaplan,et al.  Unit Distances in Three Dimensions , 2012, Comb. Probab. Comput..

[30]  Joshua Zahl,et al.  An improved bound on the number of point-surface incidences in three dimensions , 2011, Contributions Discret. Math..

[31]  Larry Guth,et al.  Distinct Distance Estimates and Low Degree Polynomial Partitioning , 2014, Discret. Comput. Geom..

[32]  Thomas Dubé,et al.  The Structure of Polynomial Ideals and Gröbner Bases , 2013, SIAM J. Comput..

[33]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[34]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[35]  Timothy M. Chan.  Optimal Partition Trees , 2010, SCG.

[36]  Joshua Zahl,et al.  A Szemerédi–Trotter Type Theorem in $$\mathbb {R}^4$$R4 , 2012, Discret. Comput. Geom..

[37]  Sartaj Sahni,et al.  Handbook of Data Structures and Applications , 2004 .

[38]  Larry Guth,et al.  On the Erdos distinct distance problem in the plane , 2010, 1011.4105.

[39]  Gerhard Pfister,et al.  A First Course in Computational Algebraic Geometry: A Problem in Group Theory Solved by Computer Algebra , 2013 .

[40]  L. Guth,et al.  On the Erdős distinct distances problem in the plane , 2015 .

[41]  S. Basu,et al.  Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) , 2006 .

[42]  Saugata Basu,et al.  Polynomial partitioning on varieties and point-hypersurface incidences in four dimensions , 2014, ArXiv.

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

[44]  MatoušekJiří.  Geometric range searching , 1994 .

[45]  Saugata Basu,et al.  Refined Bounds on the Number of Connected Components of Sign Conditions on a Variety , 2011, Discret. Comput. Geom..