Use QuadTree for better complexity on search features?

Question

I want to improve the complexity of search specific feature when using this function : map.forEachFeatureAtPixel(e.pixel, function (feature, layer) { // Do something.. }); The improvment will occur by using QuadTree? How can i approach to this situation ?

Answer 1

Short answer: you don’t need to add your own quadtree. OpenLayers already indexes vector features with an R-tree (RBush) and forEachFeatureAtPixel uses that index for hit-testing. You’ll usually get bigger wins by narrowing what gets tested and by querying a source’s index directly.