Faster QuadTree init
Currently required to add Records iteratively. Can we initialise with a list of Records, like the KDTree class?
Questions
- Can we handle Records outside the boundary?
-
insertmethod returns boolean depending on insertion success
-
- How do we optimally partition the data by longitude?
- Doesn't actually need to be optimal, but should at least be an efficient method