Trapezoidal filling method based on computer unified device architecture (CUDA)
A filling method and trapezoidal technology, applied in the direction of image data processing, instruments, image data processing, etc., can solve the problems of low efficiency, not convenient enough, GDI drawing cannot meet the processing of a large amount of graphic data, etc., to meet the needs of a large amount of graphic data processing , Improve the effect of filling efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0026] Such as figure 1 , figure 2 , image 3 Shown, the present invention comprises the following steps:
[0027] ①. Prepare bitmap graphics data: According to the needs, you can choose monochrome, 8-bit, 24-bit or 32-bit bitmaps, and set the initial gray value of the filling for non-monochrome images. In this embodiment, an 8-bit image is selected, and the filled gray value is a fixed value.
[0028] ②. Prepare trapezoidal vertex data: For each bitmap graphic, the trapezoid that needs to be filled may be different. Put the coordinates of these trapezoidal vertices in a structure array of trapezoidal vertices, and assign different sizes to the trapezoidal groups of different bitmap graphics. memory space, and save these trapezoid vertices.
[0029] ③. Assign the number of Blocks and Threads: Because the bitmap graphics can be filled in parallel, there will be no conflicts, so each Block is assigned a bitmap graphic, and then the trapezoid that needs to be...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 