High-performance intersection method for cutting polygons
A polygonal, high-performance technology, applied in the field of intersection, can solve the problems of failing to fully consider the impact of calculation efficiency of polygonal structure differences, only considering the specific implementation process of the algorithm, and large differences in polygonal structures.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0025] see figure 1 , figure 1 Shown is a schematic flowchart of a high-performance intersection method for clipping polygons provided by an embodiment of the present application. A high-performance intersection method for clipping polygons, comprising the following steps: (1) reading a clipping layer and a clipped layer, and intersecting the clipping layer and the outer ring of the clipped layer to obtain The first polygon; (2) judging whether the clipping layer and the clipped layer have an inner ring, and if there is no inner ring, output the first polygon as an intersection result.
[0026] In detail, the clipping layer and the clipped layer are read, and the clipped layer is clipped using the clipping layer. The first polygon that overlaps is obtained by intersecting the clipping layer and the outer ring of the clipped layer. Optionally, the size of the clipping layer is larger than the size of the outer ring of the clipped layer, so as to filter out a large number of ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
