quadtree
quadtree copied to clipboard
🌲 Point/region Quadtree implementation for Rust.
Thanks very much for this nice crate. Here's what I'm trying to do: after inserting a bunch of points, I'd like to query a handle and find all of the...
After pondering this for a while, I've come to realisation that what we call `Entry` is a distraction, and in fact, `Query` is the closest we have to `HashMap`'s `Entry`....
This prepares the crate for introduction of multiple tree kinds, as well as ridding it of weird import Golang-isms :)
While RPITIT stabilisation hasn't reached `stable` this isn't feasible, but being generic over data storage is neat.
Also, since this crate is on 2018 edition, don't use `extern crate` to reference them.
As @t-veor pointed out in https://github.com/ambuc/quadtree/issues/1: > [HandleIter] could be improved by [...] skipping over subquadrants that do not overlap with the query area at all? Then HandleIter::query_optimization shouldn't even...
After inserting a large amount of points into a quadtree, making queries can cause a stack overflow when iterating through results. I've cut down to a reproducing example here: ```rust...
Hello, I was looking your code to learn how a Quadtree could be implemented in rust (I never did it before in any other language too). But I was wondering...
Starting with depth values equal to or larger than 31, the following panic occurs: ``` thread 'main' panicked at 'attempt to multiply with overflow', /rustc/7737e0b5c4103216d6fd8cf941b7ab9bdbaace7c\library\core\src\num\mod.rs:210:5 stack backtrace: 0: std::panicking::begin_panic_handler at...