Spatial Analysis

1
Spatial Analysis vector data analysis

• Topic 2
• Starting 2/1/2007

2
Recap three data models

• Vector
• Raster
• Geodatabase (object-oriented data model)
• Vector data and table
• feature class is the basis
• Raster data

The real world is complex. Either discrete
(object) or continuous (field) can not
efficiently represent some of real world
situations. We need combined model dual, hybrid,
or object-oriented approach
3
Spatial Analysis tools in ArcToolBox
Shapefile Feature class/table
Coverage
Raster
4
Details
Coverage
Shapefile and feature class/table
Raster
5
Spatial Analyst extension
6
1. Extract

• To create a new subset from the input (shapefile,
  features and attributes in a feature class or
  table) based on spatial intersection or an
  attribute query.
• Clip
• Select
• Split
• Table select only

7
Clip

• ff

8
Select
9
Split
10
2. Overlay

• Joining two existing sets of features into a
  single set of features to identify spatial
  relationships between the input features.
• Erase
• Identify
• Intersect
• Symmetrical difference
• Union
• Updata

11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
3. Proximity

• Identify features that are closest to one
  another, calculate the distances around them, and
  calculate distances between them.
• Buffer
• Multiple ring buffer
• Near
• Point distance

18
(No Transcript)
19
(No Transcript)
20
Not dissolved
Dissolved
21
Example
22
(No Transcript)
23
(No Transcript)
24
Some specials for coverage
25
How to form Thiessen polygons

• Also known as 'Voronoi networks' and 'Delaunay
  triangulations', Thiessen polygons were
  independently discovered in several fields of
  study, including climatology and geography. They
  are named after a climatologist who used them to
  perform a transformation from point climate
  stations to watersheds.
• Thiessen polygons can be used to describe the
  area of influence of a point in a set of points.
  If you take a set of points and connect each
  point to its nearest neighbor, you have what's
  called a triangulated irregular network (TIN). If
  you bisect each connecting line segment
  perpendicularly and create closed polygons with
  the perpendicular bisectors, the result will be a
  set of Thiessen polygons. The area contained in
  each polygon is closer to the point on which the
  polygon is based than to any other point in the
  dataset.