1. Questions
Planar graph representations are widely used in urban road-network analysis because they simplify the study of connectivity, centrality, and routing structure. A planar graph can be embedded in the plane so that edges intersect only at shared endpoints (Fritsch and Fritsch 1998), a property on which many graph-theoretic methods depend, including cycle–cut duality and related results for planar graphs (Whitney 1932; Kasteleyn 1961). Real road networks frequently violate it, because overpasses, underpasses, elevated expressways, and multi-level interchanges create crossings where roads do not physically meet (Boeing 2020). Geographic non-planarity must nevertheless be distinguished from graph-theoretic non-planarity. The former concerns whether mapped road geometries cross; the latter concerns whether the abstract network admits any crossing-free embedding, irrespective of the original coordinates. This study addresses the latter.
Forcing such a network into planar form requires that edges be removed, reshaped, or replaced with artificial nodes. These operations are usually treated as a technical convenience, but they alter the object being measured through which urban form is subsequently interpreted.
Three questions follow. First, how much distortion does planar approximation introduce in real urban road networks? Second, are some network metrics substantially more sensitive to it than others? Third, can the magnitude of distortion be anticipated from properties of the original network, that is, from its baseline topological scale, or only from the intensity of edge exclusion that the planarity constraint imposes?
2. Methods
Road networks were extracted from OpenStreetMap using OSMnx (Geoff Boeing 2017). Primary, secondary, trunk, and associated link roads were included, while motorways were excluded to focus on intra-urban network structure. Each city was represented as an undirected graph in which intersections are nodes and road segments are edges, and only the largest connected component was retained. The complete node and edge datasets used for all 40 cities are publicly available at https://github.com/Todai-ops/Planarization-in-Urban-Road-Networks.
Planar counterparts were constructed using a greedy maximal planar sub-graph procedure guided by edge betweenness centrality, which measures how often an edge lies on shortest paths between node pairs. Edges with higher values were treated as more important for maintaining shortest-path connectivity. Prioritizing them makes the resulting sub-graph a conservative estimate of distortion, since an arbitrary or geometry-based ordering would discard shortest-path-critical edges more often and would inflate the measured effect.
Edge betweenness centrality was computed for every edge in the original network; edges were ranked from highest to lowest; and edges were then added one at a time to an initially empty graph on the full node set, each addition being retained only if it preserved planarity. This construction does not guarantee connectivity and was therefore verified for each city: the resulting sub-graph spanned the original node set and remained connected in all 40 cases.
Original and planarized networks were compared using six metrics: density (observed relative to possible edges), mean clustering coefficient (interconnection among neighbouring nodes), diameter (longest shortest path), mean straightness centrality (Euclidean-to-network distance ratio), global efficiency (mean reciprocal shortest-path length), and average shortest-path cost (mean pairwise shortest-path cost). The last three are not mutually independent, as each is a function of shortest-path length; they are reported together for comparability with existing work rather than as separate lines of evidence. Since the node set is unchanged, the proportional change in density equals the proportion of edges excluded, which is referred to below as edge loss.
For each city and metric, the original value, planarized value, and percentage change were calculated. Cross-city variation in the change in average shortest-path cost was assessed using Spearman correlation and ordinary least squares regression, with edge loss, original diameter, and original average shortest-path cost as candidate predictors: the first measures the intensity of the planarity constraint, and the latter two represent baseline topological scale. The implementation was checked using the two canonical non-planar Kuratowski graphs, and In both cases, the procedure removed edges until the resulting graph satisfied the graph-theoretic planarity condition while remaining connected. Robustness to alternative edge-ordering rules was not assessed; therefore, the magnitudes reported below are specific to the betweenness-prioritised heuristic.
3. Findings
Under the applied heuristic, planarization increased average shortest-path cost in every city, by a mean of 12.77% (median 10.85%, IQR 3.30–16.16), ranging from 0.21% in Auckland to 53.41% in Shanghai (Table 1). The distribution is right-skewed, so the mean overstates the typical case.
Sensitivity differed sharply across metrics. Straightness centrality and global efficiency fell by 10.11% and 8.04%, respectively, closely tracking the increase in cost and as expected given their shared dependence on shortest-path length. Diameter was the exception, remaining unchanged in 21 cities (52.5%, median 0%). This stability reflects its status as a single-pair extremum rather than an absence of distortion: Beijing’s diameter rose by 26.13% while its average cost rose by only 13.89%. Diameter is therefore the least informative of the six metrics for detecting planarization effects, not the most robust.
Grouping cities into sample-derived thirds by their cost increases, rather than by fixed thresholds, reveals a monotonic gradient across all path-based metrics. Mean edge loss rises from 2.84% in the lower third (0.21–6.91%; 14 cities; mean cost increase 2.59%) to 7.20% in the middle third (7.13–14.16%; 13 cities; 11.01%) and 9.70% in the upper third (14.52–53.41%; 13 cities; 25.50%), while mean straightness falls by 3.10%, 10.19%, and 17.57% respectively. The largest effects occur in densely grade-separated networks such as Shanghai, Shenzhen, Bangkok, and Doha, and the smallest in predominantly at-grade gridded networks such as Auckland, Melbourne, Chicago, and Toronto, despite the exclusion of motorways from all networks.
Distortion was associated with edge exclusion rather than with baseline topological scale. Edge loss predicted the increase in cost strongly (Spearman’s with the corresponding regression explaining 69.6% of cross-city variation such that each additional percentage point of edge loss was associated with a 2.33-percentage-point increase in cost (95% CI: 1.82–2.84). Neither original diameter nor original average shortest-path cost showed a detectable association at
Acknowledgements
The authors thank the editors and anonymous reviewers for their constructive comments, which improved the manuscript.
