Algorithms for the parametric analysis of metric, directional, and intersection reach

Chen Feng and Wenwen Zhang
Additional contact information
Chen Feng: Georgia Institute of Technology, USA

Environment and Planning B, 2019, vol. 46, issue 8, 1422-1438

Abstract: By asking how much street length can be reached from a given origin within a specified distance limit, and by defining distance in different ways as a function of the physical or cognitive effort required to move in cities, the analysis of reach produces measures that effectively characterize street density, connectivity, and the associated urban potential. While the conceptual foundation for reach analysis has already been laid, the computational aspects have not been sufficiently addressed. We introduce the different graph representations and algorithms we developed to analyze metric reach, directional reach, and intersection reach—a new addition to the existing measures. The graph representation we developed for directional reach analysis also sets the foundation for more advanced graph-based street network analysis. We also provide formulae for computing the mean directional and intersection reach. Finally, we discuss common street network modeling issues that can be addressed by consistent mapping protocols.

Keywords: Metric reach; directional reach; intersection reach; street connectivity; space syntax (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/2399808319827299 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:46:y:2019:i:8:p:1422-1438

DOI: 10.1177/2399808319827299

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().