000			01873nab a2200253 4500
999			_c11664 _d11664
003			OSt
005			20210427172016.0
007			cr aa aaaaa
008			210427b ||||| |||| 00| 0 eng d
100			_aFeng, Chen _940778
245			_aAlgorithms for the parametric analysis of metric, directional, and intersection reach
260			_bSage, _c2019.
300			_aVol 46, Issue 8, 2019 (1422-1438 p.)
520			_aBy 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.
650			_aMetric reach, _946027
650			_a directional reach, _946028
650			_a intersection reach, _945699
650			_astreet connectivity, _946029
650			_aspace syntax _946030
700			_aZhang, Wenwen _946031
773	0		_011590 _915512 _dSage 2019. _t Environment and Planning B: Urban Analytics and City Science
856			_uhttps://doi.org/10.1177/2399808319827299
942			_2ddc _cART