Abstract
Our purpose is to trace a contour in the form of a polygon. In this research, we use a bicubic spline function for interpolation of the elevation data on a grid covering the area of concern. We con...
Highlights
We develop a method to trace a contour for the surface interpolated by a bicubic spline function in the form of a polygon
We can obtain the same polygon no matter which point we choose on the contour as a starting point, different from iterative methods using discretization
We propose an algorithm composed of the following four phases: (i) Interpolation with bicubic spline functions. (ii) Detection of the grid cells with relevant contour points on their sides. (iii) Computation of the coordinates for the contour points. (iv) Selection of the contour point on the sides of a grid cell
Summary
We develop a method to trace a contour for the surface interpolated by a bicubic spline function in the form of a polygon. The algorithm of tracing and drawing contour is sometimes referred to as “contour tracing” and “contouring.” The pioneering work is Cottafava and Moli (1969) Their method is to compute contour points on a rectangular grid and connect them together to form a contour. Since they use the intermediate value theorem to detect a contour point, the number of contour points on a side of a cell is always presumed to be no more than one.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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.
