Overlay and Buffer Analysis
Overlay and Buffer Analysis
ANALYSIS
By,
ABHILASH RAJENDRA
The resulting buffer is a new polygon, which can be used in queries to determine which entities occur either within or outside the defined buffer zone.
Two types of buffers: 1. Constant width buffers, and 2. Variable width buffers. Both types can be generated for a set of coverage features based on each features attribute values. Buffer primitives are classified as point, line, and polygon buffering operations.
Buffering points:
A point is the basic unit of resolution in any GIS system. Buffering point data involves the creation of a circular polygon about the point of interest. The radius of this circular polygon is called the buffer distance.
If one is buffering multiple points in the same layer, then the buffering algorithms check for overlaps in each points buffer and remove the overlapping sections.
If multiple point buffers intersect or overlap, as illustrated in Figure 1, then the system takes all the overlapping polygons and combines them into one or more polygons that represent a layer.
Buffering Lines:
Buffering lines is a little more complicated than buffering point data. This is mainly due to the fact that lines can be made up of multiple segments. Line segments are handled independently of each other.
Buffering Polygons:
Buffering of polygonal surfaces uses most of the same concepts used for line buffering. The only significant change is that the polygon buffer is created on only one side of the line that defines the polygon. In polygon buffering two options are available, namely an outside polygon which surrounds or contains the polygonal surface under consideration or an inside polygon that is contained inside the polygonal surface under consideration.
Overlay Analysis:
Overlay analysis is an technique of deriving new information from two or more layers of data covering the same area.
For instance, if we have a layer of land use and a layer of soil fertility, we can derive from the two layers the percentage of agricultural land developed over fertile soil. In the land use layer of our example, we are interested in the agricultural lands. So we group all other land use types into non-agricultural lands. Similarly, we identify fertile and non-fertile soils in the soil fertility layer.
After we have reduced each layer into two classifications, we can perform intersection, union, subtraction, and other logical operations on them.
Intersection
Union
Subtraction
Vector Overlay:
In vector overlay, the input layers and the output composite layer are topologically structured. Hence an overlay operation generates new nodes, arcs, and polygons.
Overlay analysis using vector data involves quite a few calculations like, cut arcs from the two layers to form new ones, form new polygons out of the new arcs, and so on.
Vector overlay can be performed on different types of map features: viz., 1. Polygon-on-polygon overlay 2. Line-in-polygon overlay 3. Point-on-polygon overlay The process of overlay will depend upon the modeling approach the user needs.
Raster Overlay:
It is a relatively straightforward operation and often many data sets can be combined and displayed at once.
Overlay Methods
"Piercing Needle" Approach: Point by point overlay analysis is referred to as the"piercing needle"approach. When multiple themes of data -- such as forests, water, soils, elevation, etc. -- are in relative position with one another, inserting a "digital pin" through the stack of overlaid data, allows questions to be answered concerning everything occurring at a particular location.
However, the point by point view of the world limits focus to a particular point which precludes wide-area landscape analysis.
CONCLUSION:
Overlaying does not involve only areas. We sometimes overlay areas upon lines to find out, for instance, how many countries a river flows through , areas upon points for example would be to determine how many trees there are within a park A buffer is an area defined by the bounding region determined by a set of points at a specified maximum distance from all nodes along segments of an object.
Thank You!!!