2D complex polygon rendering method based on GPU acceleration

Abstract

The invention discloses a 2D complex polygon rendering method based on GPU acceleration, and the method comprises the following steps: (1) simply splitting a polygon vertex into a plurality of groups of triangles at a CPU side according to a polygon composite rule, and writing the triangles into a GPU data buffer area; (2) according to a grouping result in the step (1), in combination with a specific polygon composite rule, controlling the GPU to fill template buffer according to a corresponding rule for multiple times; (3) if the rule is an odd-even rule, directly adpting the negation rule buffered by the template to carry out one-time filling; (4) if the rule is a non-zero-rule, enabling two groups of triangles in different normal directions to be filled with templates in different growth directions for buffering; and (5) through the steps (3) and (4), enabling a non-zero pixel in the template buffer to be a final required rendering result. GPU side rendering of complex polygons is achieved, the complex polygons comprise concave polygons, self-intersecting polygons and polygons with holes, and the multiple polygons are compounded with the edge direction as the weight rule.

Description

technical field [0001] The invention relates to the field of computer graphics, in particular to a 2D complex polygon rendering method based on GPU acceleration. Background technique [0002] Complex polygons are very common in drawing software (such as EDA): user hand-drawing is not precise enough, and concave polygons and self-intersecting polygons are more likely to appear; as a vector graphics, complex polygons can easily express polygons with holes; vector text is natural It is complex multilateral. [0003] Generally, the rendering of complex polygons has the following three types and their disadvantages: using the polygonal Boolean operation scan line algorithm to realize full-pixel rasterization through the CPU, such as the typical SVG of the browser, which requires a lot of CPU computing power and high-resolution rendering The scene efficiency is low; the polygon triangulation algorithm is used by the CPU, the polygon is first split into multiple triangles, and the...

AI Technical Summary

Problems solved by technology

[0003] Generally, the rendering of complex polygons has the following three types and their disadvantages: the rasterization of full pixels is realized by using the polygon Boolean operation scan line algorithm through the CPU, which is more typical such as the SVG of the browser, which requires a lot of CPU computing power and high-resolution rendering The scene efficiency is low; the polygon triangulation algorithm is used by the CPU, the polygon is first split into multiple triangles, and then all the triangles are rasterized by the CPU or GPU. This method requires a long preparation time to triangulate the polygon on the CPU side; The NV_path_rendering plug-in developed by NVIDIA is implemented by calling the proprietary functions of NVIDIA graphics cards, which is not universal.

Images