A primitive filling method and system based on a dynamic boundary group sequence
A primitive and boundary technology, applied in the field of primitive filling based on dynamic boundary group sequence, can solve the problems of inability to accurately locate the boundary, low algorithm efficiency, large space overhead, etc., and achieve optimal loading and display time, Improved accuracy and improved fill out-of-bounds issues
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0041] The present invention is based on the primitive filling method of dynamic boundary group sequence, comprising:
[0042] Get the coordinates of the starting point of the primitive to be filled;
[0043] Use the scan line to scan the area where the primitives to be filled row by row or column by column from the starting point, and stop scanning until there is no boundary point of the primitives to be filled in the scanned row or column;
[0044] Obtain the coordinates of the intersection position of the scanning line and the boundary of the primitive to be filled in real time, and push them into the preset boundary group sequence stack in turn;
[0045] For each intersection point in the boundary group sequence stack, combine them according to the order of entering the stack, and obtain at least one filled line segment with the combination of intersection points as the two endpoints;
[0046] Fill the coordinate area and / or fill points covered by each filled line segment...
Embodiment approach
[0053] When the starting point of filling is the vertex or the lowest point of the primitive to be filled, the scan line is a scan line whose vertical coordinate is y, and each row of the region where the primitive to be filled is scanned successively by using the scan line. In this implementation manner, the overall filling order of the primitives to be filled in the present invention is from top to bottom or from bottom to top.
[0054] When the starting point of filling is the left vertex or the right vertex of the primitive to be filled, the scan line is a scan line whose abscissa is x, and each column in the region where the primitive to be filled is scanned successively by using the scan line. In this implementation manner, the overall filling order of the primitives to be filled in the present invention is from left to right or from right to left.
[0055] It also includes: obtaining the pixel value of the starting point of the primitive to be filled; when using the sca...
Embodiment 2
[0063] refer to figure 1 As shown, the present embodiment is based on the method of dynamic boundary group sequence filling primitives, including steps:
[0064] S1, get the coordinates of the filling starting point, including:
[0065] S101, using the mouse to click any point inside the graphic element to be filled, and obtaining the coordinates of the point;
[0066] S102, starting from the selected point coordinates, traversing from bottom to top to obtain the first upper boundary point of the graphics element to be filled in the corresponding column;
[0067] S103, starting from the first upper boundary point, according to the traversal method from left to right, bottom-up, traversing until a certain line no longer detects the boundary point, then the left end boundary point of the previous line of the line is used as filling scan The starting point of , that is, the starting point of scanning line filling, obtains the coordinates of this point;
[0068] S2, starting fr...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com