Closed jerabaul29 closed 8 months ago
(since this inserts n elements at once?)
Yes, the author probably meant O(log n) per element amortized.
I will open a PR to clarify :) .
@jerabaul29 looks like this is fixed now
Thanks, I just forgot to close this. Closing as solved through #156 .
https://github.com/georust/rstar/blob/c7d53c81b7588a66d2a3763937862311f73ab7bd/rstar/src/rtree.rs#L98-L101
is still `O(log(n))
: should that not beis still `O(n log(n)) for inserting n points, though the scaling factor is significantly improved
?