robinyqc

As you mentioned, K-D trees indeed come with substantial constants when performing rectangle queries, and I can relate to that. However, making the point set dynamic doesn’t necessarily lead to...

I’ve run some preliminary performance tests on the K-D Tree implementation, with results available in `max_queries_result.txt` in the repository [robinyqc/rectangle_add_rectangle_sum_of_points](https://github.com/robinyqc/rectangle_add_rectangle_sum_of_points). The tests compare the online and offline versions across different...

In fact, this dynamic point set version could also be solved in an offline manner, which (perhaps) could include the static point set version proposed by @maspypy . Anyway, I...