Storage-efficient reconstruction framework for planar contours

AbstractA storage-efficient reconstruction framework for cartographic planar contours is developed. With a smaller number of control points, we aim to calculate the area and perimeter as well as to reconstruct a smooth curve. The input data forms an oriented contour, each control point of which consists of three values: the Cartesian coordinates (x, y) and tangent angle θ. Two types of interpolation methods are developed, one of which is based on an arc spline while the other one is on a cubic Hermite spline. The arc spline-based method reconstructs a G1 continuous curve, with which the exact area and perimeter can be calculated. The benefit of using the Hermite spline-based method is that it can achieve G2 continuity on most control points and can obtain the exact area, whereas the resulting perimeter is approximate. In a numerical experiment for analytically defined curves, more accurate computation of the area and perimeter was achieved with a smaller number of control points. In another experiment usi...