GPU-based method for calculating random polygon intersection area

Abstract

The invention discloses a GPU-based method for calculating a random polygon intersection area. According to the method disclosed by the invention, rasterization is carried out on a random polygon by using a GPU and thus the polygon expressed by a vertex coordinate is converted into polygon raster images expressed by rasters; according to the intersection situation of the raster images, assignment and correction are carried out on location identifiers of all rasters; and then statistics of the number of intersected rasters is carried out by using a CPU or GPU and an intersection area is calculated. The method is not limited by concavity and convexity of the polygon; and on the basis of the parallel characteristic of the GPU, the method enables the processing speed to increase substantially by being compared with the CPU-based computing method. Moreover, the principle is simple and the method is convenient to implement. The experiment result demonstrates that the method disclosed by the invention is suitable for any complex polygon; and a problem of singularity in the traditional calculation method can be solved, so that the robustness is high.

Description

technical field [0001] The invention relates to the field of calculation of polygon intersection areas, in particular to a GPU-based calculation method for arbitrary polygon intersection areas. Background technique [0002] The intersection area of ​​plane polygons is widely used. In the fields of computer graphics, computational geometry, and computational fluid dynamics, it is necessary to calculate the area of ​​the common coverage area of ​​intersecting polygons. Its content includes two parts: intersection test and intersection area. The intersection area will be Shape and area calculations that determine polygon intersections. [0003] The existing methods for calculating the intersection area of ​​polygons are generally implemented by a general-purpose processor (CPU) of a computer in a serial processing manner. In recent years, in the fields of computer animation, virtual reality, etc., in order to express richer details, the existing CPU-based serial processing met...

AI Technical Summary

Problems solved by technology

However, in the prior art, for the calculation of the polygon intersection area, there is still a lack of an engineering implementation method based on GPU processing to complete the polygon intersection area

[0005] In addition, from the perspective of the shape of the intersecting polygons, most of the existing polygon intersection area calculation methods are calculated for the intersection area of ​​convex polygons, and for the intersection of concave polygons, most calculation methods need to triangulate or convexize the concave polygon first. Minute

Since the subdivision itself is more complex and will bring more edges to do intersection testing, this greatly increases the amount of calculation, especially for polygons with many concave points or a large number of intersection points

Therefore, in the prior art, the calculation of the intersection area of ​​concave polygons takes a lot of time, the workload is heavy, and the efficiency is low. Compared with the calculation of the intersection area of ​​convex polygons, the calculation of the intersection area of ​​concave polygons seems to be powerless.

Images