re
/
rtred
forked from mirror/rtred
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
RTree implementation for Go
31 Commits 1 Branch 4 Tags 120 KiB
Go 100%
Go to file
re b969e73439 fix repo 2022-12-12 15:28:16 +03:00
.github/workflows Create go.yml 2020-11-03 12:02:02 -07:00
base fix repo 2022-12-12 15:28:16 +03:00
LICENSE basic functionality 2016-06-11 17:28:47 -07:00
README.md fix repo 2022-12-12 15:28:16 +03:00
go.mod fix repo 2022-12-12 15:28:16 +03:00
go.sum fix repo 2022-12-12 15:28:16 +03:00
rtree.go fix repo 2022-12-12 15:28:16 +03:00
rtree_test.go Rename project again 2021-02-07 17:29:30 -07:00

README.md

This project has been archived, please use tidwall/rtree instead.

RTree implementation for Go

GoDoc

This package provides an in-memory R-Tree implementation for Go, useful as a spatial data structure. It has support for 1-20 dimensions, and can store and search multidimensions interchangably in the same tree.

Authors

  • 1983 Original algorithm and test code by Antonin Guttman and Michael Stonebraker, UC Berkely
  • 1994 ANCI C ported from original test code by Melinda Green
  • 1995 Sphere volume fix for degeneracy problem submitted by Paul Brook
  • 2004 Templated C++ port by Greg Douglas
  • 2016 Go port by Josh Baker
  • 2018 Added kNN and merged in some of the RBush logic by Vladimir Agafonkin

License

RTree source code is available under the MIT License.