Hyper-Dimensional R-Tree Index in Java
Switch branches/tags
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
src Adding 1D range searching objects Jul 18, 2018
.gitignore Licensed under the Apache License, Version 2.0 (the "License") Jan 28, 2016
LICENSE
README.md README table fix Jul 12, 2018
pom.xml 1.0.6-SNAPSHOT Jul 12, 2018

README.md

Conversant RTree

RTree is an index that supports building a tree of bounding rectangles for arbitrary range searches. RTrees are efficient for geospatial data but can be extended to support any data that is amenable to range searching.

Conversant RTree is a hyper-dimensional (2D, 3D, 4D, nD) implementation of RTrees in Java. Conversant RTree supports data with large numbers of orthogonal relations or high dimensionality in the same way that traditional RTrees support 2 or 3 dimensional spatial data.

Conversant R-Tree is on Maven Central

Maven users can incorporate Conversant R-Tree the usual way.

<dependency>
  <groupId>com.conversantmedia</groupId>
  <artifactId>rtree</artifactId>
  <version>1.0.5</version>
</dependency>

Optionally specify a classifier for your version of Java

classifier
jdk8
jdk10