Abstract
Representation of results/data graphically depicts a better understanding of the behavior of the results/data. Contour plotting is an easy way of representing results/data. Contouring algorithms use linear interpolation in determining the point of the intersection between contour lines and grid segments when drawing contour lines. Using linear interpolation is not very precise and results in discontinuities at end points. This paper presents and examines the contouring algorithm that uses inverse distance weighting interpolation in determining the point of the intersection between contour lines and grid segments of randomly generated data. Comparison made between the maps produced by these algorithms that use linear, cubic and inverse distance weighting interpolation, showed that the map produced by inverse distance weighting interpolation is wrong because different contour lines cross each other, the map produced by cubic interpolation depicts less information because some contour lines are missing when compared with the map produced by linear interpolation
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
