1. Agarwal, P.K.: Simplex range searching and its variants: a review. In: A Journey through Discrete Mathematics: A Tribute to Jiří Matoušek, pp. 1–30. Springer, Berlin (2017)
2. 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). (Also in Proceedings of SoCG’20)
3. Agarwal, P.K., Aronov, B., Ezra, E., Katz, M.J., Sharir, M.: Intersection queries for flat semi-algebraic objects in three dimensions and related problems. In: 38th International Symposium on Computational Geometry, SoCG 2022, pp. 4:1–4:14, Long version on http://arxiv.org/abs/2203.10241 (2022)
4. Ailon, N., Chazelle, B.: Lower bounds for linear degeneracy testing. J. ACM 52(2), 157–171 (2005)
5. Aronov, B., Cardinal, J.: Geometric pattern matching reduces to $$k$$-SUM. Discrete Comput. Geom. 68(3), 850–859 (2022). (Also in Proceedings of ISAAC’20)