By: Eyob A.

(Msc) Mwu CoE Seng Dep’t

 Spatial analysis

 It means GIS has an ability to interpret and investigate

the collected spatial information quantitatively and
qualitatively to extract useful output to solve real world
problem.
 After analysis, the output data can be presented in
various ways such as maps, report and three-
dimensional images.
 Single vs multiple Layer Analysis

Single Layer Analysis Multiple Layer Analysis

 single layer analyses are These analyses are those that
are undertaken on more than
those that are
two feature dataset.
undertaken on an
 Overlay
individual feature
dataset.  Union
 Intersection
 Buffering
 Clip
 Dissolve
 split
 Merge

By: Eyob A.(Msc) CoE Seng Dep’t

 Single Layer Analysis
Buffering
 Is the process of creating an output polygon layer
containing a zone (or zones) of a specified width
around an input point, line, or polygon feature
 Buffers are particularly suited for determining the
area of influence around features of interest.
 Buffers are common vector analysis tools used to
address questions of proximity in a GIS and can be
used on points, lines, or polygons.
By: Eyob A.(Msc) CoE Seng Dep’t
 Single Layer Analysis

 Buffering
 Several buffering options are available to refine the
output.
 Two primary types of buffers are available to the
GIS users:
1. Constant width and
2. variable width(Multiple ring buffers).

By: Eyob A.(Msc) CoE Seng Dep’t

 Single Layer Analysis

Dissolve
 The dissolve operation combines adjacent
polygon features in a single feature dataset
based on a single predetermined attribute.
Merge
 The merge operation combines features within
a point, line, or polygon layer into a single
feature with identical attribute information.

By: Eyob A.(Msc) CoE Seng Dep’t

 Multiple Layer Analysis

Overlay
 Is the process of taking
two or more different
thematic maps of the
same area and placing
them on top of one
another to form a new
map

By: Eyob A.(Msc) CoE Seng Dep’t

 Multiple Layer Analysis

Overlay
 Several basic overlay processes are available in a GIS
for vector datasets: point-in polygon, polygon-on-point,
line-on-line, line-in-polygon, polygon-on-line, and
polygon-on-polygon.
 Overlay methods can be more complex than that and
therefore employ the basic Boolean operators: AND,
OR, and XOR.

By: Eyob A.(Msc) CoE Seng Dep’t

 Multiple Layer Analysis

Overlay
 Several basic overlay processes are available in a GIS
for vector datasets: point-in polygon, polygon-on-point,
line-on-line, line-in-polygon, polygon-on-line, and
polygon-on-polygon.
 Overlay methods can be more complex than that and
therefore employ the basic Boolean operators: AND,
OR, and XOR.

By: Eyob A.(Msc) CoE Seng Dep’t

 Multiple Layer Analysis

 The union overlay method employs the OR

operator. A union can be used only in the case of
two polygon input layers .
 The intersection method employs the AND
operator.
 An intersection requires a polygon overlay, but can
accept a point, line, or polygon input.
The clip geoprocessing operation is used to extract those
features from an input point, line, or polygon layer that
falls within the spatial extent of the clip layer.
By: Eyob A.(Msc) CoE Seng Dep’t
 Multiple Layer Analysis

 The split geoprocessing operation is used to divide an

input layer into two or more layers based on a split layer

By: Eyob A.(Msc) CoE Seng Dep’t

 Classification of the analytical techniques

 Measurement functions allow the calculation of

distances, lengths and areas.
 Retrieval functions: selective searches of data
 Classification: allows the assignment of features to a
class based on attribute values.
 Generalization: Is a function that joins different classes
of objects with common characteristics
 Overlay functions: Combination of two or more spatial
data layers.
 Neighborhood functions: Evaluate the characteristics of
an area surrounding the features location
By: Eyob A.(Msc) CoE Seng Dep’t
 6.1 GIS vector data analysis

1. Geometric Measurement
 Geometric measurement on spatial features includes
counting, distance and area-size computations.
 The primitives of vector datasets are point, (poly)line
and polygon.
 Related geometric measurements are location, length,
distance & area size.
 Some of these are geometric properties of a feature in
isolation (location, length, area size); others (distance)
require two features to be identified.
By: Eyob A.(Msc) CoE Seng Dep’t
 Measurement cont’d..

 Distance between two points using Pythagorean distance

fun.
 If one or both features are not a point we will measure
the minimal distance between the two features

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 2. Retrieval function

 Spatial Selection by Attribute conditions: Using relational

operators such as Logical operators (and, or, not)
combining attribute conditions.
 Spatial selection using topological relationships: selecting
features that are inside selection objects, Selecting
features that intersect, selecting features adjacent to
selection objects.
 Selecting features based on their distance .

By: Eyob A.(Msc) CoE Seng Dep’t

 Retrieval function cont’d..

 Spatial Selection by Using Topological Relationship

By: Eyob A.(Msc) CoE Seng Dep’t

 3.Classification function

 Classification is a technique of purposely removing detail

form an input dataset, in the hope of revealing patterns (of
spatial distribution).
 We do so by assigning a characteristic value to each
element in the input set, raster, points, lines or polygons.

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
Classification function Cont’d..

By: Eyob A.(Msc) CoE Seng Dep’t

 4.Overlay function

Standard overlay operators take two input data layers

and assume that:
they are geo-referenced in the same coordinate
system and
they overlap in study area.
If either of these requirements is not met, the use of an
overlay operator is meaningless.
 The principle of spatial overlay is to compare the
characteristics of the same location in both data layers
and to produce a result for each location in the output
data layer
By: Eyob A.(Msc) CoE Seng Dep’t
 Overlay function cont’d..

The specific result to produce is determined by the user.

 It might involve a calculation or some other logical
function to be applied to every area or location.
Use logical connectors such as
 Intersection
Union
Difference
Complement

By: Eyob A.(Msc) CoE Seng Dep’t

Overlay function Cont’d…

By: Eyob A.(Msc) CoE Seng Dep’t

 5. Neighborhood function

 Will find out characteristics of the vicinity

(neighborhood) of a location.
 To perform neighborhood analysis we must:
 State which target locations are of interest to us,
and
 what is their spatial extent
 Define how to determine the neighborhood for
each target .

By: Eyob A.(Msc) CoE Seng Dep’t

 Neighborhood cont’d…

 Define which characteristic(s) must be computed

for each neighborhood
 Proximity computations
 Buffer zone generation
 Thiessen polygons

By: Eyob A.(Msc) CoE Seng Dep’t

 Neighborhood cont’d

Proximity computations
 For instance, our target might be a Water Point.
 Its neighborhood could be defined as
an area within 2 km travelling distance; or
all roads within 500 m travelling distance; or
all other water points (WPs) within 10 minutes
travelling time;
all residential areas for which the WP is the closest
WP.

By: Eyob A.(Msc) CoE Seng Dep’t

 Neighborhood Operations cont’d

Buffering
 Buffering involves measuring the distance outward in
all directions from an object. Buffering can be done on
all three types of vector data: point, line, area.

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 Neighborhood Operations cont’d

Buffering

By: Eyob A.(Msc) CoE Seng Dep’t

 Neighborhood Operations cont’d

 Thiessen polygons are generated from a set of sample

points such that each polygon defines an area of
influence around its sample point, so that any location
inside the polygon is closer to that point than any of the
other sample points.
 Thiessen polygon partitions make use of geometric
distance to determine neighborhoods.

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 Neighborhood Operations cont’d

 This is useful if we have a spatially distributed set of

points as target locations and we want to know the
closest target for each location in the study.
 This technique will generate a polygon around each
target location that identifies all those locations that
‘belong to’ that target.

By: Eyob A.(Msc) CoE Seng Dep’t

Thiessen polygons application

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 6.2. Raster analysis
1. Measurements 4. Neighborhood functions
 Buffer
 Location Distance Area
 Flow
size 5.Raster based surface
2. Classification analysis
 User controlled  Slope
 Automatic  Aspect
 These are created
3. Overlay using the Spatial
 Arithmetic operators Analyst tools and
 Comparison operators utilize a single-layer
 Logical operators raster, such as a Digital
 Conditional expressions Elevation Model
(DEM).
 Decision tables By: Eyob A.(Msc) CoE Seng Dep’t
 Raster analysis cont’d..

A. Measurements of Location

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 Raster analysis cont’d..

B. Measurements of Distance

By: Eyob A.(Msc) CoE Seng Dep’t

 Raster analysis cont’d..

C. Measurements of Area

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 Raster analysis cont’d..

2. (Re) Classification
 Classification is a technique of removing detail from
an input dataset in order to reveal patterns
 Classification will produce a new output dataset
 a new attribute in vector
 a new raster layer in raster
 If the input dataset itself is a classification we speak
of reclassification .
 Reclassification can be
1. User Controlled
2. Automatic
By: Eyob A.(Msc) CoE Seng Dep’t
 Reclassification cont’d..

a. User Controlled

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 Reclassification cont’d..

b. Automatic
 User specifies the number of output classes.
 Computer decides the class break points.
 Two techniques of determining the class breaks are
discussed: Equal frequency and Equal interval

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
Reclassification cont’d..

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 3. Raster overlay analysis

 New cell values are

calculated using map
algebra / raster calculus.
 Performed on cell-by-cell
basis.
 Operators:
a) Arithmetic overlay
operators
b) Comparison and logical
operators
c) Conditional
By: Eyob A.(Msc) CoE Seng Dep’t
expressions
4. Raster analysis: Neighborhood
functions

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
Neighborhood functions cont’d

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
Neighborhood functions cont’d

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
Neighborhood functions cont’d

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
Neighborhood functions cont’d

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
5. Raster analysis: Surface Analysis

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…
 Surface analysis Cont’d..

Slope angle calculation

• the calculation of the slope steepness, expressed as an angle in
degrees or percentages, for any or all locations.
• Slope aspect calculation
• The calculation of the aspect (or orientation) of the slope in
degrees (between 0 and 360), for any or all locations.

By: Eyob A.(Msc) CoE Seng Dep’t

By: Eyob A…