0
\$\begingroup\$

I've seen a lot of sites that recommends to use Quadtree for splitting the array by levels and nodes for a better performance for example in CollisionSystem there's a lot of collisions needs to be handle. I need to ask this question because I'm planning to create my own Quadtree class, if there it didn't exist.

\$\endgroup\$
  • 1
    \$\begingroup\$ So are you asking if you can implement a QuadTree in Java (LibGDX)? Or if LibGDX has a QuadTree? Or if the LibGDX architecture supports (custom) QuadTrees? It is a little unclear right now. \$\endgroup\$ – Tyyppi_77 Sep 27 '16 at 16:35
2
\$\begingroup\$

GDX doesn't support it directly.

A version for LibGDX https://github.com/alwex/QuadTree

\$\endgroup\$
  • \$\begingroup\$ It's not "for" libGDX, it uses ArrayList instead of Array and so it probably doesn't care about GC \$\endgroup\$ – Winter Sep 16 at 0:09

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.