I'm faced with the problem of matching two street networks. I have these two differently sourced networks. The links in each network can be segmented, i.e. there is not necessarily a single whole link between two intersections, instead the link can be broken into an arbitrary number of segments with different attributes.
I should transfer the attributes from one network to the features of the other network and I figured for doing that I will have to match corresponding streets/street segments.
My current idea is to densify the links in either network and then do an analysis of the cumulative distances between vertices in the two networks? If the nodes of two segments overall have small distances from each other, the two links probably correspond? However, I can see problems if two corresponding road segments are expressed in links of wildly different length in the two networks. That notwithstanding, I'm unsure as to how to best go about implementing a method that would analyse the two networks and maybe also offer a way of visually exploring the quality of the matching.
On the plus side I'm familiar (to different degrees) with many platforms (ArcGIS, QGIS, SAGA, R, Python, ...) and can install any promising tool. I appreciate any pointers you may be able to give.