Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
spatial-trees is a set of dynamic index data structures for spatially-extended data.
Common Lisp
branch: master
Failed to load latest commit information.
.gitignore initial commit in NNS
BUGS Add a bug entry about R* trees
LICENCE Add a licence file (BSDish)
README.md updated the readme and api
TODO documentation: api, readme...
api.org readme
basedefs.lisp Add (unused as yet) check-consistency generic function
greene-trees.lisp Move all the tests into their own file, treated as static by the system
nearest-search-test.lisp finally, removed tests on r*
nearest-search.lisp bugfix: load some structures at the compile time.
package.lisp merge guicho271828-nearest-neighbor-search
r-trees.lisp Bounding Rectangle
rectangles.lisp %intersect/1d-p
rplus-trees.lisp fix a couple of style warnings in r+-trees
rstar-trees.lisp Move all the tests into their own file, treated as static by the system
spatial-tree-test.lisp
spatial-tree-viz.lisp it is awkward to run a test each time vizualizer is invoked.
spatial-trees-viz.asd it is awkward to run a test each time vizualizer is invoked.
spatial-trees.asd renamed the testing system: spatial-trees-test -> spatial-trees.test
spatial-trees.nns.asd renamed the testing system: spatial-trees-test -> spatial-trees.test
spatial-trees.nns.test.asd initial commit in NNS
spatial-trees.test.asd renamed the testing system: spatial-trees-test -> spatial-trees.test
tutorial.lisp added a tutorial
x-trees.lisp X-trees now seem to work. Index building is very slow.

README.md

This code was written by Christophe Rhodes, and the following description was taken from cliki.net.

spatial-trees

spatial-trees is a set of dynamic index data structures for spatially-extended data. The flavors provided are, as of the 0.1 release (on 2004-12-03):

  • R-trees, as in R-TREES: A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING, Antonin Guttman, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1984.

  • Greene-trees, as in An Implementation and Performance Analysis of Spatial Data Access Methods, Diane Greene, Proc. 5th IEEE Int. Conf. on Data Engineering, 1989.

  • R-trees, as in The _R-tree: An Efficient and Robust Access Method for Points and Rectangles_, Beckmann, Kriegel, Schneider and Seeger, Proc. ACM Int. Conf. on Management of Data, 1990

  • X-trees, as in The X-tree: An Index Structure for High-Dimensional Data, Berchtold, Keim and Kriegel, Proc. 22th Int. Conf. on Very Large Databases, 1996

Future work planned includes performance enhancements, incorporation of more index structures, and some work on supporting more optimal indexing when the entire set of data is known at index creation time; for more details, see the TODO file in the binary distribution.

The code is licensed BSD-style, and is intended to be similar in spirit to Nathan Froyd's TREES Library.

Currently quicklisp-loadable.

Here are some instructions:

  • Read the API first
  • For Tutorial, see tutorial.lisp
  • For Testing, run (asdf:test-system :spatial-trees).
  • In order to test a visual inspector, run (asdf:load-system :spatial-trees-viz) and the mcclim-based visualizer will show up.
Something went wrong with that request. Please try again.