PRTree 1.3

A Priority R-Tree, a spatial index for PRTree Java code is an implementation of a priority R-Tree, a spatial index. The code is written in Java and jar file is very small, this package does not come with implementing anything extra.This trying to be efficient memory, one of the things he that it does not require you to create a box or MBR for each object you have in Your Tree. You provide a class that can provide the boundaries of each object when it is needed. This means that you can control how the caching of the Terminals is the use done.Example: PRTree <Rectangle2D> tree = PRTree New <Rectangle2D> (new Rectangle2DConverter (), 10); Rectangle2D Rx = new Rectangle2D.Double (0, 0, 1, 1); tree.load (Collections.singletonList (RX)) for (Rectangle2D R: tree.find (0, 0, 1, 1)) (System.out.println ( "found a rectangle: "+ r)) is now also a port of C # code.