Single-ring polygon self-intersection mode identification and processing method

Abstract

The invention discloses a single-ring polygon self-intersection mode identification and processing method, which comprises the steps of obtaining nodes and line segments forming a single-ring polygonin the single-ring polygon, performing identification in an anticlockwise direction, calculating a minimum bounding rectangle of each line segment, and establishing an R tree index; selecting any oneline segment as a reference line segment, and detecting a matching line segment adjacent to or intersected with the reference line segment by the R tree index to obtain a line segment pair consistingof the reference line segment and the corresponding matching line segment; performing line segment intersection calculation, namely judging whether the reference line segment is intersected with the matched line segment or not, and identifying a monocyclic polygon self-intersection mode according to a judgment result; and the like. The method has the advantages that the self-intersection mode is automatically recognized according to the distances and topological relations between the nodes, between the nodes and the line segments and between the line segments in the unilateral polygon, a structure fitting and retraction processing method is provided, and topological correctness, shape consistency and precision descriptibility are met while the processing result is guaranteed.

Description

technical field [0001] The invention relates to the field of cartography, in particular to a single-ring polygon self-intersecting pattern recognition and processing method. Background technique [0002] Polygonal self-intersection is a special form of intersection relationship, and it is also a typical topological error. Generally, a polygon is a closed curve formed by sequential connections of a group of nodes arranged in a certain direction (clockwise or counterclockwise) on a plane. Polygonal self-intersection often occurs in map data. For example, due to repeated addition of nodes during data collection, various map space operations are performed during data calculation, the polygon boundary shape is changed, or the data precision set during data processing is different. self-intersecting. The situation of polygon self-intersection can be divided into single-ring polygon self-intersection and multi-ring polygon (including holes) self-intersection, among which, single-...

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a single-ring polygon self-intersecting pattern recognition and processing method, thereby solving the aforementioned problems existing in the prior art

Images