Hi,
I've released a super fast and light geometric index implementing a 
STR-Tree. Here are some benchmarks on the size of the tree:

BenchmarkSimpleRTree_FindNearestPoint/10        10000000               124 ns/op
BenchmarkSimpleRTree_FindNearestPoint/1000       3000000               465 ns/op
BenchmarkSimpleRTree_FindNearestPoint/10000      2000000               670 ns/op
BenchmarkSimpleRTree_FindNearestPoint/100000     2000000               871 ns/op
BenchmarkSimpleRTree_FindNearestPoint/1000000    1000000              1210 ns/op
BenchmarkSimpleRTree_FindNearestPoint/10000000           1000000              
1593 ns/op


You can find the library at: https://github.com/furstenheim/SimpleRTree

and the documentation at: 
https://godoc.org/github.com/furstenheim/SimpleRTree

-- 
You received this message because you are subscribed to the Google Groups 
"golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to golang-nuts+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Reply via email to