Spatial Algorithms 0.2.5-neo4j-4.4.3

The port from Neo4j 4.3 to Neo4j 4.4 was a simple dependency change. The easiest port in many releases. The largest risk probably remains from the refactoring required to get the 4.3 version working.

Spatial Algorithms 0.2.5-neo4j-4.3.9

It turns out that in Neo4j 4.3 (not earlier) if we break from loops that iterate over relationships, the cursors are not cleaned up. We will report this as a bug to the Neo4j kernel developers, but we can work around it by never using break or continue label from within getRelationship loops. This required refactoring a few internal parts of the OSM model traversal and polygon/polyline building code.

Spatial Algorithms 0.2.5-neo4j-4.2.11

Several fixes around polygons and polylines after testing with data from North Carolina. The data had many issues that exposed bugs/limitations in the algorithms.

Spatial Algorithms 0.2.4-neo4j-4.2.6

Re-release for Neo4j 4.2.6. No code changes required, so it seems this might be binary compatible with Neo4j 4.1 also.

Spatial Algorithms 0.2.4-neo4j-4.1.3

Some improvements that were useful for the osm-routing-app demo for NODES 2020 conference:

• Support getting polygon main shell
• Get distances between convex hull versions of polygons (fast)
• Optimize normal distance calculation to first get convex-hull distance and then use two for loops in a row, instead of nested (WGS84 only, cartesian is still slow)

Spatial Algorithms 0.2.3-neo4j-4.1.3

Ported to Neo4j 4.1 and compiled and tested against Neo4j 4.1.3

Spatial Algorithms 0.2.3-neo4j-4.0.8

Ported the library to Neo4j 4.0, and tested against 4.0.8. There were some API changes in Neo4j 4.0 in the first couple of patch releases, so it is anticipated this library probably does not work with those versions, but should work will all later versions. It was compiled and tested against 4.0.8.

Spatial Algorithms 0.2.2-neo4j-3.5.11

This is an alpha release based on the code that was demonstrated in the NODES 2019 conference.