• 💀 Happy Halloween! 💀 It's time to vote for the best terrain! Check out the entries to Hive's HD Terrain Contest #2 - Vampire Folklore.❗️Poll closes on November 14, 2023. 🔗Click here to cast your vote!
  • 🏆 Texturing Contest #33 is OPEN! Contestants must re-texture a SD unit model found in-game (Warcraft 3 Classic), recreating the unit into a peaceful NPC version. 🔗Click here to enter!
  • 🏆 HD Level Design Contest #1 is OPEN! Contestants must create a maze with at least one entry point, and at least one exit point. The map should be made in HD mode, and should not be openable in SD. Only custom models from Hive's HD model and texture sections are allowed. The only exceptions are DNC models and omnilights. This is mainly a visual and design oriented contest, not technical. The UI and video walkthrough rules are there to give everyone an equal shot at victory by standardizing how viewers see the terrain. 🔗Click here to enter!

[General] Best 2D sorted data structure for changing data?

Not open for further replies.
Level 31
Jul 10, 2007
So, I need to be able to easily find all position in range of a given position. For this, using something like a Kd-Tree or a Quad Tree seems smart. For example, the KDB-Tree seems like a good bet.

However, I'm curious as to which of all of the possible 2D trees has the lowest add/remove cost while staying balancing.

My idea is to have a tree of all of the units in the map and update it on a timer =P. So is there a good way to resort the nodes based on the new data? The maximum change I'm anticipating is +-64 (.34 interval timer).
Not open for further replies.