Vector graph filling method

Abstract

The invention relates to a vector graph filling method. The method comprises the following steps that (1) coordinate monotonous chains are established for the inner boundary and / or the outer boundaryof a graph to obtain monotonous chain intervals, (2) an interval binary heap is established, and nodes of the binary heap store a number interval and a monotonous chain list which is initially empty;(3) the monotonic chain obtained in the step (1) is inserted into the node of the binary heap obtained in the step (2); and (4) independent intersecting a plurality of scanning lines and filling are carried out. The filling method can adapt to filling of various types of graphs, the operation efficiency of graph filling is remarkably improved in a parallel intersection mode, the implementation process is simple, and the total storage space consumption is small.

Description

technical field [0001] The invention belongs to the field of graphics processing, and in particular relates to a filling method for vector graphics. Background technique [0002] When using a direct-write exposure machine for the production of printed circuit boards, it is necessary to digitize the graphics to be printed. Since the DMD (Digital Micro mirror Device, digital micromirror device) used in the direct-write exposure machine can receive data as dot matrix graphics, and the external CAM (computer Aided Manufacturing, computer-aided manufacturing) graphics received by the exposure machine are usually Vector graphics, so it is necessary to convert vector graphics into bitmap data, which requires filling of vector graphics. [0003] The filling methods of traditional vector graphics are as follows: [0004] The Bresenham filling method first fills the blocks where all the vertices are located, then fills the edges according to the connection relationship of the points...

AI Technical Summary

Problems solved by technology

When meeting or passing a vertex, the edge state needs to be changed. Since the scanning process is single-threaded, hardware resources cannot be fully utilized, and the overall calculation cycle is long and inefficient;

[0006] The direct intersection method uses a straight line to intersect a graph in parallel, and two groups of intersection points are combined into line segments, and the filling result is obtained discretely. However, every time a straight line intersects a graph, all edges of the graph need to be processed, and a large number of them are disjoint, resulting in Waste of calculation, especially when the model is complex, the efficiency is obviously low

Images