mirror of https://github.com/tidwall/rtred.git
Update README.md
This commit is contained in:
parent
22ac750bcf
commit
fc55586978
|
@ -1,11 +1,15 @@
|
||||||
|
**This project has been archived, please use [tidwall/rtree](https://github.com/tidwall/rtree) instead.**
|
||||||
|
|
||||||
RTree implementation for Go
|
RTree implementation for Go
|
||||||
===========================
|
===========================
|
||||||
|
|
||||||
[![GoDoc](https://godoc.org/github.com/tidwall/rtree?status.svg)](https://godoc.org/github.com/tidwall/rtree)
|
[![GoDoc](https://godoc.org/github.com/tidwall/rtred?status.svg)](https://godoc.org/github.com/tidwall/rtred)
|
||||||
|
|
||||||
This package provides an in-memory R-Tree implementation for Go, useful as a spatial data structure.
|
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.
|
It has support for 1-20 dimensions, and can store and search multidimensions interchangably in the same tree.
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
Authors
|
Authors
|
||||||
-------
|
-------
|
||||||
* 1983 Original algorithm and test code by Antonin Guttman and Michael Stonebraker, UC Berkely
|
* 1983 Original algorithm and test code by Antonin Guttman and Michael Stonebraker, UC Berkely
|
||||||
|
|
Loading…
Reference in New Issue