Vector character stroke filling optimization method

Abstract

The invention discloses a vector character stroke filling optimization method. The length of a data representation unit is defined as the total bit length of 16 binary bits, and the defined data representation unit is used for representing a single closed-loop stroke contour of a vector character, so that the position of a stroke contour coordinate point can be analyzed more accurately in the process of transversely scanning the stroke contour; therefore, characters are restored as much as possible when the middle areas of the left boundary point and the right boundary point of the stroke outline are transversely filled, the effect of equivalently removing longitudinal analysis filling is achieved, the problem of dependence on embedded master control performance is solved, and meanwhile occupation of RAM resources is reduced. According to the method, the mask value containing the data representation unit information is adopted so that when the character strokes are filled, on one hand,the problem of temporary storage can be avoided, the resource use condition of the RAM is greatly compressed, and on the other hand, the filling frequency can be reduced, the code execution efficiency is improved, and the user experience is improved. The optimization method also has a great practical effect on large word size vector character stroke filling.

Description

technical field [0001] The invention relates to the field of computer graphic display, in particular to a method for optimizing vector character stroke filling. Background technique [0002] For the display field of embedded master control, most of the traditional vector character stroke filling algorithms involve the idea of ​​combining independent horizontal analysis filling and independent vertical analysis filling to act on the same stroke, and restore characters in as many dimensions as possible: [0003] Scan the outline of the stroke horizontally to obtain the coordinate values ​​of the coordinate points of the outline of the stroke, and use the same vertical coordinate value as the division condition, store the coordinate values ​​of the coordinate points of the outline of the stroke in the array A, and read each row of strokes from the array A in turn The coordinate value of the outline coordinate point determines the position of the left and right boundary points o...

AI Technical Summary

Problems solved by technology

[0004] The existing technology has the following disadvantages: the original design of the traditional longitudinal analysis filling algorithm depends on the high-end performance of the embedded main control platform. The filling effect is almost the same as the horizontal analysis filling effect, and the repeated filling part has the problem of occupying a large amount of RAM resources; in systems such as single-chip microcomputers, the smallest data storage unit is a byte, that is, 8bit, so for completed filling The bit needs to be temporarily stored, and part of the RAM resources will be occupied during this process; for large-size vector character stroke filling, there are especially many filling instructions, the time consumed will increase exponentially, the execution efficiency is low, and the occupation ratio of RAM resources is increased , poor practicality

Images