Spectral Modelling for Spatial Network Analysis

Spatial Networks represent the connectivity structure between units of space as a weighted graph whose links are weighted as to the strength of connections. In case of urban spatial networks, the units of space correspond closely to streets and in architectural spatial networks the units correspond to rooms, convex spaces or star-convex spaces....

Configurbanist: Easiest paths, fuzzy accessibility, and network centrality for walking and cycling in cities

In a quest for promoting sustainable modes of mobility, we have revisited how feasible and suitable is it for people to walk or cycle to their destinations in a neighbourhood. We propose a few accessibility measures based on an 'Easiest Path' algorithm that provides also actual temporal distance between locations. This algorithm finds paths that...

Easiest paths for walking and cycling: Combining syntactic and geographic analyses in studying walking and cycling mobility

Easiest paths for walking and cycling: Combining syntactic and geographic analyses in studying walking and cycling mobility

We discuss fundamentals of a new computational approach to configurative analysis and synthesis and present a number of advancements we have made in the direction of computational analysis of walking and cycling mobility. We have scrutinized the notion of distance and addressed it in correspondence with the notion of geodesic or optimum path. We...

Configurbanist: Urban Configuration Analysis for Walking and Cycling via Easiest Paths

In a quest for promoting sustainable modes of mobility, we have revisited how feasible and suitable is it for people to walk or cycle to their destinations in a neighbourhood. We propose a few accessibility measures based on an 'Easiest Path' algorithm that provides also actual temporal distance between locations. This algorithm finds paths that...