**Interpolation** is a method of constructing new data points within range of discrete set of known data points. The number of data points obtained by sampling or experimentation represents values of function for limited number of values of independent variable.

The main task of Interpolation is to find suitable mathematical expression for known curve. This technique is used when we have to draw curve by determining intermediate points between known sample points.

**Types of Interpolation methods :**

**Inverse Distance Weighted (IDW) –**

In this method, estimation of cell values is done by averaging values of sample data points in neighborhood of each processing cell. A specified number of points or all points within specified radius can be used to determine output value of each location. The point closer to center of cell have more influence or weight in averaging process.**Kriging –**

Kriging is geostatistical procedure that considers both distance and degree of variations between known data points when estimating values in unknown areas. In this procedure, there is generation of an estimated surface from scattered set of points with z-values.**Natural Neighbor –**

Natural Neighbour interpolation method finds closest subset of input samples to query point. It applies weights to input samples based on proportionate areas to interpolate value. It is also known as Sibson or “area-stealing” interpolation.**Spline –**

In this interpolation method, estimation of values is done using mathematical function that minimizes overall surface curvature and results in smooth surface that passes exactly through input points.**Spline with barriers –**

Spline with barriers method is similar to spline method, only difference is that this tool honors discontinuities encoded in both input barriers and input point data.**Topo to raster –**

This method uses technique specifically designed to create surface that more closely represents natural drainage surface and better preserves stream networks from input contour data.**Trend –**

It is a global polynomial interpolation that fits smooth surface defined by mathematical function (a polynomial) to input sample points. The trend surface changes gradually and captures coarse-scale patterns in data.

## Recommended Posts:

- Methods for Text Clipping in Computer Graphics
- DDA Line generation Algorithm in Computer Graphics
- Point Clipping Algorithm in Computer Graphics
- 2D Transformation in Computer Graphics | Set 1 (Scaling of Objects)
- Translation of objects in computer graphics
- Segments in Computer Graphics
- Computer Graphics | Cathode ray tube (video display device)
- Computer Graphics | Antialiasing
- Draw a moving car using computer graphics programming in C
- Computer Graphics | The RGB color model
- Refresh type output devices in Computer Graphics
- Applications of Computer Graphics
- Window to Viewport Transformation in Computer Graphics with Implementation
- Display Processor in Computer Graphics
- Introduction to Computer Graphics
- Difference between Parallel and Perspective Projection in Computer Graphics
- Interactive Graphical Techniques in Computer Graphics
- Painter's Algorithm in Computer Graphics
- Creating a Rainbow using Graphics Programming in C
- How to add "graphics.h" C/C++ library to gcc compiler in Linux

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.