A Multi-Ring Polygon Self-Intersecting Pattern Recognition and Processing Method

Abstract

The invention discloses a multi-ring polygon self-intersecting pattern recognition and processing method, which includes obtaining the nodes and line segments that make up the multi-ring polygon in the multi-ring polygon, marking in a counterclockwise direction, and obtaining the outer ring and inner ring of the multi-ring polygon Ring; calculate the minimum enclosing rectangle of each line segment, and establish an R-tree index, identify all minimum enclosing rectangles intersecting with the minimum enclosing rectangle of a certain line segment, form multiple pairs of minimum enclosing rectangles, and put them into the pending candidates of the line segment Concentration and other steps. The advantages are: according to the spatial relationship between the elements constituting the self-intersection pattern, the self-intersection pattern category of the multi-ring polygon is refined, and the topology and distance relationship between the elements are used to realize the automatic identification of different types of self-intersection patterns; The shifting and shrinking algorithm of the minimum visual distance constraint processes various self-intersecting modes of multi-ring polygons to ensure that the processing results meet topology, shape consistency and visual distinguishability at the same time.

Description

technical field [0001] The invention relates to the technical field of cartography, in particular to a multi-ring polygon self-intersecting pattern recognition and processing method. Background technique [0002] Polygon self-intersection is a special form of intersection calculation and a key factor affecting data quality. Usually, polygon self-intersection occurs in data operations that significantly change the shape of polygons, such as spatial superposition operations, map comprehensive transformation, etc. Although the number of polygon self-intersections is very small in one calculation, it will cause obvious topological errors. And directly cause subsequent map operations to crash, so it is very important to efficiently and accurately detect polygon self-intersections and process them into simple polygons. [0003] In computational geometry, a polygon refers to a closed connected area surrounded by a group of nodes (more than 2) connected sequentially in a certain di...

AI Technical Summary

Problems solved by technology

[0005] The object of the present invention is to provide a kind of polycyclic polygon self-intersecting pattern recognition and processing method, thus solve the aforementioned problems existing in the prior art

Images