CN116958319A - Minimum closure area determining method and device, terminal equipment and readable storage medium - Google Patents
Minimum closure area determining method and device, terminal equipment and readable storage medium Download PDFInfo
- Publication number
- CN116958319A CN116958319A CN202310712498.3A CN202310712498A CN116958319A CN 116958319 A CN116958319 A CN 116958319A CN 202310712498 A CN202310712498 A CN 202310712498A CN 116958319 A CN116958319 A CN 116958319A
- Authority
- CN
- China
- Prior art keywords
- vertex
- graph
- filled
- path
- determining
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000012216 screening Methods 0.000 claims description 24
- 238000004590 computer program Methods 0.000 claims description 17
- 230000015654 memory Effects 0.000 claims description 14
- 230000008569 process Effects 0.000 claims description 8
- 238000000605 extraction Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 239000011159 matrix material Substances 0.000 description 6
- 238000001914 filtration Methods 0.000 description 5
- 239000003086 colorant Substances 0.000 description 4
- 238000004040 coloring Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- XOZUGNYVDXMRKW-AATRIKPKSA-N azodicarbonamide Chemical group NC(=O)\N=N\C(N)=O XOZUGNYVDXMRKW-AATRIKPKSA-N 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/01—Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Computation (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Image Generation (AREA)
Abstract
The invention provides a minimum closure area determining method and device, terminal equipment and readable storage medium, wherein the method comprises the following steps: acquiring region information of a graph to be filled drawn by a user; the region information comprises connection relations of all vertexes in the graph to be filled; traversing each vertex in the graph to be filled based on a connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex; and determining each minimum closed area in the graph to be filled based on the traversing path corresponding to the leaf node in the tree structure. The scheme provided by the invention can effectively meet the filling demands of a plurality of users, and the minimum closed region can be automatically extracted without manually configuring the vertex coordinate information of the minimum closed region, so that the method is convenient and quick and has low cost.
Description
Technical Field
The invention belongs to the technical field of data processing, and particularly relates to a minimum closed region determining method and device, terminal equipment and readable storage medium.
Background
Filling functions are widely used in daily life, for example, users sometimes need to fill different colors/graphics in different areas to represent different information, and sometimes need to fill different pictures in different areas to make a jigsaw puzzle. In the prior art, users often need administrators of related software to upload filling templates before filling graphics to be filled. When uploading the filling template, an administrator can measure out coordinate information of all vertexes in the filling template through picture processing software, manually configure vertex coordinate information corresponding to each minimum closed area to achieve division of the minimum closed areas, and a subsequent user can fill in each minimum closed area through uploading pictures or selecting colors and the like.
According to the analysis of the prior art, the existing mode of uploading the filling template is not easy to meet filling requirements of a plurality of users, and the mode of manually configuring vertex coordinate information is not convenient enough. Accordingly, the present invention is directed to providing a solution to the aforementioned problems.
Disclosure of Invention
The invention aims to provide a minimum closed region determining method and device, terminal equipment and a readable storage medium, so as to solve the problems that the existing means are not easy to meet filling requirements of a plurality of users and are not convenient enough.
In a first aspect of the embodiment of the present invention, a method for determining a minimum occlusion region is provided, including:
acquiring region information of a graph to be filled drawn by a user; the region information comprises connection relations of all vertexes in the graph to be filled;
traversing each vertex in the graph to be filled based on the connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex;
and determining each minimum closed area in the graph to be filled based on the traversing path corresponding to the leaf node in the tree structure.
In one possible implementation manner, each vertex is taken as a root node, each vertex in the graph to be filled is traversed based on the connection relationship, and a tree structure corresponding to each vertex is obtained, including:
Traversing each vertex in the graph to be filled based on the connection relation according to the principle of depth-first traversal or breadth-first traversal by taking each vertex as a root node to obtain a tree structure corresponding to each vertex;
wherein when performing the depth-first traversal or the breadth-first traversal, a certain neighboring node is accessed by: the adjacency node is on the path between its parent node and the root node.
In a possible implementation manner, the determining each minimum closed area in the graph to be filled based on the traversal path corresponding to the leaf node in the tree structure includes:
determining a path with consistent starting points and end points in the traversing path as a first path corresponding to a closed area;
and determining each minimum closed area in the graph to be filled based on the number of vertexes or the number of lines contained in each first path.
In one possible implementation manner, the determining, based on the number of vertices or the number of lines included in each first path, each minimum closed area in the graph to be filled includes:
screening a first path with the least number of vertexes or lines in the tree structure from the first paths corresponding to each tree structure;
And determining the closure area corresponding to each screened first path as each minimum closure area in the graph to be filled.
In one possible implementation, determining each minimum closed region in the graph to be filled based on the number of vertices contained in each first path includes:
repeatedly executing the first screening step until the first paths have no inclusion relationship;
determining the closure area corresponding to each screened first path as each minimum closure area in the graph to be filled;
wherein the first screening step comprises: if the two first paths have the inclusion relationship, deleting the first paths with more vertexes, and reserving the first paths with less vertexes;
wherein the existence of the inclusion relationship between the two first paths means that: the starting points and the ending points of the two first paths are consistent, and the first point set belongs to the second point set; the first point set is a point set formed by vertexes contained in one first path, and the second point set is a point set formed by vertexes contained in the other first path.
In one possible implementation manner, before determining the closed area corresponding to each screened first path as each minimum closed area in the graph to be filled, the minimum closed area determining method further includes:
Repeating the second screening step until all vertices contained in the first paths are different;
wherein the second screening step comprises: if the vertices contained in the two first paths are the same, optionally one first path is reserved from the two first paths, and the first paths which are not reserved are deleted.
In one possible implementation manner, the obtaining the region information of the graphic to be filled drawn by the user includes:
acquiring the outline of a graph to be filled drawn by a user, and taking the outline as a current drawing area;
repeatedly executing the vertex extraction step until the user is detected to stop the drawing process;
dividing each line in the current drawing area based on the extracted vertexes to obtain the connection relation among the vertexes;
wherein, the step of extracting the vertex comprises the following steps:
after detecting that the user draws the line in the current drawing area, extracting an intersection point of the line drawn by the user and the line in the current drawing area as a vertex, and taking the current drawing area after the user draws the line as a new current drawing area.
In a second aspect of the embodiment of the present invention, there is provided a minimum occlusion region determining apparatus, including:
The data acquisition module is used for acquiring the region information of the graph to be filled drawn by the user; the region information comprises connection relations of all vertexes in the graph to be filled;
the vertex traversing module is used for traversing each vertex in the graph to be filled based on the connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex;
and the region determining module is used for determining each minimum closed region in the graph to be filled based on the traversing paths corresponding to the leaf nodes in the tree structure.
In a third aspect of the embodiments of the present invention, there is provided a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the minimum closed region determination method described above when executing the computer program.
In a fourth aspect of the embodiments of the present invention, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, implements the steps of the minimum occlusion region determination method described above.
The method and the device for determining the minimum closed area, the terminal equipment and the readable storage medium have the beneficial effects that:
As can be seen from analyzing the solution provided by the embodiment of the present invention, the embodiment of the present invention discloses that the user draws the graphic to be filled. That is, unlike the existing means, the embodiment of the present invention does not need to upload the filling template by the administrator of the related software, but supports the user to customize the filling template (i.e. the graphics to be filled), so that the embodiment of the present invention can effectively meet the filling requirements of many users.
On the basis, the embodiment of the invention provides a method for automatically extracting the minimum closed region, namely each vertex is taken as a root node, a tree structure corresponding to each vertex is constructed through the connection relation of each vertex, the tree structure essence corresponding to each vertex is the description of the vertex connection relation taking the vertex as a starting point, on the basis, the traversing path of the leaf node in the tree structure corresponding to a certain vertex corresponds to the region passing through the vertex, and on the basis, each minimum closed region in the graph to be filled can be deduced according to the traversing path corresponding to the leaf node of each tree structure. That is, the embodiment of the invention can automatically extract the minimum closed region without manually configuring the vertex coordinate information of the minimum closed region, and is convenient and quick and low in cost.
In view of the above, the embodiments of the present invention effectively solve the problems in the prior art.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments or the description of the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method for determining a minimum occlusion region according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a pattern to be filled according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a tree structure corresponding to a vertex according to an embodiment of the present invention;
FIG. 4 is a flowchart of a method for determining a minimum occlusion region according to another embodiment of the present invention;
FIG. 5 is a flowchart of a method for determining a minimum occlusion region according to another embodiment of the present invention;
FIG. 6 is a block diagram of a minimum occlusion region determining apparatus according to an embodiment of the present invention;
fig. 7 is a schematic block diagram of a terminal device according to an embodiment of the present invention.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth such as the particular system architecture, techniques, etc., in order to provide a thorough understanding of the embodiments of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the following description will be made by way of specific embodiments with reference to the accompanying drawings.
Referring to fig. 1, fig. 1 is a flowchart of a method for determining a minimum closed region according to an embodiment of the present invention, where the method for determining a minimum closed region refers to a method for determining a minimum closed region of a pattern to be filled, and the method for determining a minimum closed region includes:
s101: and acquiring the region information of the graph to be filled drawn by the user. The region information comprises connection relations of all vertexes in the graph to be filled.
In this embodiment, the graphic to be filled drawn by the user is essentially a filling template used subsequently, which is composed of a plurality of minimum closed areas.
In this embodiment, when a user draws a graphic to be filled, the drawing content of the user may be acquired in real time to determine the region information of the graphic to be filled, and on this basis, the minimum closed region may be automatically extracted from the region information.
In this embodiment, the region information may further include coordinate information of each vertex in the graph to be filled, that is, each vertex in the region information may be represented by its coordinate information.
In this embodiment, the connection relationship of each vertex can be characterized by whether there is a direct connection between two vertices.
Specifically, in this embodiment, the connection relationship of each vertex may be directly described by a line segment. The line segment refers to a connection line between two vertices having a direct connection relationship. Wherein, the line segment can be represented by coordinates of vertexes at two ends of the line segment. For example, the two end vertexes of a line segment are an a vertex and a B vertex, the a vertex coordinates are (x 1, y 1), and the B vertex coordinates are (x 2, y 2), and the line segment corresponding to the two vertexes of the connection relationship or AB may be expressed as:
[(x1，y1)，(x2，y2)]。
of course, in other embodiments, a matrix may be used to represent the connection relationship between the vertices, for example, a schematic diagram of the graph to be filled is shown in fig. 2, where a 6×6 matrix may be created, each row (from left to right) in the 6×6 matrix corresponds to an a vertex, a B vertex, a C vertex, a D vertex, an E vertex, and an F vertex, and each column (from top to bottom) in the 6×6 matrix corresponds to an a vertex, a B vertex, a C vertex, a D vertex, an E vertex, and an F vertex, and on this basis, the connection relationship between the graph to be filled in fig. 2 may be expressed as:
In the 6×6 matrix, 1 indicates a connection, and 0 indicates no connection. That is, in the matrix, if the vertex x and the vertex y are connected, the values of the x-th row, the y-th column and the y-th row, the x-th column are all 1, and based on this, the connection relationship of each vertex in the graph to be filled can be represented.
S102: and traversing each vertex in the graph to be filled based on the connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex.
In this embodiment, the connection relationship of each vertex can be regarded as a connection relationship of the graph, on the basis of which each vertex is taken as a root node, and each vertex of the graph to be filled is traversed based on the connection relationship, so as to obtain a tree structure corresponding to each vertex.
In this embodiment, each vertex is used as a root node to traverse the graph to be filled once, for example, if there are N vertices in the graph to be filled, N tree structures are obtained finally. The tree structure essence corresponding to each vertex is description of a vertex communication relationship taking the vertex as a starting point, on the basis, the tree structure essence corresponding to N vertices is multiple descriptions of the vertex communication relationship under different traversing sequences, on the basis, each closed region in the graph to be filled can be obtained by screening from the vertex communication relationship based on node characteristics of the tree structure, and then each minimum closed region in the graph to be filled is obtained.
S103: and determining each minimum closed area in the graph to be filled based on the traversing path corresponding to the leaf node in the tree structure.
In this embodiment, the traversal path corresponding to the leaf node essentially consists of the connection relationship of each vertex in the graph to be filled, or consists of each line in the graph to be filled.
Wherein, regarding the record of the leaf node traversal path:
firstly, a traversing path can be recorded in the process of constructing the tree structure, namely, each traversing to a node, namely, the traversing path corresponding to the node is recorded, and on the basis, when traversing to a certain node, the traversing path of the node can be directly determined according to the traversing path of the father node. By the scheme, after the tree structure is built, the traversing paths of the leaf nodes are recorded, and the traversing paths of the leaf nodes can be determined without querying the nodes of the tree structure again.
Second, the traversal path of the leaf node may also be determined by querying the nodes of the tree structure after the construction of the tree structure is completed. For example, the parent node of the leaf node may be queried from the tree structure, then the parent node of the leaf node, …, and so on, until the root node of the tree structure is queried. The query sequence of each father node is the traversal path of the leaf node.
In this embodiment, the traversal path of a leaf node in the tree structure corresponding to a certain vertex corresponds to a region passing through the vertex, based on this, a closed region may be screened out from each region based on the traversal path of the leaf node, and then a minimum closed region (i.e., a minimum closed region) may be screened out from each closed region, so as to implement automatic extraction of the minimum closed region.
In this embodiment, after determining each minimum closed region in the graph to be filled based on the traversal path corresponding to the leaf node in the tree structure, the selected coordinates of the external input device may be further obtained, and on this basis, if the selected coordinates are within a certain minimum closed region of the graph to be filled, the information to be filled is obtained, and the information to be filled is filled into the target minimum closed region.
The target minimum closed area refers to the minimum closed area where the selected coordinates are located. The input device is essentially a device for selecting the minimum closed area by the user, and may be a mouse device, a keyboard device, a touch device, or the like, which is not limited in this embodiment. The information to be filled may be a picture uploaded by the user, or may be a color selected by the user, which is not limited in this embodiment.
As can be seen from the above description, the method for determining the minimum occlusion region provided by the embodiment of the present invention can be applied to multiple types of scenes.
For example, the embodiment of the invention can be applied to a jigsaw scene of image processing software, that is, a user can draw a graph to be filled in the image processing software, the image processing software executes the minimum closed region determining method of the embodiment of the invention to determine each minimum closed region, on the basis, the user can upload a plurality of pictures stored in advance in the image processing software, and the image processing software fills the uploaded pictures into each minimum closed region to complete the jigsaw. That is, according to the scheme of the embodiment of the present invention, a jigsaw method may be implemented, and the jigsaw method may include the following steps:
and acquiring the region information of the graph to be filled drawn by the user. The region information comprises connection relations of all vertexes in the graph to be filled.
And traversing each vertex in the graph to be filled based on the connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex.
And determining each minimum closed area in the graph to be filled based on the traversing path corresponding to the leaf node in the tree structure.
And acquiring the picture uploaded by the user, and filling the picture uploaded by the user into the minimum closed area selected by the user to realize the jigsaw.
For example, the embodiment of the invention can also be applied to an image coloring scene in the drawing process, namely, a user can draw a graph to be filled in drawing software, the drawing software executes the minimum closed region determining method of the embodiment of the invention to determine each minimum closed region, on the basis, the user can select a plurality of colors which the user wants to fill in the drawing software, and the drawing software fills the selected colors into each minimum closed region to realize the image coloring. That is, according to an aspect of the embodiments of the present invention, an image coloring method may be implemented, which may include the steps of:
and acquiring the region information of the graph to be filled drawn by the user. The region information comprises connection relations of all vertexes in the graph to be filled.
And traversing each vertex in the graph to be filled based on the connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex.
And determining each minimum closed area in the graph to be filled based on the traversing path corresponding to the leaf node in the tree structure.
And acquiring the color selected by the user, and filling the color selected by the user into the minimum closed area selected by the user so as to realize the coloring of the image.
As can be seen from analyzing the solution provided by the embodiment of the present invention, the embodiment of the present invention discloses that the user draws the graphic to be filled. That is, unlike the existing means, the embodiment of the present invention does not need to upload the filling template by the administrator of the related software, but supports the user to customize the filling template (i.e. the graphics to be filled), so that the embodiment of the present invention can effectively meet the filling requirements of many users.
On the basis, the embodiment of the invention provides a method for automatically extracting the minimum closed region, namely each vertex is taken as a root node, a tree structure corresponding to each vertex is constructed through the connection relation of each vertex, the tree structure essence corresponding to each vertex is the description of the vertex connection relation taking the vertex as a starting point, on the basis, the traversing path of the leaf node in the tree structure corresponding to a certain vertex corresponds to the region passing through the vertex, and on the basis, each minimum closed region in the graph to be filled can be deduced according to the traversing path corresponding to the leaf node of each tree structure. That is, the embodiment of the invention can automatically extract the minimum closed region without manually configuring the vertex coordinate information of the minimum closed region, and is convenient and quick and low in cost.
In view of the above, the embodiments of the present invention effectively solve the problems in the prior art.
In one possible implementation manner, each vertex is used as a root node, each vertex in the graph to be filled is traversed based on a connection relationship, and a tree structure corresponding to each vertex is obtained, including:
and traversing each vertex in the graph to be filled based on the connection relation according to the principle of depth-first traversal or breadth-first traversal by taking each vertex as a root node, and obtaining a tree structure corresponding to each vertex.
Wherein, when performing a depth-first traversal or a breadth-first traversal, a certain neighboring node is accessed means that: the adjacency node is on the path between its parent node and the root node.
In this embodiment, the traversal of each vertex in the graph to be filled may be directly performed based on the existing depth-first traversal principle or breadth-first traversal principle, and the traversal method in the embodiment of the present invention is different from the existing traversal method in that the traversal method in the embodiment of the present invention determines whether an adjacent node is accessed in a different manner, that is, that a certain adjacent node is accessed means: the adjacent node is determined not to be accessed if a certain adjacent node does not satisfy the above condition on the path between the parent node and the root node.
In this embodiment, each vertex is used as a root node, and each vertex in the graph to be filled is traversed based on a connection relationship according to a depth-first traversal principle, so as to obtain a tree structure corresponding to each vertex, which can be described in detail as follows:
s11: the root node is taken as the current access node.
S12: and searching the vertexes adjacent to the current access node based on the connection relation of the vertexes to obtain each adjacent node of the current access node.
S13: it is determined whether each of the neighboring nodes has been accessed.
S14: if there is an unviewed adjacent vertex, optionally selecting one unviewed adjacent vertex as the current access node, and returning to execute step S12.
S15: if each adjacent vertex is visited, the method returns to the last visited vertex (i.e. the last current access node), takes the last visited vertex as the current access node, and returns to execute step S13.
S16: steps S12 to S15 are repeatedly performed until all neighboring nodes of the leaf nodes in the tree structure are accessed.
In this embodiment, each vertex is used as a root node, and each vertex in the graph to be filled is traversed based on the connection relationship according to the rule of breadth-first traversal, so as to obtain a tree structure corresponding to each vertex, which can be described in detail as follows:
S21: the root node is taken as the current access node.
S22: and searching the vertexes adjacent to the current access node based on the connection relation of the vertexes to obtain each adjacent node of the current access node.
S23: each of the adjacent nodes is denoted as a first node.
S24: it is determined whether each first node has been accessed.
S25: if a certain first node is not accessed, selecting the first node as the current access node and executing step S22, and returning to execute step S24.
S26: if all the first nodes have been accessed, the process returns to step S23.
S27: steps S22 to S26 are performed until all the neighboring nodes of the leaf nodes in the tree structure are accessed.
In this embodiment, taking the graph to be filled in fig. 2 as an example, the tree structure corresponding to the a vertex can refer to fig. 3, as shown in fig. 3, where the traversing path corresponding to the first leaf node from left to right is ABCDEFA, which is essentially passing through a certain closed area of the a vertex, where the traversing path corresponding to the second leaf node from left to right is ABCDEFB, which is essentially passing through a certain area (non-closed area) of the a vertex, and where the traversing path corresponding to the third leaf node from left to right is ABFA, which is essentially passing through a certain closed area of the a vertex. As can be seen from fig. 3, in the embodiment of the present invention, each area passing through each vertex may be continuously screened through the traversal path corresponding to the leaf node, so as to determine each minimum closed area in the graph to be filled.
By combining the above description, the embodiment of the invention creatively improves the existing traversing method, and based on the traversing method provided by the embodiment of the invention, the traversing path of each leaf node in the tree structure of the embodiment of the invention corresponds to one area, and based on the traversing path, each minimum closed area in the graph to be filled can be determined through the traversing path of the leaf node in each tree structure. The method for determining the minimum closed region provided by the embodiment of the invention is convenient and quick, and is simple to implement.
In one possible implementation manner, determining each minimum closed region in the graph to be filled based on the traversal path corresponding to the leaf node in the tree structure includes:
and determining a path with consistent starting points and end points in the traversing path as a first path corresponding to the closed area.
Each minimum closed region in the graph to be filled is determined based on the number of vertices or the number of lines contained in each first path.
In this embodiment, the fact that the start point and the end point in a certain traversal path are consistent means that the region corresponding to the traversal path is a closed region, that is, the traversal path corresponding to the closed region is a first path, and referring to fig. 3, it can be seen that the region corresponding to the traversal path is not all the closed region, so that the first path corresponding to the closed region can be screened out through the start point and the end point of the traversal path.
In this embodiment, after the first path is determined, each minimum closed region in the graph to be filled may be determined according to the number of vertices or the number of lines included in the first path.
In one possible implementation, determining each minimum closed region in the graph to be filled based on the number of vertices or lines contained in each first path includes:
screening a first path with the least number of vertexes or lines in the tree structure from the first paths corresponding to each tree structure;
and determining the closure area corresponding to each screened first path as each minimum closure area in the graph to be filled.
The first path with the minimum line number specifically refers to the first path with the minimum line number, or the first path with the minimum connection relationship.
Wherein, the number of lines and the number of vertices are explained as follows:
as shown in fig. 3, the traversal path corresponding to the first leaf node from left to right is ABCDEFA, and the traversal path is a first path. The number of vertices of the first path is the number of vertices therein, i.e. 7. The line (or line segment, connection relation) of the first path includes: AB. BC, CD, DE, EF, FA, the number of lines of the first path is 6.
Similarly, as shown in fig. 3, the traversal path corresponding to the third leaf node from left to right is ABFA, and the traversal path is also a first path. The number of vertices of the first path is 4, and the lines (or line segments, connection relations) of the first path include: AB. BF, FA, on this basis, the number of lines of the first path is 3. On this basis, the number of vertices or the number of lines of all the first paths in fig. 3 may be calculated, and the closed area corresponding to the first path with the minimum number of vertices or the minimum number of lines is determined as the minimum closed area.
In this embodiment, for each tree structure, a first path with the least number of vertices or lines may be selected from the first paths corresponding to the tree structure, where the area corresponding to the first path with the least number of vertices or lines is the minimum closed area obtained based on the tree structure. On this basis, the minimum occlusion region obtained for each tree structure can be determined as each minimum occlusion region in the graph to be filled.
In this embodiment, before determining the closed area corresponding to each screened first path as each minimum closed area in the graph to be filled, the method for determining the minimum closed area further includes:
The second screening step is repeatedly performed until all vertices contained in the first paths are different.
Wherein the second screening step comprises: if the vertices contained in the two first paths are the same, optionally one first path is reserved from the two first paths, and the first paths which are not reserved are deleted.
In this embodiment, considering that the minimum closed area may be represented in various forms, for example, the closed area ABF in fig. 2 may also be represented as BFA, in order to avoid repeated representation of the minimum closed area, the first paths may be screened again according to the vertices in the first paths, and the closed area corresponding to the first paths after the screening again is determined as each minimum closed area in the graph to be filled.
Based on the scheme of the embodiment of the invention, the minimum closed area in the graph to be filled can be rapidly screened directly based on the number of vertexes or the number of lines without inquiring the tree structure.
In one possible implementation manner, obtaining the region information of the graph to be filled drawn by the user includes:
and acquiring the outline of the graph to be filled drawn by the user, and taking the outline as the current drawing area.
The step of extracting vertices is repeatedly performed until it is detected that the user stops the drawing process.
And dividing each line in the current drawing area based on the extracted vertexes to obtain the connection relation among the vertexes.
Wherein, the step of extracting the vertex comprises:
after detecting that the user draws the line in the current drawing area, extracting an intersection point of the line drawn by the user and the line in the current drawing area as a vertex, and taking the current drawing area after the user draws the line as a new current drawing area.
In this embodiment, the described "outline" refers to "the outer outline of the pattern to be filled".
In this embodiment, the drawing content of the user may be obtained in real time, the vertices of the drawing area may be extracted according to the drawing content of the user until the user stops drawing, and finally the lines in the drawing area may be divided according to the extracted vertices, so as to obtain the connection relationship between the vertices.
In this embodiment, in the step of extracting the vertex, a vertex filtering step may further be included, where the vertex filtering step includes: if at least one vertex in two vertexes of the line drawn by the user is not intersected with the line in the current drawing area, the line drawn by the user is taken as an invalid line, and on the basis, the related information of the invalid line is not saved. For example, the intersection of the invalid line and the line in the current drawing area is not extracted as a vertex, and the current drawing area is not updated on this basis (that is, the step of "the current drawing area after the user draws the line as a new current drawing area" is not performed, which corresponds to the line that has not been drawn by the user). Based on the scheme, the embodiment of the invention can effectively reduce the calculated amount when the vertex is traversed subsequently and improve the determination efficiency of the minimum closed region. Of course, the embodiment of the present invention may also not perform the vertex filtering step, which does not affect the determination of the minimum closed area in the embodiment.
In one possible implementation manner, if the outline of the to-be-filled graph drawn by the user is a rectangle, and the lines drawn by the user are all straight lines (i.e., the lines drawn by the user are all line segments), the method for determining the minimum closed region provided by the embodiment of the invention may be specifically implemented as follows:
first, referring to fig. 4, the graphics rendering steps to be filled can be described in detail as:
1) The user sets the width and height of the rectangle, and draws a rectangular area with a specified size on the canvas.
2) According to the coordinate information of four vertexes of the rectangle, determining a linear equation of four edges of the rectangle, and according to a linear general equation: the value of the parameter A, B, C is calculated By ax+by+c=0, coordinates of the start point and the end point of the straight line are set, and finally the obtained four line segment data are stored in a line segment array lineArr, and the four vertex coordinate data are stored in a vertex array intersectant points.
3) The user draws a plurality of straight lines intersecting any two line segments on the rectangle to form a new closed region.
4) After each line segment is drawn, a linear equation of the line segment is firstly solved, and then an intersection point (namely a new vertex) is extracted according to a first formula, wherein the first formula is as follows:
x＝(c2*b1-c1*b2)/(a1*b2-a2*b1)
y＝(c1*a2-c2*a1)/(a1*b2-a2*b1)
wherein a1, b1, c1 are the linear equation parameters of the first line segment of the two intersecting line segments, and a2, b2, c2 are the linear equation parameters of the second line segment of the two intersecting line segments.
And (3) obtaining the intersection points of the drawn line segments and other line segments through cyclic calculation, judging whether the intersection points are in the rectangular range, on the drawn line segments and on the line segments intersected with the drawn line segments, if so, extracting the intersection points as new vertexes, and if not, discarding.
5) Dividing drawn line segments and line segments connected with the drawn line segments according to the extracted vertex coordinates, storing all the line segments into a line segment array lineArr, and storing all the vertices into a vertex group intersectant points. The storage manner of the line may refer to the storage manner of the connection relationship between two vertices in the above embodiment, which is not described in detail in this embodiment.
Second, referring to fig. 5, the minimum occlusion region determination step can be detailed as follows:
6) And (3) each vertex in the cyclic vertex array intersectant points (namely, each vertex in the vertex array intersectant points is taken as a root node), finding all the line segments connected with the vertex, recording the process as step1, circulating the line segments searched according to step1, judging the value of the next vertex respectively, filtering the line segments searched by the branch, searching all the connected line segments, recording the parent line segment array pLine of each vertex (the line segment array corresponding to a certain vertex is the line segment which is searched from the root node to the vertex, namely, the traversing path of the vertex is stored in the parent line segment array corresponding to a certain vertex), performing recursive query until the searched line segments are empty, and finally obtaining the data set of the tree structure (namely, the tree structure described by the embodiment of the invention).
7) After all the vertexes are searched, flattening the tree structures, taking out the pLine (namely the traversing path corresponding to the leaf node) of the last stage, filtering out the path with the minimum quantity of the vertexes according to the conditions that the starting point is consistent with the ending point and the like, and obtaining the minimum closed region.
In another possible implementation, determining each minimum closed region in the graph to be filled based on the number of vertices contained in each first path includes:
and repeatedly executing the first screening step until the inclusion relation does not exist in each first path.
And determining the closure area corresponding to each screened first path as each minimum closure area in the graph to be filled.
Wherein the first screening step comprises: if the two first paths have the inclusion relationship, deleting the first paths with more vertexes, and reserving the first paths with less vertexes.
Wherein the existence of the inclusion relationship between the two first paths means that: the start points and the end points of the two first paths are identical, and the first point set belongs to the second point set. The first point set is a point set formed by vertexes contained in one first path, and the second point set is a point set formed by vertexes contained in the other first path.
In the present embodiment, since the first path corresponds to a closed region, the start point and the end point of the first path are identical. The starting point and the ending point of the two first paths are consistent, which can be: the start points of the two first paths coincide, or the end points of the two first paths coincide.
In this embodiment, the first paths may have a certain overlapping relationship or inclusion relationship, and on this basis, the first paths having the inclusion relationship may be screened based on the number of vertices of the first paths, so as to obtain a minimum closed area.
In one possible implementation manner, before determining the closed area corresponding to each screened first path as each minimum closed area in the graph to be filled, the minimum closed area determining method further includes:
the second screening step is repeatedly performed until all vertices contained in the first paths are different.
Wherein the second screening step comprises: if the vertices contained in the two first paths are the same, optionally one first path is reserved from the two first paths, and the first paths which are not reserved are deleted.
In this embodiment, it is considered that the minimum closed area may be represented in various forms, for example, the closed area ABF in fig. 2 may also be represented as BFA, and in this case, in order to avoid repeated representation of the minimum closed area, each first path may be screened according to the vertex in the first path.
Fig. 6 is a block diagram of a minimum occlusion region determining apparatus according to an embodiment of the present invention, corresponding to the minimum occlusion region determining method of the above embodiment. For convenience of explanation, only portions relevant to the embodiments of the present invention are shown. Referring to fig. 6, the minimum occlusion region determining device 20 includes: a data acquisition module 21, a vertex traversal module 22 and a region determination module 23.
The data obtaining module 21 is configured to obtain area information of a graphic to be filled, which is drawn by a user. The region information comprises connection relations of all vertexes in the graph to be filled.
And the vertex traversing module 22 is configured to traverse each vertex in the graph to be filled based on the connection relationship by taking each vertex as a root node, so as to obtain a tree structure corresponding to each vertex.
The region determining module 23 is configured to determine each minimum closed region in the graph to be filled based on the traversal path corresponding to the leaf node in the tree structure.
In one possible implementation, vertex traversal module 22 is specifically configured to:
and traversing each vertex in the graph to be filled based on the connection relation according to the principle of depth-first traversal or breadth-first traversal by taking each vertex as a root node, and obtaining a tree structure corresponding to each vertex.
Wherein, when performing a depth-first traversal or a breadth-first traversal, a certain neighboring node is accessed means that: the adjacency node is on the path between its parent node and the root node.
In one possible implementation, the area determining module 23 is specifically configured to:
and determining a path with consistent starting points and end points in the traversing path as a first path corresponding to the closed area.
Each minimum closed region in the graph to be filled is determined based on the number of vertices or the number of lines contained in each first path.
In one possible implementation, the area determining module 23 is specifically configured to:
and screening the first paths with the least number of vertexes or lines in the tree structure from the first paths corresponding to each tree structure.
And determining the closure area corresponding to each screened first path as each minimum closure area in the graph to be filled.
In one possible implementation, the area determining module 23 is specifically configured to:
and repeatedly executing the first screening step until the inclusion relation does not exist in each first path.
And determining the closure area corresponding to each screened first path as each minimum closure area in the graph to be filled.
Wherein the first screening step comprises: if the two first paths have the inclusion relationship, deleting the first paths with more vertexes, and reserving the first paths with less vertexes.
Wherein the existence of the inclusion relationship between the two first paths means that: the start points and the end points of the two first paths are identical, and the first point set belongs to the second point set. The first point set is a point set formed by vertexes contained in one first path, and the second point set is a point set formed by vertexes contained in the other first path.
In one possible implementation, before determining the closed area corresponding to each first path to be the minimum closed area in the graph to be filled, the area determining module 23 is further configured to:
the second screening step is repeatedly performed until all vertices contained in the first paths are different.
Wherein the second screening step comprises: if the vertices contained in the two first paths are the same, optionally one first path is reserved from the two first paths, and the first paths which are not reserved are deleted.
In one possible implementation, the data acquisition module 21 is specifically configured to:
and acquiring the outline of the graph to be filled drawn by the user, and taking the outline as the current drawing area.
The step of extracting vertices is repeatedly performed until it is detected that the user stops the drawing process.
And dividing each line in the current drawing area based on the extracted vertexes to obtain the connection relation among the vertexes.
Wherein, the step of extracting the vertex comprises:
after detecting that the user draws the line in the current drawing area, extracting an intersection point of the line drawn by the user and the line in the current drawing area as a vertex, and taking the current drawing area after the user draws the line as a new current drawing area.
Referring to fig. 7, fig. 7 is a schematic block diagram of a terminal device according to an embodiment of the present invention. The terminal 300 in the present embodiment as shown in fig. 7 may include: one or more processors 301, one or more input devices 302, one or more output devices 303, and one or more memories 304. The processor 301, the input device 302, the output device 303, and the memory 304 communicate with each other via a communication bus 305. The memory 304 is used to store a computer program comprising program instructions. The processor 301 is configured to execute program instructions stored in the memory 304. Wherein the processor 301 is configured to invoke program instructions to perform the following functions of the modules/units in the above described device embodiments, such as the functions of the modules 21 to 23 shown in fig. 6.
It should be appreciated that in embodiments of the present invention, the processor 301 may be a central processing unit (Central Processing Unit, CPU), which may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSPs), application specific integrated circuits (Application Specific Integrated Circuit, ASICs), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The input device 302 may include a touch pad, a fingerprint sensor (for collecting fingerprint information of a user and direction information of a fingerprint), a microphone, etc., and the output device 303 may include a display (LCD, etc.), a speaker, etc.
The memory 304 may include read only memory and random access memory and provides instructions and data to the processor 301. A portion of memory 304 may also include non-volatile random access memory. For example, the memory 304 may also store information of device type.
In a specific implementation, the processor 301, the input device 302, and the output device 303 described in the embodiments of the present invention may execute the implementation described in the first embodiment and the second embodiment of the method for determining the minimum closed area provided in the embodiments of the present invention, and may also execute the implementation of the terminal described in the embodiments of the present invention, which is not described herein again.
In another embodiment of the present invention, a computer readable storage medium is provided, where the computer readable storage medium stores a computer program, where the computer program includes program instructions, where the program instructions, when executed by a processor, implement all or part of the procedures in the method embodiments described above, or may be implemented by instructing related hardware by the computer program, where the computer program may be stored in a computer readable storage medium, where the computer program, when executed by the processor, implements the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, executable files or in some intermediate form, etc. The computer readable medium may include: any entity or device capable of carrying computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth. It should be noted that the content of the computer readable medium can be appropriately increased or decreased according to the requirements of the jurisdiction's jurisdiction and the patent practice, for example, in some jurisdictions, the computer readable medium does not include electrical carrier signals and telecommunication signals according to the jurisdiction and the patent practice.
The computer readable storage medium may be an internal storage unit of the terminal of any of the foregoing embodiments, such as a hard disk or a memory of the terminal. The computer readable storage medium may also be an external storage device of the terminal, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the terminal. Further, the computer-readable storage medium may also include both an internal storage unit of the terminal and an external storage device. The computer-readable storage medium is used to store a computer program and other programs and data required for the terminal. The computer-readable storage medium may also be used to temporarily store data that has been output or is to be output.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps described in connection with the embodiments disclosed herein may be embodied in electronic hardware, in computer software, or in a combination of the two, and that the elements and steps of the examples have been generally described in terms of function in the foregoing description to clearly illustrate the 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 solution. 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 invention.
It will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working procedures of the terminal and the unit described above may refer to the corresponding procedures in the foregoing method embodiments, which are not repeated herein.
In several embodiments provided by the present application, it should be understood that the disclosed terminal and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of elements is merely a logical functional division, and there may be additional divisions of actual implementation, e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not performed. In addition, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection via some interfaces or units, or may be an electrical, mechanical, or other form of connection.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment of the present application.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The present invention is not limited to the above embodiments, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the present invention, and these modifications and substitutions are intended to be included in the scope of the present invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.
Claims (10)
1. A method of determining a minimum occlusion region, comprising:
acquiring region information of a graph to be filled drawn by a user; the region information comprises connection relations of all vertexes in the graph to be filled;
traversing each vertex in the graph to be filled based on the connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex;
And determining each minimum closed area in the graph to be filled based on the traversing path corresponding to the leaf node in the tree structure.
2. The method for determining a minimum closed region according to claim 1, wherein each vertex is taken as a root node, each vertex in the graph to be filled is traversed based on the connection relationship, and a tree structure corresponding to each vertex is obtained, and the method comprises:
traversing each vertex in the graph to be filled based on the connection relation according to the principle of depth-first traversal or breadth-first traversal by taking each vertex as a root node to obtain a tree structure corresponding to each vertex;
wherein when performing the depth-first traversal or the breadth-first traversal, a certain neighboring node is accessed by: the adjacency node is on the path between its parent node and the root node.
3. The method for determining a minimum closed region according to claim 1, wherein determining each minimum closed region in the graph to be filled based on the traversal path corresponding to the leaf node in the tree structure comprises:
determining a path with consistent starting points and end points in the traversing path as a first path corresponding to a closed area;
And determining each minimum closed area in the graph to be filled based on the number of vertexes or the number of lines contained in each first path.
4. The minimum closed region determination method according to claim 3, wherein the determining each minimum closed region in the graph to be filled based on the number of vertices or the number of lines included in each first path includes:
screening a first path with the least number of vertexes or lines in the tree structure from the first paths corresponding to each tree structure;
and determining the closure area corresponding to each screened first path as each minimum closure area in the graph to be filled.
5. The minimum closed region determination method according to claim 3, wherein determining each minimum closed region in the graph to be filled based on the number of vertices contained in each first path comprises:
repeatedly executing the first screening step until the first paths have no inclusion relationship;
determining the closure area corresponding to each first path each minimum closed area in the graph to be filled is provided;
wherein the first screening step comprises: if the two first paths have the inclusion relationship, deleting the first paths with more vertexes, and reserving the first paths with less vertexes;
Wherein the existence of the inclusion relationship between the two first paths means that: the starting points and the ending points of the two first paths are consistent, and the first point set belongs to the second point set; the first point set is a point set formed by vertexes contained in one first path, and the second point set is a point set formed by vertexes contained in the other first path.
6. The minimum occlusion region determination method of any of claims 4 or 5, wherein before determining the occlusion region corresponding to each of the screened first paths as each of the minimum occlusion regions in the graph to be filled, the minimum occlusion region determination method further comprises:
repeating the second screening step until all vertices contained in the first paths are different;
wherein the second screening step comprises: if the vertices contained in the two first paths are the same, optionally one first path is reserved from the two first paths, and the first paths which are not reserved are deleted.
7. The method for determining a minimum closed area according to any one of claims 1 to 6, wherein the obtaining the area information of the graphic to be filled drawn by the user includes:
acquiring the outline of a graph to be filled drawn by a user, and taking the outline as a current drawing area;
Repeatedly executing the vertex extraction step until the user is detected to stop the drawing process;
dividing each line in the current drawing area based on the extracted vertexes to obtain the connection relation among the vertexes;
wherein, the step of extracting the vertex comprises the following steps:
after detecting that the user draws the line in the current drawing area, extracting an intersection point of the line drawn by the user and the line in the current drawing area as a vertex, and taking the current drawing area after the user draws the line as a new current drawing area.
8. A minimum occlusion region determining device, comprising:
the data acquisition module is used for acquiring the region information of the graph to be filled drawn by the user; the region information comprises connection relations of all vertexes in the graph to be filled;
the vertex traversing module is used for traversing each vertex in the graph to be filled based on the connection relation by taking each vertex as a root node to obtain a tree structure corresponding to each vertex;
and the region determining module is used for determining each minimum closed region in the graph to be filled based on the traversing paths corresponding to the leaf nodes in the tree structure.
9. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any of claims 1 to 7 when the computer program is executed.
10. A computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310712498.3A CN116958319A (en) | 2023-06-15 | 2023-06-15 | Minimum closure area determining method and device, terminal equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310712498.3A CN116958319A (en) | 2023-06-15 | 2023-06-15 | Minimum closure area determining method and device, terminal equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116958319A true CN116958319A (en) | 2023-10-27 |
Family
ID=88451985
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310712498.3A Pending CN116958319A (en) | 2023-06-15 | 2023-06-15 | Minimum closure area determining method and device, terminal equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116958319A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117437329A (en) * | 2023-12-12 | 2024-01-23 | 江西云眼视界科技股份有限公司 | High-consequence region drawing method, system, readable storage medium and computer device |
-
2023
- 2023-06-15 CN CN202310712498.3A patent/CN116958319A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117437329A (en) * | 2023-12-12 | 2024-01-23 | 江西云眼视界科技股份有限公司 | High-consequence region drawing method, system, readable storage medium and computer device |
| CN117437329B (en) * | 2023-12-12 | 2024-03-01 | 江西云眼视界科技股份有限公司 | High-consequence region drawing method, system, readable storage medium and computer device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111028242A (en) | Automatic tumor segmentation system and method and electronic equipment | |
| CN110674341B (en) | Special effect processing method and device, electronic equipment and storage medium | |
| CN116958319A (en) | Minimum closure area determining method and device, terminal equipment and readable storage medium | |
| CN110559665A (en) | Game map processing method and device, terminal device and storage medium | |
| CN111080654B (en) | Image lesion region segmentation method and device and server | |
| CN111508054A (en) | Terrain construction method, device and equipment | |
| CN115829927A (en) | Microcirculation image blood vessel region extraction method, device, equipment and storage medium | |
| CN109671132A (en) | A kind of curve data acquisition method, apparatus and system based on colour gamut feature | |
| CN110533740A (en) | A kind of image rendering methods, device, system and storage medium | |
| CN112487127B (en) | Crowdsourcing graph building method and device based on color feature distribution and image semantics | |
| CN115830273B (en) | Optimization method and device for lightweight grid before three-dimensional scene rendering | |
| CN113112488A (en) | Road center line extraction method and device, storage medium and terminal equipment | |
| CN116010510A (en) | Visualization method, device, equipment and storage medium for hierarchical data | |
| CN115546455B (en) | Three-dimensional building model singulation method, device and storage medium | |
| CN113191310B (en) | Boundary recognition method, device and equipment for vector PDF drawing entity filling | |
| CN106846498B (en) | Laser point cloud rendering method and device | |
| CN114463477A (en) | Model mapping method and device and electronic equipment | |
| CN115049531A (en) | Image rendering method and device, graphic processing equipment and storage medium | |
| CN111462343B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN112927324A (en) | Data processing method and device of sideband compensation mode of sample point adaptive compensation | |
| CN111340914A (en) | Map generation method and device, storage medium and vehicle | |
| CN108845961A (en) | A kind of creation vertex buffer method, apparatus and readable storage medium storing program for executing | |
| CN111161351B (en) | Target component coordinate acquisition method and system | |
| CN117807947A (en) | Method, device and storage medium for floor planning | |
| CN117194704B (en) | Method, device and equipment for inquiring attribute of component-level live-action three-dimensional model |
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 |