Space Partitioning

Space partitioning algorithms in Rust. A work in progress.

Implemented algorithms

Interval Trees

See [Interval Trees] on Wikipedia. Example:

```rust use spacepartitioning::intervaltree::{IntervalTree, Interval, IntervalType};

[derive(Debug, PartialOrd, PartialEq, Copy, Clone, Default)]

struct Vec2d { pub x: f64, pub y: f64, }

impl IntervalType for Vec2d {}

fn main() { let tree = IntervalTree::from_iter([ ( Interval::new(Vec2d { x: 1., y: 2. }, Vec2d { x: 10., y: 10. }), "Any data (A)", ), ( Interval::new(Vec2d { x: -5., y: -5. }, Vec2d { x: 5., y: 5. }), "Any data (B)", ), ( Interval::new(Vec2d { x: -10., y: -10. }, Vec2d { x: -7., y: -7. }), "Any data (C)", ), ]);

let test = Interval::new(Vec2d::default(), Vec2d::default());
let result = tree.overlap_search(test).unwrap();

assert_eq!(result.data, "Any data (B)")

} ```