CN113345050B - Method and related device for modifying two-dimensional geometric frame - Google Patents
Method and related device for modifying two-dimensional geometric frame Download PDFInfo
- Publication number
- CN113345050B CN113345050B CN202110905655.3A CN202110905655A CN113345050B CN 113345050 B CN113345050 B CN 113345050B CN 202110905655 A CN202110905655 A CN 202110905655A CN 113345050 B CN113345050 B CN 113345050B
- Authority
- CN
- China
- Prior art keywords
- path
- dimensional
- height map
- data
- modifying
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/206—Drawing of charts or graphs
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Generation (AREA)
Abstract
The application discloses a method for modifying a two-dimensional geometric frame, which comprises the following steps: expanding the original frame path into a one-dimensional path; generating a corresponding one-dimensional height map according to the one-dimensional path and the frame modification data; and drawing the path of the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map to obtain modified path data. The original frame path is expanded into a one-dimensional path, a one-bit height map corresponding to the original frame path is generated on the basis of the one-dimensional path, so that modified data are represented in the one-dimensional height map, and finally the one-dimensional path is subjected to path drawing based on normal vector deflection corresponding to the one-dimensional height map to obtain modified path data, so that the modified data are separated from the original path data, the complexity of modification is reduced, the reuse rate of the original data is improved, and the use efficiency is improved. The application also discloses a device for modifying the two-dimensional geometric border, a computing device and a computer readable storage medium, which have the beneficial effects.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method for modifying a two-dimensional geometric border, a device for modifying a two-dimensional geometric border, a computing device, and a computer-readable storage medium.
Background
With the continuous development of information technology, more and more types of graphs can be edited in the visualization field so as to construct richer visual graphs and improve richer and more diverse graph types. In the field of application visualization, editing of the border is often required.
In the related art, a new path is generated by saving edit points. However, the output results in the original data being irretrievably altered, i.e., the original data and the altered data are coupled together. This can cause problems, which are convenient when new but cumbersome to modify. For example, it is known that curve editing in path editing is complex, and in the scheme of anchor point editing, point updating is often required for modification. In addition, all changes of the method need to be stored as points, so that the complexity of the original geometry is increased by modifying the path, the complexity is brought in rendering, and the efficiency of frame editing is reduced.
Therefore, how to improve the efficiency of frame editing is a key issue to be focused on by those skilled in the art.
Disclosure of Invention
The application aims to provide a method for modifying a two-dimensional geometric border, a device for modifying a two-dimensional geometric border, a computing device and a computer readable storage medium, so as to solve the problem that the modification of the border is complex in the prior art.
In order to solve the above technical problem, the present application provides a method for modifying a two-dimensional geometric border, including:
expanding the original frame path into a one-dimensional path;
generating a corresponding one-dimensional height map according to the one-dimensional path and the frame modification data;
and drawing the path of the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map to obtain modified path data.
Optionally, the expanding the original border path into a one-dimensional path includes:
determining a starting point and a plurality of key points of the original frame path;
and unfolding the plurality of key points from the starting point to obtain the one-dimensional path.
Optionally, the method further includes:
and adding position description, normal vector description and length description to the starting point and the key point in the one-dimensional path.
Optionally, generating a corresponding one-dimensional height map according to the one-dimensional path and the frame modification data includes:
and generating the one-dimensional height map according to the length of the one-dimensional path and the offset of the frame modification data in the normal vector direction.
Optionally, the path drawing is performed on the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map, so as to obtain modified path data, and the method includes:
performing linear interpolation on the one-dimensional path to obtain a series of fragments;
and deflecting the heights of the series of fragments according to the normal vector deflection of the one-dimensional height map to obtain the modified path data.
The application also provides a modify two-dimensional geometry frame device, include:
the path unfolding module is used for unfolding the original frame path into a one-dimensional path;
the height map generating module is used for generating a corresponding one-dimensional height map according to the one-dimensional path and the frame modification data;
and the path drawing module is used for drawing a path of the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map to obtain modified path data.
Optionally, the path expansion module includes:
a node determining unit, configured to determine a starting point and a plurality of key points of the original border path;
and the node unfolding unit is used for unfolding the plurality of key points from the starting point to obtain the one-dimensional path.
Optionally, the method further includes:
and the description adding unit is used for adding position description, normal vector description and length description to the starting point and the key point in the one-dimensional path.
The present application further provides a computing device comprising:
a memory for storing a computer program;
a processor for implementing the steps of the method for modifying a two-dimensional geometric bounding box as described above when executing the computer program.
The present application also provides a computer readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method of modifying a two-dimensional geometric border as described above.
The application provides a method for modifying a two-dimensional geometric border, which comprises the following steps: expanding the original frame path into a one-dimensional path; generating a corresponding one-dimensional height map according to the one-dimensional path and the frame modification data; and drawing the path of the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map to obtain modified path data.
The original frame path is firstly unfolded into a one-dimensional path, a one-bit height map corresponding to the original frame path is generated on the basis of the one-dimensional path, so that modified data are represented in the one-dimensional height map, and finally the one-dimensional path is subjected to path drawing based on normal vector deflection corresponding to the one-dimensional height map to obtain modified path data, so that the modified data are separated from the original path data, the complexity of modification is reduced, the reuse rate of the original data is improved, and the use efficiency is improved.
The application also provides a device for modifying the two-dimensional geometric border, a computing device and a computer readable storage medium, which have the beneficial effects, and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present application 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, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for modifying a two-dimensional geometric border according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a path rendering provided by an embodiment of the present application;
fig. 3 is a schematic structural diagram of an apparatus for modifying a two-dimensional geometric border according to an embodiment of the present disclosure.
Detailed Description
The core of the application is to provide a method for modifying a two-dimensional geometric border, a device for modifying a two-dimensional geometric border, a computing device and a computer readable storage medium, so as to solve the problem that the modification of the border in the prior art is complex.
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. 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 application.
In the related art, a new path is generated by saving edit points. However, the output results in the original data being irretrievably altered, i.e., the original data and the altered data are coupled together. This can cause problems, which are convenient when new but cumbersome to modify. For example, it is known that curve editing in path editing is complex, and in the scheme of anchor point editing, point updating is often required for modification. In addition, all changes of the method need to be stored as points, so that the complexity of the original geometry is increased by modifying the path, the complexity is brought in rendering, and the efficiency of frame editing is reduced.
Therefore, the method for modifying the two-dimensional geometric border comprises the steps of firstly unfolding an original border path into a one-dimensional path, generating a one-bit height map corresponding to the original border path on the basis of the one-dimensional path so as to represent modified data in the one-dimensional height map, and finally drawing the path of the one-dimensional path based on normal vector deflection corresponding to the one-dimensional height map to obtain modified path data, so that the modified data are separated from the original path data, the complexity of modification is reduced, the reuse rate of the original data is improved, and the use efficiency is improved.
The following describes a method for modifying a two-dimensional geometric bounding box according to an embodiment.
Referring to fig. 1, fig. 1 is a flowchart illustrating a method for modifying a two-dimensional geometric border according to an embodiment of the present disclosure.
In this embodiment, the method may include:
s101, unfolding an original frame path into a one-dimensional path;
this step aims to expand the original bounding box path into a one-dimensional path. I.e. the original bounding box path is unfolded into a one-dimensional path. The expansion may be performed in a predetermined direction, and other path expansion methods may be used.
Further, the step may include:
step 1, determining a starting point and a plurality of key points of an original frame path;
and 2, unfolding the plurality of key points from the starting point to obtain a one-dimensional path.
It can be seen that the present alternative is primarily illustrative of how a one-dimensional path may be unfolded. In the alternative, a starting point and a plurality of key points of an original frame path are determined, and the plurality of key points are expanded from the starting point to obtain a one-dimensional path.
The starting point may be a point that is easy to describe, which is selected as the starting point according to a specific situation or according to a structure of the frame, and then a point adjacent to the starting point is used as a key point, that is, a subsequent node is used as a subsequent key point once. And finally, unfolding the original frame path according to the sequence of the starting point and the subsequent key points.
Further, the method can further comprise the following steps:
and adding position description, normal vector description and length description to the starting point and the key point in the one-dimensional path.
Therefore, in the alternative, descriptions are mainly added to each point expanded in the one-dimensional path, so that the accuracy of representing the one-dimensional path is improved, and further the original border path can be accurately restored according to the one-dimensional path.
Wherein the added description may for example:
A：{position：[0，0]，normal：[0，-1]，length：0}
wherein position represents the position of the point in the original bounding box path, normal represents the direction of the normal vector, and length identifies the length in the one-dimensional path.
S102, generating a corresponding one-dimensional height map according to the one-dimensional path and the frame modification data;
on the basis of S101, this step aims to generate a corresponding one-dimensional height map from the one-dimensional path and the bounding box modification data. Wherein, the one-dimensional height map is a group of equidistant discrete arrays. It can be seen that assuming there are m terms, each term is a number that represents the extension of the line segment at that point in its normal vector direction.
Further, the step may include:
and generating a one-dimensional height map according to the length of the one-dimensional path and the offset of the frame modification data in the normal vector direction.
It can be seen that in the present alternative, the one-dimensional height map is generated mainly according to the length of the one-dimensional path and the offset of the frame modification data in the normal vector direction. I.e. a one-bit height map corresponding to the one-dimensional path is generated, so as to modify the corresponding path through the one-dimensional height map.
S103, drawing a path of the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map to obtain modified path data.
On the basis of S102, the step aims to perform path drawing on the one-dimensional path based on normal vector deflection corresponding to the one-dimensional height map, so as to obtain modified path data. During the drawing process, determining the normal vector deflection corresponding to each point on the one-dimensional height map, and upwardly shifting the pixel corresponding to the point in the one-dimensional path to obtain the modified path data.
Further, in order to improve the deflection effect, the length of the one-dimensional height map may be increased in this step, so as to improve the accuracy of the one-dimensional height map.
Further, the step may include:
step 1, performing linear interpolation on a one-dimensional path to obtain a series of fragments;
and 2, deflecting the heights of the series of fragments according to the normal vector deflection of the one-dimensional height map to obtain modified path data.
It can be seen that the present alternative is mainly described how to modify the obtained path data. In the alternative scheme, linear interpolation is carried out on the one-dimensional path to obtain a series of fragments; and deflecting the heights of the series of fragments according to the normal vector deflection of the one-dimensional height map to obtain modified path data.
In summary, in the embodiment, the original frame path is first expanded into the one-dimensional path, the one-bit height map corresponding to the original frame path is generated on the basis of the one-dimensional path, so that the modified data is represented in the one-dimensional height map, and finally the one-dimensional path is subjected to path drawing based on the normal vector deflection corresponding to the one-dimensional height map, so as to obtain the modified path data, so that the modified data is separated from the original path data, the complexity of modification is reduced, the reuse rate of the original data is improved, and the use efficiency is improved.
The following further describes a method for modifying a two-dimensional geometric border according to another specific embodiment.
In this embodiment, the original bounding box path to be processed is generally placed in a two-dimensional or higher-dimensional space. In this embodiment, a two-dimensional case is exemplified. First, a point in a two-dimensional space needs to be mapped to a number, and the best method is to use a length representation from the starting point. When a point is processed to one dimension, a one-dimensional number is used to represent a point in the original graph. Assuming that the total length of the line segment is n, any number from 0 to n can find a corresponding point on the line segment. Further, an equidistant discrete Array m can be designed, assuming that there are m entries, each entry being a number indicating the extent of the line segment at that point in the direction of its normal vector, such a discrete Array m being a one-dimensional height map in this embodiment. Then, in the stage of a pixel shader (fragment shader) for drawing the path, the geometry of the point is deflected by solving the mapping value of the point, and modified path data is obtained.
For a two-dimensional geometric figure, a starting point is set, and then a plurality of key nodes are expanded into a single dimension according to the distance from a certain two-dimensional point to the starting point along a path. Then, the points on the connecting line connected by the nodes can be linearly interpolated by all the key points. For example, assuming that the two-dimensional geometry is a square, which consists of points a (0, 0), B (1, 0), C (1, 1), D (0, 1), and can be set to point a as the starting point, then point a is at a distance of 0 along the path, point B is at a distance of 1 along the path, C is 2, and D is 3. If the midpoint of A and B is determined to be point E, then linear interpolation can be performed from the one-dimensional mapping results of A and B to obtain point E of 0.5.
It can be seen that the points before and after expansion are in one-to-one correspondence on the two-dimensional world and the one-dimensional axis, the point P in one dimension corresponds to a unique value P, and the unique value P necessarily corresponds to the point P in two dimensions, and the expansion process is reversible.
Further, an additional description is added to the original bezel data. Any point existence is no longer isolated, but can be displaced at any point between the point and the line segment connected with the point, and then the point is described as a point on the line segment.
E.g., point a, whose original data description may be simple:
A：{ position：[0，0]}。
but when describing this point as point a on the segment AB, it should also contain a unit normal vector, which may be taken by default to be the direction of the perpendicular to the outward direction of the segment:
A：{ position：[0，0]，normal：[0，-1]}。
in addition, since in the method, the value of the height map at this point needs to be obtained in a one-dimensional form of the point, the point also needs to store its position along the line segment from the starting point, since the starting point in this example is a:
A：{ position：[0，0]，normal：[0，-1]，length：0}。
in this way, the original bounding box data may be shifted during rendering.
In the related art, a complex shape is edited by adding nodes. In this embodiment, the one-dimensional height map is superimposed. In the pixel shader, all vertices generate a series of fragments by linear interpolation, and each fragment can be regarded as a pixel, which covers a discrete point on a line segment. In this rendering method, color superposition is usually implemented by using texture mapping, where each primitive in the texture mapping has its corresponding uv value (a two-dimensional vector) pointing to the corresponding texture, so as to obtain a color value. In this embodiment, the uv value is shifted by the one-dimensional height map, so that the shape of the path is changed.
Where the data format of the one-dimensional height map is a set of discrete floating-point arrays describing the vertical offset of points at a distance along the path from the starting point. Since the stored data is necessarily discretized, the length of the floating-point array depends on the total length of the path. The path length can be considered the same when the aliasing problem is not considered.
However, in actual development, some floating points always appear, and it is impossible to completely avoid aliasing problems. Thus, the data length of the height map will be related to the path length and also the sample sampling rate. Generally, the sampling rate is not lower than 2 times of the data frequency according to the nyquist sampling theorem, the sampling rate of the texture can be regarded as 1 pixel 1 time, and therefore, the discrete data of the embodiment is higher than 1 pixel 2 times. The path length unit is a pixel, so the minimum data length of the height map should be:
length=Math.ceil（n * 2）。
where length is the length of the height map, n is the length of the path, and length needs to be rounded up for n times the result. Also considering the anti-aliasing situation that may occur, the sampling rate of the texture may be higher than 1 time per pixel, so length is only the lowest length, not necessarily the actual value used.
For a length-long height map, which is a length-long floating-point array, the precision of the floating-point depends on the precision required by the user. The number may be negative and represents the amount of offset in the normal vector direction at that point location, and if negative, indicates a reverse offset.
Referring to fig. 2, fig. 2 is a schematic diagram of a path drawing according to an embodiment of the present disclosure.
The top of fig. 2 shows a path of length 20, the leftmost starting point and the direction to the right, which is rasterized to become a 20-pixel representation. The middle array is a simple height map without consideration of antialiasing, describing the displacement at the corresponding position. The lower half of fig. 2 is the result after the height map is superimposed, in which the path is shifted.
Any one position can be linearly interpolated by the two nearest discrete data values. For example, at position 5.6, it can be seen that since 2 at 5 and 3 at 6, the height map value at 5.6 is 2 × 0.4 + 3 × 0.6 = 2.6. Through this interpolation, the discrete data may describe the height map value for any one of the floating point locations between 0-19.
It can be seen that, in the embodiment, the original frame path is firstly expanded into the one-dimensional path, the one-bit height map corresponding to the original frame path is generated on the basis of the one-dimensional path, so that the modified data is represented in the one-dimensional height map, and finally the path drawing is performed on the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map, so as to obtain the modified path data, so that the modified data is separated from the original path data, the complexity of modification is reduced, the reuse rate of the original data is improved, and the use efficiency is improved.
In the following, the modified two-dimensional geometric border device provided in the embodiment of the present application is introduced, and the modified two-dimensional geometric border device described below and the modified two-dimensional geometric border method described above may be referred to correspondingly.
Referring to fig. 3, fig. 3 is a schematic structural diagram of a device for modifying a two-dimensional geometric border according to an embodiment of the present disclosure.
In this embodiment, the apparatus may include:
a path expansion module 100, configured to expand an original border path into a one-dimensional path;
a height map generating module 200, configured to generate a corresponding one-dimensional height map according to the one-dimensional path and the frame modification data;
and a path drawing module 300, configured to draw a path of the one-dimensional path based on the normal vector deflection corresponding to the one-dimensional height map, to obtain modified path data.
Optionally, the path expansion module 100 may include:
the node determining unit is used for determining a starting point and a plurality of key points of an original frame path;
and the node expansion unit is used for expanding the plurality of key points from the starting point to obtain a one-dimensional path.
Optionally, the apparatus may further include:
and the description adding unit is used for adding position description, normal vector description and length description to the starting point and the key point in the one-dimensional path.
An embodiment of the present application further provides a computing device, including:
a memory for storing a computer program;
a processor for implementing the steps of the method for modifying a two-dimensional geometric bounding box as described in the above embodiments when the computer program is executed.
Embodiments of the present application further provide a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the method for modifying a two-dimensional geometric bounding box according to the above embodiments.
The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The foregoing describes a method, an apparatus, a computing device, and a computer-readable storage medium for modifying a two-dimensional geometric border provided in the present application in detail. The principles and embodiments of the present application are explained herein using specific examples, which are provided only to help understand the method and the core idea of the present application. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
Claims (8)
1. A method for modifying a two-dimensional geometric border, comprising:
expanding the original frame path into a one-dimensional path;
generating a one-dimensional height map according to the length of the one-dimensional path and the offset of the frame modification data in the normal vector direction; wherein the data format of the one-dimensional height map is a set of discrete floating point arrays describing the vertical offset of points at equal distances along the path from the starting point;
performing linear interpolation on the one-dimensional path to obtain a series of fragments;
and deflecting the heights of the series of fragments according to the normal vector deflection of the one-dimensional height map to obtain modified path data.
2. A method for modifying a two-dimensional geometric bounding box according to claim 1, wherein the step of unfolding the original bounding box path into a one-dimensional path comprises:
determining a starting point and a plurality of key points of the original frame path;
and unfolding the plurality of key points from the starting point to obtain the one-dimensional path.
3. A method for modifying a two-dimensional geometric border as recited in claim 2, further comprising:
and adding position description, normal vector description and length description to the starting point and the key point in the one-dimensional path.
4. An apparatus for modifying a two-dimensional geometric border, comprising:
the path unfolding module is used for unfolding the original frame path into a one-dimensional path;
the height map generating module is used for generating a one-dimensional height map according to the length of the one-dimensional path and the offset of the frame modification data in the normal vector direction; wherein the data format of the one-dimensional height map is a set of discrete floating point arrays describing the vertical offset of points at equal distances along the path from the starting point;
the path drawing module is used for carrying out linear interpolation on the one-dimensional path to obtain a series of fragments; and deflecting the heights of the series of fragments according to the normal vector deflection of the one-dimensional height map to obtain modified path data.
5. The apparatus according to claim 4, wherein the path unrolling module comprises:
a node determining unit, configured to determine a starting point and a plurality of key points of the original border path;
and the node unfolding unit is used for unfolding the plurality of key points from the starting point to obtain the one-dimensional path.
6. A device for modifying two-dimensional geometric borders according to claim 5, further comprising:
and the description adding unit is used for adding position description, normal vector description and length description to the starting point and the key point in the one-dimensional path.
7. A computing device, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the method of modifying a two-dimensional geometric bounding box of any one of claims 1 to 3 when executing said computer program.
8. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method for modifying a two-dimensional geometric bounding box according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110905655.3A CN113345050B (en) | 2021-08-09 | 2021-08-09 | Method and related device for modifying two-dimensional geometric frame |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110905655.3A CN113345050B (en) | 2021-08-09 | 2021-08-09 | Method and related device for modifying two-dimensional geometric frame |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113345050A CN113345050A (en) | 2021-09-03 |
| CN113345050B true CN113345050B (en) | 2021-10-29 |
Family
ID=77481011
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110905655.3A Active CN113345050B (en) | 2021-08-09 | 2021-08-09 | Method and related device for modifying two-dimensional geometric frame |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113345050B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112907436A (en) * | 2021-02-02 | 2021-06-04 | 深圳市显控科技股份有限公司 | OpenGL-based line type drawing method, system and medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100521552C (en) * | 2003-11-20 | 2009-07-29 | 联发科技股份有限公司 | Non bidimensional with ratio data treatment system and method |
| CN101390034B (en) * | 2004-01-29 | 2012-03-14 | 辛纳普蒂克斯有限公司 | Method and apparatus for initiating one-dimensional signals with a two-dimensional pointing device |
| CN110146071B (en) * | 2019-05-16 | 2021-04-23 | 成都精位科技有限公司 | Positioning dimension improving method and device |
-
2021
- 2021-08-09 CN CN202110905655.3A patent/CN113345050B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112907436A (en) * | 2021-02-02 | 2021-06-04 | 深圳市显控科技股份有限公司 | OpenGL-based line type drawing method, system and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113345050A (en) | 2021-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3164617B2 (en) | Apparatus and method for deforming character / graphics | |
| JP5149288B2 (en) | Composition of ANISOMETRIC texture (TEXTURE) (SYNTHESIS) | |
| JP5232358B2 (en) | Rendering outline fonts | |
| JP4621618B2 (en) | Graphic drawing apparatus, graphic drawing method, and program | |
| JP4237806B2 (en) | Progressive mesh adaptive subdivision method and apparatus | |
| TWI443603B (en) | Two dimensional vector graphics triangulation system and method thereof | |
| CN1734503B (en) | Stretch-driven mesh parameterization method using spectral analysis | |
| JP4046233B2 (en) | Information processing device | |
| JP4464657B2 (en) | Curved image processing apparatus and curved image processing method | |
| JP3265879B2 (en) | 3D orthogonal grid data generator | |
| CN113345050B (en) | Method and related device for modifying two-dimensional geometric frame | |
| Melançon | Living flows: enhanced exploration of edge-bundled graphs based on GPU-intensive edge rendering | |
| CN111402369A (en) | Interactive advertisement processing method and device, terminal equipment and storage medium | |
| JP5034806B2 (en) | Graphic drawing apparatus, graphic drawing method, graphic drawing program, and recording medium storing the program | |
| JP2005070373A (en) | Program and device for map coordinate conversion | |
| JP2011065571A (en) | Graphic display method and graphic display device | |
| JP3479282B2 (en) | Character and graphic transformation processor | |
| JP4479957B2 (en) | Curved surface subdivision device | |
| JP2004348708A (en) | Polygon creation method for geographical information system, and its device | |
| CN117911578B (en) | Text rendering method and device, computer equipment and storage medium | |
| JP3170249B2 (en) | Apparatus and method for deforming character / graphics | |
| CN115270245B (en) | Parameterization processing method, parameterization processing device, parameterization processing equipment and parameterization processing readable medium for column-like reinforcement graph | |
| CA2308249C (en) | Triangle strip length maximization | |
| JP2002208028A (en) | Geometry clipping device for polygon | |
| WO2024000173A1 (en) | Method and apparatus for generating mode detection model, and computer device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |