csis workshop on research agenda for spatial analysis position paper by atsu okabe
TRANSCRIPT
Summing up,
In most spatial point pattern analysis, Assumption 1: 2-Dimensional Assumption 2: Homogeneous Assumption 3: Euclidean distance Assumption 4: Unbounded The space characterized by these assumptions
= “ideal” space Useful for developing pure theories
Advantages
No boundary problem!
http://www.whitecliffscountry.org.uk/gallery/cliffs1.asp
boundary problem
Actual example
Insects on the White desert, Egypt
http://www.molon.de/galleries/Egypt_Jan01/WhiteDesert/imagehtm/image12.htm
Actual example
“Scattered village” on Tonami plain, Japan
http://www.sphere.ad.jp/togen/photo-n.html
The “ideal” space is far from the real space!
Real space “Ideal” space
The objective is to fill this gap
Network space
Network space is appropriate to deal with
traffic accidents
robbery and car jacking
pipe corrosion
traffic lights
etc.
because these events occur on a network.
How to use facilities?
home facilities
Through networks
gate EntranceStreet Street
sidewalks
roads
railways
Facilities are represented by access points on a network
housecamera shop
Access point Access point
StreetStreet
Assumption 2
The distance between two points on a network is measured by the shortest-path distance.
Assumption 1
The distribution of stores are affected by the
population density.
The population distribution is not uniform
Probabilistically homogeneous assumption is unrealistic
Uniform network transformation
Any p-heterogeneous network
can be transformed into
a p-homogeneous network!
Probability integral transformation
x
xFdxxfy ).()(
Density function on a link: non-uniform distribution
Un
iform d
ist ribu
tion
y
x
f(x)
Stores in multistory buildings
A store on the 1st floor
A Store on the 2nd floor
A store on the 3rf floor
Ele
vato
r
Street
Summing up,
Spatial analysis
on a plane
2-dimensional
Isotropic
Probabilistically homogeneous
Euclidean distance
Unbounded
Spatial analysis
on a network
1-dimensional
Non-isotropic
Probabilistically homogeneous
Shortest-path distance
Bounded
Methods for spatial analysis on a network
Nearest distance methodConditional nearest distance methodCell count methodK-function methodCross K-function methodClumping methodSpatial interpolationSpatial autocorrelation Huff model
SANET: A Toolbox for Spatial Analysis on a NETwork* Network Voronoi diagram* K-function method* Cross K-function method* Random points generation (Monte Carlo) Nearest distance method Conditional nearest distance method Cell count method Clumping method Spatial interpolation Spatial Autocorrelation Huff model