Examples of RTree

com.metamx.collections.spatial.RTree

ai.msu.su/~megera/postgres/gist/papers/gutman-rtree.pdf

net.sf.jsi.rtree.RTree

This is a lightweight RTree implementation, specifically designed for the following features (in order of importance):

Fast intersection query performance. To achieve this, the RTree uses only main memory to store entries. Obviously this will only improve performance if there is enough physical memory to avoid paging.
Low memory requirements.
Fast add performance.

The main reason for the high speed of this RTree implementation is the avoidance of the creation of unnecessary objects, mainly achieved by using primitive collections from the trove4j library.

org.mati.geotech.model.rtree.RTree

sil.rtree.RTree

      }
      intTreeVariant = new Integer(sil.spatialindex.SpatialIndex.RtreeVariantRstar); 
    }
    propertySet.setProperty("TreeVariant", intTreeVariant);
    
    tree = new RTree(propertySet, storageManager);
  }

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of RTree

Examples of sil.rtree.RTree