v0.6.0

• Add rtree2d- prefix to module and artifact names
• Add function for calculation of distance to the center of ellipsoidal model of the Earth
• Simplify calculations of distances for spherical model
• Add entry constructor for spheres with different radiuses
• Use IndexOutOfBoundsException instead of ArrayIndexOutOfBoundsException
• Rename x1, y1, x2, y2 fields of entries to minX, minY, maxX, maxY
• Move constant parameters to the benchmark title
• Uncomment all benchmark parameters
• Fix nearestK benchmark for David Moten's R-Tree
• Add JTS benchmarks

All changes v0.5.0...v0.6.0

v0.5.0

• Rename nearest query to nearestOption and simplify it to return an entry option instead of option of tuple for the entry and distance to it
• Add nearestK query for search up to K of nearest entries
• Add nearest query to allow custom filtering or/and aggregation of entries during search
• Simplify f parameter function of custom search queries to return Unit instead of Boolean
• Extract array wrappers to separated (non inner) classes to avoid possible memory leaks due holding of reference on R-tree instance

All changes v0.4.0...v0.5.0

v0.4.0

• Added constructors of entries for plane and spherical geometries
• RTree2D API changed: constructor methods for entries separated and moved to different namespaces for plane and spherical geometries (EuclideanPlane and SphericalEarth objects accordingly); returned collections are IndexedSeq now (was Seq); collections of entries for packing and update are Iterable now (was Traversable)
• Improved error messages in constructors for entries

All changes v0.3.1...v0.4.0

v0.3.1

• Fix of #8 by switching to more expensive calculations of distance from a point to the bounding box with the SphericalEarthDistanceCalculator, now it requires ~20 microseconds to find the nearest entry for 1M entry R-tries that are packed with nodeCapacity = 4 (see the chart below)

All changes v0.3.0...v0.3.1

v0.3.0

• Replace RTree.merge and RTree.diff functions by a more efficient RTree.update which allows to remove and add entries with a one subsequent bulk packing.
• Add the nearest function to search a nearest entry for the given point.
• Add ability to use RTree for indexing of spherical coordinates, where X-axis is used for latitudes, and Y-axis for longitudes in degrees. Result distances of the nearest function output are in kilometers.

All changes v0.2.0...v0.3.0

v0.2.0

• Add RTree.merge and RTree.diff function for efficient bulk inserting or removing of entries.
• Remove redundant dependency on scala-reflect library.
• More efficient build of R-tree and searching by point and rectangle.

All changes v0.1.0...v0.2.0

v0.1.0

Initial release of 2D immutable R-tree with STR (Sort-Tile-Recursive) packing