Curve simplification method based on a bending area and head and tail fracture classification

Abstract

The invention discloses a curve simplification method based on bending area and head and tail fracture classification. The curve simplification method comprises the following steps: dividing a curve into a plurality of bending arc sections by using a cable-stayed curve division method; Calculating the area defined by the bent arc section and the head and tail point connecting line; Calculating thearithmetic mean value of the areas of all the bent arc sections, and extracting the bent arc sections with the areas larger than the arithmetic mean value; If the number of the bent arc sections withthe area larger than the arithmetic mean value is smaller than 40% of the total number of the bent arc sections, enabling the bent arc sections with the area larger than the arithmetic mean value toserve as feature bends and serve as head bends in head and tail breakage classification to be reserved; adopting The rest bending arc sections as tail bending, calcuating the distance between each point in each bending arc section and the connecting line of the head point and the tail point of the bending arc section, and adopting the maximum distance as a feature point; S5, executing the step S5;Otherwise, executing the step S6; S5, combining the feature points of the head bending and the tail bending to obtain a comprehensive result; S6, ending. According to the method, the curve morphological characteristics are fully considered, and the calculation complexity is low.

Description

technical field [0001] The invention relates to the technical field of simplification and compression of vector curve graphics, and more specifically relates to a curve simplification method based on bending area and classification of head and tail fractures. Background technique [0002] Curves are often used to represent linear map symbols such as contour lines, coastlines, and road networks, and they exist widely in maps. The simplification problem is the core and key of map production automation and multi-scale display in GIS. Therefore, it has been widely concerned by scholars since the birth of cartography. [0003] The early curve simplification algorithm mainly considered from the perspective of reducing the number of vertices to realize the simplification of the curve, so as to achieve the purpose of reducing the amount of data storage and improving the efficiency of graphics rendering. For example: Nth point selection method, Douglas-Peucker algorithm, Lang simpli...

AI Technical Summary

Problems solved by technology

[0006] In view of this, the present invention provides a curve simplification method based on the bending area and head-tail fracture classification, which discards small bends and avoids destroying the characteristics of the original curve while considering the overall bending data and without using empirical thresholds Bending, to obtain comprehensive results that conform to natural laws at different levels of detail, and solve the problems of unreasonable threshold setting, ignoring curve shape characteristics, and large amount of complex calculations in traditional curve simplification methods

Images