PDF 20.134kB - TOBIAS-lib - Universität Tübingen
PDF 20.134kB - TOBIAS-lib - Universität Tübingen
PDF 20.134kB - TOBIAS-lib - Universität Tübingen
Sie wollen auch ein ePaper? Erhöhen Sie die Reichweite Ihrer Titel.
YUMPU macht aus Druck-PDFs automatisch weboptimierte ePaper, die Google liebt.
Stefan Fina Patterns of Urban Sprawl Geographical Analysis<br />
Table 2 Sensitivity tests for relevant properties of the Dispersion Index<br />
DI increases with disconnected greenfield developments Var. 1: small town<br />
(n=4, DI=0,8)<br />
When new urban entities are developed disconnected from<br />
existing entities, DI goes up. This is the case even if the spacing<br />
of new urban entities is as dense as for the existing. The<br />
relation to the added number of entities in the nearest neighbor<br />
ratio of actual versus artificially distributed entities ensures<br />
that this property is always true.<br />
DI decreases with infill development Var. 3: greenfield<br />
(n=16, DI=3,2)<br />
Additional disconnected greenfield developments can be<br />
considered as dispersed when compared to a single compact<br />
development (variation 3 vs. variation 1). However, if infill<br />
development occurs in existing urban areas, average distances<br />
between urban entities decrease, and accordingly, DI goes<br />
down.<br />
DI increases when restricted areas are taken into account Var. 5: dispersed<br />
(n=24, DI=2,78)<br />
In a randomly dispersed configuration of entities, DI is quite<br />
high. When geographical restrictions are considered (=<br />
undevelopable land) for the same configuration, remaining<br />
open spaces cannot be used for the artificial distribution of<br />
entities, and consequently, DI goes up.<br />
DI takes feature weights into account Var. 7: equal entities<br />
(n=32, DI=0,95)<br />
For each urban entity, a feature weight can be applied to<br />
distance calculations to give effect to different densities and<br />
#<br />
#<br />
!. !.<br />
# #<br />
#<br />
!. !. #<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !.<br />
#<br />
!. !. #<br />
#<br />
#<br />
#<br />
#<br />
!. !.<br />
thus likely levels of interaction between entities (e.g. number of<br />
households, number of people). The artificially dispersed<br />
entities carry an average weight. With this technique, density<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !. !. !. #<br />
#<br />
#<br />
!. !. !. !.<br />
# ## #<br />
# #<br />
#<br />
!. !. # !. !. #<br />
# #<br />
#<br />
!. !. #<br />
!. !. #<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !.<br />
variations are included in DI and higher concentrations of<br />
!. !. #<br />
!. !. !. !. !. !.<br />
#<br />
interacting agents in an urban center reduce DI.<br />
#<br />
!. !. #<br />
!. !. !. !.<br />
# # # !. !. #<br />
#<br />
DI gives effect to urban concentration Var. 9: leapfrogging<br />
(n=36, SR=5,17)<br />
Urban area configuration can be considered dispersed if<br />
entities are isolated from each other and cannot share<br />
infrastructure provisions. When they grow together, economies<br />
of scale allow for joint use of services and infrastructure, thus<br />
increasing efficiency. DI considers this effect by counting the<br />
number of entities in the artificial distribution that intersect<br />
existing urban areas and using the result as a weighting factor.<br />
Var. 2: disconnected<br />
(n=8, DI=1,14)<br />
Var. 4: infill<br />
(n=20, SR=1,75)<br />
Var. 6: restricted<br />
(n=24, DI =2,9)<br />
Var. 8: weighted<br />
(n=32, DI=0,51)<br />
Var. 9: amalgamation<br />
(n=36, SR=1,48)<br />
The results cannot be shown in detail in this research note, the positive aspects, however, can be<br />
summarized as follows:<br />
- DI allows for comparative analysis of any type of administrative or geographically defined area,<br />
regardless of their areal size, topographic setting, and no matter how many entities they are made<br />
up of.<br />
# Actual !.<br />
Distributed urban entities Open space Urban areas with "central place status"<br />
!.<br />
!.<br />
#<br />
!.<br />
#<br />
#<br />
!. !.<br />
# #<br />
!. !.<br />
# #<br />
!.<br />
!. !.<br />
# #<br />
# #<br />
!. !.<br />
#<br />
#<br />
!. !.<br />
#<br />
#<br />
!. !.<br />
# !.<br />
#<br />
!.<br />
#<br />
#<br />
!.<br />
#<br />
!. # !.<br />
#<br />
#<br />
!.<br />
#<br />
!.<br />
!.<br />
# !.<br />
!.<br />
!.<br />
!. #<br />
!. !. !. # !. !.<br />
#<br />
# #<br />
!.<br />
#<br />
!.<br />
#<br />
#<br />
!.<br />
#<br />
#<br />
!. !. !.<br />
#<br />
!.<br />
#<br />
#<br />
# #<br />
#<br />
!. # # !. !. #<br />
!.<br />
# #<br />
!.<br />
!.<br />
#<br />
!. !. # !. # !.<br />
#<br />
!. !.<br />
!.<br />
#<br />
#<br />
!.<br />
#<br />
!. # !. !. !.<br />
#<br />
# # #<br />
#<br />
# !. !. !. !. !. !.<br />
#<br />
#<br />
!.<br />
!.<br />
!.<br />
# #<br />
!.<br />
# #<br />
!.<br />
!.<br />
!.<br />
!.<br />
!.<br />
!.<br />
!.<br />
# #<br />
!. !.<br />
# #<br />
!.<br />
!.<br />
# !. #<br />
#<br />
# #<br />
!.<br />
!.<br />
!.<br />
!.<br />
!. # #<br />
#<br />
# # !.<br />
#<br />
#<br />
!. !.<br />
# #<br />
#<br />
!. !. #<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !. #<br />
!. !. #<br />
!. !.<br />
!. !.<br />
!.<br />
!.<br />
# # !.<br />
#<br />
!. # #<br />
!.<br />
# !. #<br />
#<br />
# #<br />
!.<br />
!. !.<br />
!. !.<br />
!. !. !. !. #<br />
#<br />
#<br />
!. !. !. !.<br />
##<br />
# #<br />
#<br />
!. !. # !. #<br />
# # # !.<br />
# #<br />
!. !. # !. !. #<br />
#<br />
##<br />
##<br />
#<br />
#<br />
## # #<br />
!. !.<br />
!. !.<br />
#<br />
!. !.<br />
!. !.<br />
#<br />
!.<br />
!.<br />
!.<br />
#<br />
!. !. #<br />
#<br />
#<br />
#<br />
#<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !.<br />
!. !.<br />
#<br />
# #<br />
!. !. #<br />
#<br />
!. !. !. # !. !.<br />
#<br />
# #<br />
!.<br />
#<br />
!.<br />
#<br />
#<br />
!.<br />
#<br />
#<br />
!. !. !.<br />
#<br />
!.<br />
#<br />
#<br />
# #<br />
#<br />
!. # # !. !. #<br />
!.<br />
# #<br />
!.<br />
!.<br />
#<br />
!. !. # !. # !.<br />
#<br />
!. !.<br />
!.<br />
#<br />
#<br />
!.<br />
#<br />
!. # !. !. !.<br />
#<br />
# # #<br />
#<br />
# !. !. !. !. !. !.<br />
#