Academic Journal of Computing & Information Science, 2022, 5(12); doi: 10.25236/AJCIS.2022.051206.

## A Contour Interpolation Method Based on the Nearest Distance Method to Construct Auxiliary Lines

Author(s)

Wang Hao1, Lin Jian1, Gao Bin2

Corresponding Author:
Wang Hao
Affiliation(s)

1Hunan University of Science and Technology, Xiangtan, China

2Hunan Hangrui Digital Technology Co. Ltd, Changsha, China

### Abstract

The regional interpolation method calculates the characteristic distance of the contour nodes to complete the node matching, divides the contour into multiple regions with consistent change trends, and constructs auxiliary lines equally within the region to complete the interpolation. Aiming at the uncertainty of the area divided by the regional interpolation method and the redundancy of the auxiliary line constructed, a contour interpolation method using the nearest distance method to construct the auxiliary line is proposed. Firstly, the Doiglas-Peucker algorithm is used to extract the feature points of the contour line, and the nearest distance method is used to construct the auxiliary line for the feature points, and then the new contour line is interpolated. The nearest distance method constructs the auxiliary line based on the distance between the feature point and the feature point. The auxiliary line can reflect the change trend of the contour line, so that the new contour line can retain the curve features of the original contour line. Compared with the regional interpolation method, the method in this paper has a single uncertainty factor and the auxiliary lines constructed are simple and efficient, which improves the interpolation efficiency. Through experimental comparison, the effectiveness of the method is verified.

### Keywords

Contour line, Auxiliary line, Nearest distance method, Doiglas-Peucker, Feature point

### Cite This Paper

Wang Hao, Lin Jian, Gao Bin. A Contour Interpolation Method Based on the Nearest Distance Method to Construct Auxiliary Lines. Academic Journal of Computing & Information Science (2022), Vol. 5, Issue 12: 38-46. https://doi.org/10.25236/AJCIS.2022.051206.

### References

[1] Yang Xiao-Qing. (2004). The Research of contour line generating algorithm. Taiyuan University of Technology.

[2] HU Wei-Ming, WU Bing, LING Hai-Bin. (2000). An Automatic Method for Contour Interpolation in Map Design. Journal of Computer Science (08), 847-851.

[3] CAO Yin, ZHAO MU-Dan. (2007) The realization of contour interpolation algorithm of DLG. Science of Surveying and Mapping (02), 67-68+178.

[4] AN Xiao-Ya, SUN Qun, Xiao Qiang, ZHA0 Guo-cheng. (2008). Method of Part Contour Interpoation Based on Heuristic Algorithm. Journal Geomatics Science and Technology (01), 50-53.

[5] Gong You-Lian, He Yu-Hua, FU Zi-Ao. (2002). A practical algorithm for contour interpolation. Journal of Institute of Surveying and Mapping (01), 36-37+41.

[6] Qian Hai-Zhong, Wang Xiao, Liu Hai-Long, He Hai-Wei. (2015). An Algorithm for Interpolating Contour Lines Using Tangent Circle. Geomatics and Information Science of Wuhan University (10), 1414-1420.

[7] LIN Chun-feng, MIN Shi-ping, HUANG Hua-ping. (2014). A New Method for Counter Interpolation. Railway Investigation and Surveying (03), 5-7.

[8] HAO Zhi-Wei, LI Cheng-Ming, YIN Yong, WU Peng-Da, WU Wei.(2019), A contour interpolation algorithm based on Fréchet distance. Bulletin of Surveying and Mapping (01), 65-68+74.

[9] AN Xiao-Ya, Liu Ping-Zhi, Yang Yun, Huo Su-yuan. (2015). A Method for Measuring Geometric Similarity of Linear Features and Its Application. Journal of Institute of Surveying and Mapping (09), 1225-1229.

[10] Peng Ren-Can, DONG Jian, ZHEN YI-Don, LI Gai-Xiao. (2010). The Efficiency Comparison of Methods between Perpendicular Distance and Douglas-Peucker in Deleting Redundant Vertexes. Bulletin of Surveying and Mapping (03), 66-67+71.

[11] Yang Guang-Yi, ZHANG Xiao-Pen, WANG LI-Wei, CHEN Bin-Chuang. (2010). The methods to pick up characteristic points of topography base on intervisibility and D-P algorithm. Science of Surveying and Mapping (01), 83-84.