CN107369194B - Method and device for filling pattern - Google Patents

Method and device for filling pattern Download PDF

Info

Publication number
CN107369194B
CN107369194B CN201610307758.9A CN201610307758A CN107369194B CN 107369194 B CN107369194 B CN 107369194B CN 201610307758 A CN201610307758 A CN 201610307758A CN 107369194 B CN107369194 B CN 107369194B
Authority
CN
China
Prior art keywords
line
graph
key point
gpu
pixel
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201610307758.9A
Other languages
Chinese (zh)
Other versions
CN107369194A (en
Inventor
王洪虎
胡佳林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Loongson Technology Corp Ltd
Original Assignee
Loongson Technology Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Loongson Technology Corp Ltd filed Critical Loongson Technology Corp Ltd
Priority to CN201610307758.9A priority Critical patent/CN107369194B/en
Publication of CN107369194A publication Critical patent/CN107369194A/en
Application granted granted Critical
Publication of CN107369194B publication Critical patent/CN107369194B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • G06T11/40Filling a planar surface by adding surface attributes, e.g. colour or texture

Abstract

The invention provides a method and a device for filling a pattern, wherein the method for filling the pattern comprises the following steps: obtaining coordinates of two key points with the farthest distance along the pixel arrangement direction on the graph; calculating the coordinates of the end points of line segments formed by the intersection of the graph and the pixel rows from one key point to another key point; wherein the pixel rows are perpendicular to the pixel arrangement direction; and calling a drawing interface function of a GPU (graphics processing unit) from the key point to the other key point so that the GPU draws a line according to the end point coordinates of the line segment to fill the graph. The method for filling the graph can reduce the burden of a CPU, improve the utilization rate of the GPU and further improve the system performance.

Description

Method and device for filling pattern
Technical Field
The invention relates to the technical field of computer graphic processing, in particular to a method and a device for filling graphics.
Background
In a computer system, different patterns can be designed and drawn through a graphic processing software or other application software carried by the computer system, wherein the most basic patterns comprise: points, lines, curves, triangles, rectangles, circles and ellipses, etc., while the pattern may be further processed by software, e.g., filled in.
At present, in a vxWorks operating system based on a Microprocessor without interlocked pipeline (MIPS) architecture, when a display chip is a silicon system technology (also referred to as SIS) display chip, a display card driver does not have an implementation interface for filling circles or ellipses, and therefore, when circles or ellipses need to be filled, circles or ellipses can only be directly filled by a Central Processing Unit (CPU).
However, if the CPU is required to execute each circle or ellipse filling, the load of the CPU is increased, the utilization rate of the CPU is reduced, and the system performance is greatly reduced when the CPU is busy.
Disclosure of Invention
The invention provides a method and a device for filling graphics, which can reduce the burden of a CPU (Central processing Unit), improve the utilization rate of a GPU (graphics processing Unit) and further improve the system performance.
The method for filling the pattern provided by the invention comprises the following steps:
obtaining coordinates of two key points with the farthest distance along the pixel arrangement direction on the graph;
calculating the coordinates of the end points of line segments formed by the intersection of the graph and the pixel rows from one key point to another key point; wherein the pixel rows are perpendicular to the pixel arrangement direction;
and calling a drawing interface function of a GPU (graphics processing unit) from the key point to the other key point so that the GPU draws a line according to the end point coordinates of the line segment to fill the graph.
The invention provides a device for filling patterns, which comprises:
the acquisition module is used for acquiring the coordinates of two key points with the farthest distance along the pixel arrangement direction on the graph;
the calculation module is used for calculating the end point coordinates of each line segment formed by the intersection of the graph and each pixel row from one key point to another key point; wherein the pixel rows are perpendicular to the pixel arrangement direction;
and the line drawing module is used for calling a line drawing interface function of the GPU from the key point to the other key point so that the GPU draws lines according to the end point coordinates of the line segment to fill the graphs.
The invention provides a method and a device for filling a pattern, wherein the method for filling the pattern comprises the following steps: the method comprises the steps of obtaining coordinates of two key points which are farthest away from each other along the pixel arrangement direction on a graph, calculating end point coordinates of line segments formed by the intersection of the graph and each pixel row from one key point to another key point, and calling a line drawing interface function of a GPU from one key point to another key point so that the GPU draws lines to fill the graph according to the end point coordinates of the line segments. According to the method for filling the graph, the graph filling is realized through the GPU by calling the line drawing interface function of the GPU, and the direct use of the CPU for the graph filling is avoided, so that the burden is reduced for the CPU, the utilization rate of the GPU is improved, and the system performance is further improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flowchart illustrating a method for filling a pattern according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of an ellipse in the method for filling a pattern according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a method for filling a pattern according to a second embodiment of the present invention;
fig. 4 is a schematic structural diagram of an apparatus for filling a pattern according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The method and the device for filling the graph provided by the embodiment of the invention are mainly applied to the environment that a vxWorks operating system based on an MIPS processor adopts an SIS display chip, and solve the technical problem of low CPU utilization rate when a circle or an ellipse is filled at present.
Fig. 1 is a flowchart of a method for filling a pattern according to an embodiment of the present invention, where the method for filling a pattern according to the embodiment executes an apparatus whose main body is a filling pattern, for example: the CPU, which is the method for filling a graphic provided in this embodiment, may be specifically packaged as a graphic filling interface function in a graphics card driver, and when the apparatus for filling a graphic is executing the graphic filling interface function, the method for filling a graphic provided in this embodiment is executed. As shown in fig. 1, the method for filling a pattern provided in this embodiment may include:
step 101, obtaining coordinates of two key points with the farthest distance along the pixel arrangement direction on the graph.
In the present embodiment, the figure refers to a closed pattern that can be filled. Wherein the graph may be a regular graph, such as: triangles, rectangles, squares, trapezoids, parallelograms, rhombuses, regular polygons, circles or ellipses, etc., and also irregular figures, such as: irregular polygons, or irregular patterns made of curves, and the like.
The key points are points on the graph, and the two key points are two points which are farthest away along the pixel arrangement direction on the graph. When two points farthest from each other in the pixel arrangement direction on the graph are a plurality of groups, two points in any one group are taken as two key points, for example: for a rectangle, because two opposite sides of the rectangle are parallel, there are multiple groups of two points that are farthest away along the pixel arrangement direction on the rectangle, and at this time, two points in any group can be used as two key points.
Here, the pixel is a basic code of a basic primary color element and its gradation, and is a basic unit constituting a digital image, and generally, the size of the resolution of the image is expressed in units of pixels per inch, and the arrangement of the pixels in the image is regular.
Optionally, the pixel arrangement direction is a horizontal direction or a vertical direction.
When the pixel arrangement direction is the horizontal direction, the coordinates of two key points with the farthest distance in the horizontal direction on the graph can be obtained through the step. When the pixel arrangement direction is the vertical direction, the coordinates of two key points which are farthest away in the vertical direction on the graph can be obtained through the step.
Optionally, the graph is a circle or an ellipse, and the two key points are two opposite tangent points on the circle or the ellipse, which are tangent to the circumscribed rectangle. Specifically, when the pixel arrangement direction is the horizontal direction, the two key points are two tangent points which are tangent to a circle or an ellipse and a circumscribed rectangle and are opposite in position in the horizontal direction, and when the pixel arrangement direction is the vertical direction, the two key points are two tangent points which are tangent to a circle or an ellipse and a circumscribed rectangle and are opposite in position in the vertical direction.
This step will be described in detail below by taking an ellipse as an example. Fig. 2 is a schematic structural diagram of an ellipse in the method for filling a pattern according to an embodiment of the present invention, as shown in fig. 2, the center of the ellipse is an origin O (0,0) of a coordinate system, and assuming that the pixel arrangement direction is the horizontal direction, two key points on the ellipse that are farthest away in the horizontal direction may be a point a1(-a,0) and a point a2(a, 0). Assuming that the pixel arrangement direction is the vertical direction, the two key points on the ellipse that are farthest away in the vertical direction may be a point B1(0, B) and a point B2(0, -B).
And 102, calculating the end point coordinates of each line segment formed by the intersection of the graph and each pixel row from one key point to another key point.
The pixel rows are perpendicular to the pixel arrangement direction.
Wherein, the starting sequence of the two key points is not particularly limited. For example, if the two key points are the key point P1 and the key point P2, respectively, the two key points may be from the key point P1 to the key point P2, or from the key point P2 to the key point P1.
In this step, from one key point to another key point, the end point coordinates of all line segments formed by intersecting the graph with all pixel rows between the two key points are calculated, and each line segment includes two end points. When the intersection of the pixel rows and the graph is only a point on the graph, at this time, the pixel rows and the graph do not form intersecting line segments, that is, the intersecting line segments are 0.
This step will be described in detail below by taking an ellipse as an example.
As shown in fig. 2, when the pixel arrangement direction is the horizontal direction, two key points farthest away in the horizontal direction on the ellipse may be a point a1(-a,0) and a point a2(a,0), and since the pixel arrangement direction is the horizontal direction, the pixel row is the vertical direction. In this step, the end point coordinates of a line segment formed by intersection of all pixel rows between the keypoint a1 and the keypoint a2 with an ellipse are calculated starting from the keypoint a1 until the keypoint a2 or starting from the keypoint a2 until the keypoint a1, wherein each pixel row intersects with an ellipse to form a line segment. For example, for the pixel line L1, the two end points of a line segment formed by the intersection of the pixel line L1 and an ellipse are C1(x1, y1) and C2(x2, y2), respectively.
When the pixel arrangement direction is the vertical direction, two key points farthest away in the vertical direction on the ellipse may be a point B1(0, B) and a point B2(0, -B), and since the pixel arrangement direction is the vertical direction, the pixel row is in the horizontal direction. In this step, the end point coordinates of a line segment formed by intersection of all pixel rows between the key point B1 and the key point B2 with an ellipse are calculated starting from the key point B1 until the key point B2 or starting from the key point B2 until the key point B1, wherein each pixel row intersects with the ellipse to form a line segment. For example, for the pixel line L2, two end points of a line segment formed by the intersection of the pixel line L2 and an ellipse are D1(x3, y3) and D2(x4, y4), respectively.
And 103, calling a line drawing interface function of the GPU from one key point to another key point so that the GPU draws a filled graph according to the end point coordinates of the line segment.
In this step, a drawing interface function in a Graphics Processing Unit (GPU) is called from one key point to another key point, and the GPU may draw each line segment according to the endpoint coordinates of each line segment obtained in step 102, that is, the GPU may draw a line segment on each pixel line inside the graphic, and when each pixel line inside the graphic is filled with a line segment, the whole graphic is filled.
This step will be described in detail below by taking an ellipse as an example. As shown in fig. 2, when the pixel arrangement direction is the horizontal direction, for the pixel line L1, the GPU calls the draw line interface function of the GPU, and can draw a line segment between the end points C1(x1, y1) and C2(x2, y 2). When the pixel arrangement direction is the vertical direction, for the pixel line L2, the GPU calls a draw line interface function of the GPU, and the GPU may draw a line segment between the end point D1(x3, y3) and the end point D2(x4, y 4).
Therefore, in this step, by calling the drawing interface function of the GPU, the GPU can draw a line on each pixel inside the graph, and when the line is drawn from one end point of the graph to the other end point of the graph, the filling of the whole graph can be completed. Because the pattern is filled by directly calling the hardware interface through the GPU, the direct use of the CPU for pattern filling is avoided, the burden of the CPU is reduced, the utilization rate of the GPU is improved, and the system performance is further improved.
In this embodiment, the specific implementation manner of the line drawing interface function in the GPU is not limited, and only the line drawing function is implemented.
Optionally, as a specific implementation manner, the line drawing interface function may be in the following form, and when coordinates of two end points of a given line segment are given, the line drawing function may be implemented.
Figure BDA0000986894920000061
It should be noted that the method for filling a graphic provided in this embodiment may be specifically packaged as a graphic filling interface function in a graphics card driver, and when the apparatus for filling a graphic is executing the graphic filling interface function, the method for filling a graphic provided in this embodiment is executed. The embodiment does not limit the naming and specific implementation of the graph filling interface function, as long as the graph filling function is implemented.
Optionally, as a specific implementation manner, the graphical filling interface function may be in the following form, and when a graph is given, the graphical filling function may be implemented.
Figure BDA0000986894920000062
The embodiment provides a method for filling a pattern, which comprises the following steps: the method comprises the steps of obtaining coordinates of two key points which are farthest away from each other along the pixel arrangement direction on a graph, calculating end point coordinates of line segments formed by the intersection of the graph and each pixel row from one key point to another key point, and calling a line drawing interface function of a GPU from one key point to another key point so that the GPU draws lines to fill the graph according to the end point coordinates of the line segments. According to the method for filling the graph, the graph filling is realized through the GPU by calling the line drawing interface function of the GPU, and the direct use of the CPU for the graph filling is avoided, so that the burden is reduced for the CPU, the utilization rate of the GPU is improved, and the system performance is further improved.
Fig. 3 is a flowchart of a method for filling a pattern according to a second embodiment of the present invention, which provides another implementation manner of the method for filling a pattern on the basis of the first embodiment, and mainly provides a specific implementation manner of step 103 in the first embodiment. As shown in fig. 3, in step 103, the method for filling a graph, starting from one key point to another key point, of calling a draw line interface function of the GPU to draw a graph according to coordinates of an intersection point on each pixel row, may include:
step 201, calling a line drawing interface function to enable the GPU to draw a line according to the end point coordinates of the line segment on the first pixel row in the direction from one key point to another key point.
Step 202, determine whether the second pixel row in the direction includes another keypoint.
And step 203, if not, continuing to call the line drawing interface function to enable the GPU to draw a line according to the endpoint coordinates of the line segment on the second pixel line until the next pixel line in the direction comprises another key point.
In the embodiment, in the direction from one key point to another key point, starting from one end of the graph, firstly calling a line drawing interface function according to the end point coordinates of a line segment formed by the intersection of a first pixel row and the graph, realizing line drawing through a GPU, judging whether a second pixel row comprises another key point after the line drawing of the part of the first pixel row in the graph is completed, if so, indicating that the other end of the graph is reached, completing the filling of the graph, if not, indicating that the other end of the graph is not reached, continuing to call the line drawing interface function according to the end point coordinates of the line segment formed by the intersection of the second pixel row and the graph, realizing the line drawing through the GPU, and after the part of the second pixel row in the graph is completed, continuing to judge whether the next pixel row comprises another key point until the next pixel row comprises another key point, and completing the filling of the whole pattern.
The embodiment provides a method for filling graphics, which realizes graphics filling through a GPU by calling a line drawing interface function of the GPU, and reduces the burden for the CPU, improves the utilization rate of the GPU and further improves the system performance because the CPU is not used for graphics filling.
Fig. 4 is a schematic structural diagram of an apparatus for filling a pattern according to a first embodiment of the present invention, where the apparatus for filling a pattern provided in this embodiment may be a CPU, and is configured to execute a method for filling a pattern according to any one of the embodiments shown in fig. 1 to fig. 3. As shown in fig. 3, the apparatus for filling a pattern provided in this embodiment may include:
the obtaining module 11 is configured to obtain coordinates of two key points on the graph that are farthest away from each other in the pixel arrangement direction.
And the calculating module 12 is used for calculating the endpoint coordinates of each line segment formed by the intersection of the graph and each pixel row from one key point to another key point. The pixel rows are perpendicular to the pixel arrangement direction.
And the line drawing module 13 is configured to call a line drawing interface function of the GPU from one key point to another key point, so that the GPU draws a line according to the end point coordinates of the line segment to fill the figure.
Optionally, the line drawing module 13 is specifically configured to:
and calling a drawing interface function to enable the GPU to draw a line according to the endpoint coordinates of the line segment on the first pixel row in the direction from one key point to another key point.
It is determined whether the second pixel row in the direction includes another keypoint.
And if not, continuing to call the line drawing interface function so that the GPU draws a line according to the endpoint coordinates of the line segment on the second pixel line until the next pixel line in the direction comprises another key point.
Optionally, the graph is a circle or an ellipse, and the two key points are two opposite tangent points on the circle or the ellipse, which are tangent to the circumscribed rectangle.
Optionally, the pixel arrangement direction is a horizontal direction or a vertical direction.
The embodiment provides a device for filling patterns, which comprises: the device comprises an acquisition module, a calculation module and a line drawing module. The device for filling the graph provided by the embodiment realizes graph filling through the GPU by calling the line drawing interface function of the GPU, and directly uses the CPU to fill the graph is avoided, so that the burden is reduced for the CPU, the utilization rate of the GPU is improved, and the system performance is further improved.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (6)

1. A method for filling graphs is applied to a vxWorks operating system, the method is packaged as a graph filling interface function in a display card driver, when a device for filling graphs executes the graph filling interface function, the method for filling the graphs is executed, and the device is a CPU; the method comprises the following steps:
obtaining coordinates of two key points with the farthest distance along the pixel arrangement direction on the graph;
calculating the coordinates of the end points of line segments formed by the intersection of the graph and the pixel rows from one key point to another key point; wherein the pixel rows are perpendicular to the pixel arrangement direction;
calling a line drawing interface function of a GPU (graphics processing Unit) from the key point to the other key point so that the GPU draws a line according to the end point coordinates of the line segment and fills the graph;
the graph is a circle or an ellipse, and the two key points are two opposite tangent points which are tangent to the circumscribed rectangle on the circle or the ellipse.
2. The method according to claim 1, wherein the calling a draw line interface function of a GPU from the one keypoint until the other keypoint to cause the GPU to draw a line to fill the graph according to the endpoint coordinates of the line segment comprises:
calling the line drawing interface function to enable the GPU to draw a line according to the endpoint coordinates of the line segment on the first pixel row in the direction from the key point to the other key point;
determining whether a second pixel row in the direction includes the another keypoint;
if not, continuing to call the line drawing interface function to enable the GPU to draw a line according to the endpoint coordinates of the line segment on the second pixel line until the next pixel line in the direction comprises the other key point.
3. The method according to claim 1 or 2, wherein the pixel arrangement direction is a horizontal direction or a vertical direction.
4. An apparatus for populating graphics, the apparatus being a CPU configured to run a vxWorks operating system, the apparatus comprising:
the acquisition module is used for executing the step of acquiring the coordinates of two key points with the farthest distance along the pixel arrangement direction on the graph in a graph filling interface function in the display card drive;
the calculation module is used for calculating the end point coordinates of each line segment formed by the intersection of the graph and each pixel row from one key point to another key point in a graph filling interface function in the display card drive; wherein the pixel rows are perpendicular to the pixel arrangement direction;
a line drawing module, configured to execute a line drawing interface function of a graphics processor GPU from the one key point to the another key point in a graphics filling interface function in a graphics card driver, so that the GPU draws a line according to an end point coordinate of the line segment to fill the graph;
the graph is a circle or an ellipse, and the two key points are two opposite tangent points which are tangent to the circumscribed rectangle on the circle or the ellipse.
5. The apparatus of claim 4, wherein the line striping module is specifically configured to:
calling the line drawing interface function to enable the GPU to draw a line according to the endpoint coordinates of the line segment on the first pixel row in the direction from the key point to the other key point;
determining whether a second pixel row in the direction includes the another keypoint;
if not, continuing to call the line drawing interface function to enable the GPU to draw a line according to the endpoint coordinates of the line segment on the second pixel line until the next pixel line in the direction comprises the other key point.
6. The apparatus according to claim 4 or 5, wherein the pixel arrangement direction is a horizontal direction or a vertical direction.
CN201610307758.9A 2016-05-11 2016-05-11 Method and device for filling pattern Active CN107369194B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610307758.9A CN107369194B (en) 2016-05-11 2016-05-11 Method and device for filling pattern

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610307758.9A CN107369194B (en) 2016-05-11 2016-05-11 Method and device for filling pattern

Publications (2)

Publication Number Publication Date
CN107369194A CN107369194A (en) 2017-11-21
CN107369194B true CN107369194B (en) 2022-04-15

Family

ID=60304469

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610307758.9A Active CN107369194B (en) 2016-05-11 2016-05-11 Method and device for filling pattern

Country Status (1)

Country Link
CN (1) CN107369194B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110196716B (en) * 2018-02-26 2023-07-25 龙芯中科技术股份有限公司 Graphic display method, graphic display device, electronic equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102521789A (en) * 2011-12-21 2012-06-27 合肥芯硕半导体有限公司 Trapezoidal filling method based on computer unified device architecture (CUDA)
CN104408759A (en) * 2014-11-19 2015-03-11 江苏影速光电技术有限公司 Vectorgraph rasterizing method for digital micromirror display
CN105493150A (en) * 2013-08-28 2016-04-13 高通股份有限公司 Target independent stenciling in graphics processing

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050122543A1 (en) * 2003-12-05 2005-06-09 Eric Walker System and method for custom color design
CN102376099B (en) * 2010-08-19 2013-09-11 北大方正集团有限公司 Method and system for improving vector graph filling effect
CN102184515B (en) * 2011-04-13 2013-02-06 合肥芯硕半导体有限公司 Method for filling ladder diagram in FPGA (Field Programmable Gate Array)
CN103033134B (en) * 2013-01-07 2016-02-24 上海理工大学 For detection system and the method for damaged optical fiber geometric parameter

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102521789A (en) * 2011-12-21 2012-06-27 合肥芯硕半导体有限公司 Trapezoidal filling method based on computer unified device architecture (CUDA)
CN105493150A (en) * 2013-08-28 2016-04-13 高通股份有限公司 Target independent stenciling in graphics processing
CN104408759A (en) * 2014-11-19 2015-03-11 江苏影速光电技术有限公司 Vectorgraph rasterizing method for digital micromirror display

Also Published As

Publication number Publication date
CN107369194A (en) 2017-11-21

Similar Documents

Publication Publication Date Title
JP6705912B2 (en) Method and apparatus for recognizing character areas in an image
US10510325B2 (en) Rendering method, rendering apparatus, and electronic apparatus
CN111435438A (en) Graphical fiducial mark recognition for augmented reality, virtual reality and robotics
WO2017067287A1 (en) Fingerprint recognition method, apparatus, and terminal
CN104408759A (en) Vectorgraph rasterizing method for digital micromirror display
CN109615685B (en) UML-oriented GPU texture mapping-based texture execution device and method for hardware view model
CN111583381B (en) Game resource map rendering method and device and electronic equipment
WO2018018941A1 (en) Method and system for zooming image by using cooperation between opengl and opencl
CN107369194B (en) Method and device for filling pattern
JP5777726B2 (en) Drawing apparatus and drawing program
US20160314615A1 (en) Graphic processing device and method for processing graphic images
US20170236310A1 (en) Image processing lsi and image processing program
CN106952216B (en) Line detection method based on IMX6 graphics processor
JP6730804B2 (en) Image processing apparatus and image processing method
CN112184685B (en) Image data determination method and device
CN113741835A (en) Method and device for realizing effect of trotting horse lamp
US6930686B1 (en) Method and apparatus for drawing thick graphic primitives
CN117065331B (en) Game scene loading control method and system
CN103824310A (en) Method for generating characters with special light effect
WO2024008142A1 (en) Animation rendering method and apparatus, and device and storage medium
CN109544653B (en) WebGL independent process rendering method based on education operating system and electronic equipment
CN112581352B (en) Multi-GPU-oriented high-performance primitive split-screen grating method
CN116485923A (en) Drawing method, device, equipment and storage medium based on Turtle library
CN107895381A (en) Distance determines method and device
CN1186748C (en) Method for selecting data processing path and graphics processing unit using method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 100095 Building 2, Longxin Industrial Park, Zhongguancun environmental protection technology demonstration park, Haidian District, Beijing

Applicant after: Loongson Zhongke Technology Co.,Ltd.

Address before: 100095 Building 2, Longxin Industrial Park, Zhongguancun environmental protection technology demonstration park, Haidian District, Beijing

Applicant before: LOONGSON TECHNOLOGY Corp.,Ltd.

GR01 Patent grant
GR01 Patent grant