3 ms·
I think the point of hashing here would be to have a high-confidence equality indicator with a fast comparison speed. Having a low-confidence indicator (like co
by Two4 2y ago
I think the point of hashing here would be to have a high-confidence equality indicator with a fast comparison speed. Having a low-confidence indicator (like coord count) that still requires significant computation afterward that cannot be cached defeats this purpose.
- biosboiii 2y agoIn a production environment, where you deal with huge sets (think OSM), the solution may be a mix of both. One aspect that I didn't deal with (yet) is also, that a Polygon can have redundant points (think A(1|1) B(2|2) C(3|3) D(1|2)), which you should simplify. Ideally you would also split the map into hexagons, and compute which Geometry lays within which hexagon(s), and then only compare the geometry that shares a hexagon(s), but this information should be persisted and not computed each runtime, making it a bit out-of-scope for pure GeoJSON hashing.