Contour construction algorithm on the basis of point by point increasing of ground object scattered points

Abstract

The present invention provides a contour construction algorithm on the basis of point by point increasing of ground object scattered points. Ground object contours are generated by the method of point by point increasing. A comparatively good enclosing line linking scheme is quickly and accurately found through multiple iterations of point increasing to form a contour area of the ground object. By use of the algorithm, the disadvantages of explosive expansion of time of an enumeration algorithm in the prior art and unreliability of genetic algorithm are overcome. The possibility of polygon self-intersection is avoided through setting a criterion function so that the polygon is similar to the real ground area of buildings and therefore, statistic analysis can be performed to a certain area of buildings or any areas with regular shape.

Description

technical field [0001] The invention relates to a contour construction algorithm based on point-by-point addition of scattered points of ground objects, belonging to the field of geographic information science. Background technique [0002] When analyzing the distribution characteristics of buildings in an area, engineers can measure the sparse shape points of the area's features. The so-called shape points of the features refer to the corner points with obvious turning points in the ground contour area of ​​the features, which can be set A reference coordinate system, with the help of some traditional means (such as a tape measure) to measure the coordinates of these corner points. However, such shape points are often sparse, so it cannot be simply considered that the connection of shape points with similar distances constitutes a contour edge of the ground object. For the sparse shape points of ground objects, if its convex hull contains all the sparse shape points, this ...

AI Technical Summary

Problems solved by technology

This problem is similar to the TSP problem (Travelling Salesman Problem). The simplest solution to the TSP problem is the enumeration method. For n nodes, the time complexity of the TSP enumeration algorithm is O(n!). Obviously, this explosive growth The time complexity makes people have to seek better time algorithms, so TSP problems mostly focus on heuristic solutions. However, heuristic search algorithms have many shortcomings. For example, many parameters are set based on experience, the speed is relatively slow, and for Large-scale data points, genetic algorithm results are not reliable

Images