1. Agarwal, P.K., Aronov, B., Ezra, E., Zahl, J.: Efficient algorithm for generalized polynomial partitioning and its applications. SIAM J. Comput. 50(2), 760–787 (2021)
2. Agarwal, P.K., Matoušek, J., Sharir, M.: On range searching with semialgebraic sets. II. SIAM J. Comput. 42(6), 2039–2062 (2013)
3. Aronov, B., Cardinal, J.: Geometric pattern matching reduces to $$k$$-SUM. In: 31st International Symposium on Algorithms and Computation. Leibniz International Proceedings in Informatics, vol. 181, # 32. Leibniz-Zent. Inform., Wadern (2020)
4. Aronov, B., Ezra, E., Sharir, M.: Testing polynomials for vanishing on Cartesian products of planar point sets. In: 36th International Symposium on Computational Geometry. Leibniz International Proceedings in Informatics, vol. 164, # 8. Leibniz-Zent. Inform., Wadern (2020)
5. Aronov, B., Ezra, E., Zahl, J.: Constructive polynomial partitioning for algebraic curves in $$\mathbb{R}^3$$ with applications. SIAM J. Comput. 49(6), 1109–1127 (2020)