Barnes-Hut tree in Rust

Based on The Barnes-Hut Algorithm by Tom Ventimiglia & Kevin Wayne. "A quad-tree is similar to a binary tree, except that each node has 4 children"

Made to learn Rust

My friend Tristan Brismontier was building a (more advance) Barnes-Hut in C# using Unity. It looks like a nice project for learning Rust. Also, an interesting candidate for building an Anomaly Detection Service

How to use

let mut square = Square::new(0, 0, 80);
square.compute(some_points);

println!("{:#?}", square);

Compile and Run

From the command line:

cargo run

This demo use 8 points:

It should produce this quadtree:

Performance

in x: number of point to place in the tree in y: time used in second

Contact

Developed by Martin Magakian dev.martin.magakian@gmail.com by Anomaly Detection

License

MIT License (MIT)