When preparing OSM data for use in a routing engine, graph topology is typically simplified to reduce network complexity. This compresses detailed ways into single edges, ideally between single-node intersections. However, complex intersections, such as those involving dual carriageways, can result in multiple nodes as well as small, intermediate edges. This talk shares some approaches that Mapbox uses to identify these subsystems and categorize possible maneuvers through them.
