Storage-efficient reconstruction framework for planar contours
Storage-efficient reconstruction framework for planar contours
复制标题
平面轮廓的存储高效重建框架
DOI:
10.1080/10095020.2016.1194603
复制
发表时间:
2017
影响因子:
6
通讯作者:
Hiroyuki GOTO,Yoichi SHIMAKAWA
中科院分区:
文献类型:
--
作者:
Hirotsu N;Inoue K and Yamamoto K;Hiroyuki GOTO,Yoichi SHIMAKAWA
A 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 G1continuous 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 G2continuity 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 using a digital elevation model data, the reconstructed contours were smoother than those by a conventional method.