Closed anvaka closed 1 year ago
Thanks for the PR and sorry for not responding earlier — now that I've released v4, I'd like to follow up with more elaborate benchmarks (e.g. keep indexing and search separate), and in the same place (in bench.js
), so I'm closing this. But the idea of adding Flatbush for comparison is certainly a good one.
Was just curious to see which one is faster. The test is obviously not complete, but gives a good starting point for more tests (e.g. different distributions/different search count, etc.)
For the basic example I indexed 100,000 uniformly distributed points inside [-1,000; 1,000) region and then performed 10 lookups using both algorithms. Got this result:
Note, if we perform more searches (e.g. a
1,000
), the difference between two modules becomes negligible.