Terrain section data thinning method, device and equipment

Abstract

The embodiment of the invention discloses a terrain section data thinning method, device and equipment, and the method comprises the steps: obtaining terrain section data of a target section; recursively obtaining a section highest point and a section lowest point in each data point corresponding to the topographic section data according to a preset horizontal spacing threshold value; according tothe angular point characteristics of the target section, obtaining forced reservation data points, and segmenting terrain section data based on the forced reservation data points, the highest point of the section and the lowest point of the section to obtain segmented terrain data; and according to a preset rarefaction threshold value, adopting an improved Douglas pucker algorithm to rarefactionthe segmented terrain data to obtain rarefied terrain section data, wherein the threshold value index of the improved Douglas pucker algorithm is the ratio of the vertical distance between the data point and the connecting line of the end points on the two sides to the horizontal distance between the end points on the two sides. The method, device and equipment are suitable for thinning the multi-section line data of the engineering terrain section, especially the bridge terrain section.

Description

technical field

[0001] The invention relates to the technical field of engineering survey and design, in particular to a thinning method, device and equipment for terrain section data. Background technique

[0002] The Douglas-Peucker algorithm is an algorithm that approximates the curve as a series of points and reduces the number of points. Please refer to figure 1 , the basic idea of ​​the algorithm is: connect the first and last points of each curve to form a straight line, and find the distance between all points on the curve and the straight line, such as figure 1 Shown in part (1); find the maximum distance value d max , using d max Compare with tolerance D, if d max <D, all the middle points on the curve will be discarded, if d max ≥D, then keep d max Corresponding coordinate points, such as figure 1 As shown in part (2), keep the fourth point on the curve; divide the curve into two parts with this point as the boundary, and repeat the above process for thes...

Images