You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There's a conference paper here, which shows how this really is a purely spatial syntax phenomenon, requiring initial conversion of a graph into its dual representation. Bill Hillier's fabulously compelling writing notwithstanding, there is still very scarce evidence to suggest great scientific validity to dual graph representations, and the whole thing would be a heap of work for something that would be very unlikely to find general utility. Thoughts?
So maybe "angular betweenness" is not actually the thing we want; rather an option to route paths between two points based on sum of angular change, as in sDNA. That is very straightforward to incorporate. Most functions now have options for distance vs time calculations, so i'd just have to expand that to include angles as an additional option for "distance" metrics. Can do that!
Is it possible to calculate angular betweenness of edges in a network?
The text was updated successfully, but these errors were encountered: