f-matches | Composable alternative for Lodash.matches | Reflection library

It is possible to detecting route overlaps and intersections using direct 2D geometric line algorithms, however depending on the scale of your route and the accuracy of the data 2D geometry may miss many physical intersections between points or it may miss lines that are very close to intersecting, like either side of a wide roadway, but do not actually overlap.

• To deal with the first issue, we use Spatial data types and Geography based algorithms.
• The second issue we resolve by expanding the route with a buffer zone around the line, this is effectively applying an extended radius around all the edges of the shape.

Once the data has been translated into polygons, we can use standard intersect functions to determine if shapes intersect with or are entirely contained within the input.

This image explains what we want to detect, the light purple shape is the input the green and the darker purple shape show the two route_infos in the database, the final solution should select out the darker shape, as it is contained within the input:

A spatial solution without using a buffer zone around the route: