Datomic R-trees by James Sofra.
From the description:
Slides for a talk given at Melbourne Functional Users Group on an R-tree based spatial indexer for Datomic.
The slides do a good job explaining the advantages of Datomic for spatial data and using R-trees with it.
References from the slides that you will find helpful:
R-TREES. A Dynamic Index Structure for Spatial Searching. A. Guttman (1984)
Sort-based query-adaptive loading of R-trees, Daniar Achakeev, Bernhard Seeger, Peter Widmayer. (2012)
Sort-based parallel loading of R-trees, Daniar Achakeev, Marc Seidemann, Markus Schmidt, Bernhard Seeger. (2012)
The R*-tree: an efficient and robust access method for points and rectangles (1990), by Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger. (1990)
OMT: Overlap Minimizing Top-down Bulk Loading Algorithm for R-tree, Taewon Lee, Sukho Lee. (2003)
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree, Lars Arge. (2004)
Compact Hilbert indices, Christopher Hamilton. (2006)
R-Trees: Theory and Applications, Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos and Yannis Theodoridis. (2006)
See also: https://github.com/jsofra/datomic-rtree