Flatbush | C # port of the fast static 2d spatial index Flatbush

Flatbush is a C# library. Flatbush has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

C# port of the fast static 2d spatial index Flatbush in javascript, check it out here. Implementation is a packed Hilbert R-tree. This structure is useful for computational geometry algorithms, e.g. finding all intersections between two arbitrary curves (mapping segments to bounding boxes), hit testing, 2d bounding box selections, etc. Currently does not support k nearest neighbors query (which is implemented in the javascript version utilizing a priority queue). I added an additional method to use a visiting function which allows for stopping the query early and does not require having to return the index results. Currently only supports signed int32 indexes and doubles for bounding box extents. Ideas and contributions are welcome. Tests and benchmarks need to be added.