Haxe Quadtree Library

I am looking for a way to lessen the load on collision detection, is there a quadtree or bounding box library available for Haxe that is simple to use? I see Haxeflixel has one called FLXGroup, but I havent been able to find any libraries for haxe that had any documentation.

How is it possible nothing like this exists, even GoLang has working quadtree library. :sleepy:

Browse through these https://github.com/search?utf8=✓&q=quadtree+language%3AHaxe+language%3AHaxe+extension%3Ahx&type=Code&ref=searchresults and see if you can find something interesting.

Many are externs, and some implementations are not standalone libs but part of a bigger framework.

First one in the search results (https://github.com/elnabo/quadtree) seems to be a standalone one.

I also wrote this thing some time ago (so would probably not work out of the box and not even sure about its performance :stuck_out_tongue_winking_eye:), which is one of the many other possible approaches to spatial partitioning.

I should still have some spatial hash code if you still need that

Ya sure, I would love anything that can speed up collision detection.

for good AABB optimization code, look here: http://napephys.com/docs/types/nape/geom/Geom.html :deciduous_tree:

1 Like

Oh thanks maitag, this looks promising. It makes me wonder if there are any other large libraries for haxe that I am missing out on, they should put a link on the OpenFL website.