Quick polygon fill method of vectorgraph

Abstract

The invention discloses a quick polygon fill method of a vectorgraph. The quick polygon fill method of the vectorgraph has a specific technical scheme that the quick polygon fill method comprises the following steps: carrying out first preprocessing to a polygon, carrying out polygon cutting, and carrying out polygon filling, wherein the step of carrying out first preprocessing to the polygon comprises the following specific step: converting a point set list which represents a vector polygon in a file to be processed into a point minimum subset list which can represent the part, which is positioned in a screen display area, of the vector polygon. The quick polygon fill method of the vectorgraph overcomes a defect that a filling method in an original electronic chart engine has the disadvantages of big computing resource consumption, small hardware application range and non-ideal cooling, power consumption and system stability, greatly lowers the computing resource consumption of the display filling of a great quantity of vectorgraph elements in the electronic chart engine, reduces heat generated during the filling display processing of a great quantity of real-time graphs of a CPU or a graph display processing chip, effectively improves the time delay of real-time chart processing, and is especially suitable for low-configuration computers and mobile terminals of which the heat dissipating capacity and the operational performance are seriously restricted.

Description

technical field [0001] The invention belongs to the field of computer graphics, can be applied to map display in multiple industries including the GIS industry, and in particular relates to a fast polygon filling method for vector graphics. Background technique [0002] In vector graphic display, especially GIS, it is often necessary to display a piece of land or water. These areas can be displayed at different scales, and are actually displayed by thousands or even tens of thousands of points. If you use this to get the coordinates of these points and clip the screen once, it is quite time-consuming. [0003] In order to implement the electronic chart engine (display electronic charts in S57 format), it is necessary to solve the problem of display efficiency of a large number of graphic elements, and among them, the display filled with polygons is the most time-consuming. After testing, it is found that 70% to 80% of the time is used in clipping and filling of polygons. At...

AI Technical Summary

Problems solved by technology

[0005] The invention discloses a fast polygon filling method for vector graphics, which overcomes the low filling efficiency of the filling method in the original electronic chart engine, large consumption of computing resources, small applicable hardware range, heat dissipation, power consumption, and system The defects of unsatisfactory stability

Images