1. 11
  1. 2

    A few years ago I tested a custom spatial hash data structure against D3’s quadtree implementation and saw a benefit after a few thousand objects. The scalability was noticeably better, and the cost of an add/remove/update was much lower (my ‘quadhash’ structure was bidirectional, you could find an object by position, or quickly get the cell containing the object from the object itself). At the time I found it hard to find references, I wish I had found that article back then, thanks!