Re: [jts-dev] best way to find all points (indexed in an SRTtree) and a

[Martin Davis <mtnclimb@xxxxxxxxx>]

I did some performance testing of STRtree, KdTree and HPRtree, running on a dataset of 1 M points.  I was a bit surprised by the results, which seem to show that KdTree is a bit *slower* than the other indexes in query time (by ~20%).  STRtree and HPRtree had similar query times.  HPRtree had a slower build time, which was also a bit surprising.  

Overall, STRtree was the performance winner.   There may still be better choices if memory is the biggest concern, but it's nice to know that STRtree is holding up as the best JTS index to use.  

On Thu, Dec 5, 2019 at 2:54 PM Martin Davis <mtnclimb@xxxxxxxxx> wrote:

This is right in the KdTree sweet spot, so I would expect it to be more performant than STRtree.  A report on performance would be interesting to hear if you try them both out.  Also, the KdTree might be more memory efficient.