PRTree A Priority R-Tree, a spatial index for Java code
Download

PRTree Ranking & Summary

PRTree Tags

Java library priority Spatial spatial index R-Tree Priority R-Tree

PRTree Description

A Priority R-Tree, a spatial index for Java code PRTree is an implementation of a priority R-Tree, a spatial index. The code is written in java and the jar file is very small, this package does not come with anything extra.This implementation tries to be memory efficient, one of the things it does it that it does not force you to create an Box or MBR for each object you have in the tree. You provide a class that can provide the bounds of each object when it is needed. This means that you can control how caching of bounds is done.Example usage:PRTree< Rectangle2D > tree = new PRTree< 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); }There is now also a C# port of the code. Requirements: · Java 2 Standard Edition Runtime Environment What's New in This Release: · This release has major code cleanup and fixes a problem where the maximum values were not used correctly.

PRTree Related Software