1. Agarwal, P.K.: Simplex range searching and its variants: a review. In: Loebl, M., Nešetřil, J., Thomas, R. (eds.) A Journey Through Discrete Mathematics, pp. 1–30. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-44479-6_1
2. Agarwal, P.K., Aronov, B., Ezra, E., Zahl, J.: An efficient algorithm for generalized polynomial partitioning and its applications. In: Proceedings of 35th Symposium on Computational Geometry, pp. 5:1–5:14 (2020). arXiv:1812.10269
3. Agarwal, P.K., Matoušek, J., Sharir, M.: On range searching with semialgebraic sets II. SIAM J. Comput. 42, 2039–2062 (2013)
4. Ailon, N., Chazelle, B.: Lower bounds for linear degeneracy testing. J. ACM 52(2), 157–171 (2005)
5. Aronov, B., Ezra, E., Sharir, M.: Testing polynomials for vanishing on Cartesian products of planar point sets, In: Proceedings of 36th Symposium on Computational Geometry, pp. 8:1–8:14 (2020). arXiv:2003.09533