CN113448667B - Method and device for generating display relationship diagram - Google Patents
Method and device for generating display relationship diagram Download PDFInfo
- Publication number
- CN113448667B CN113448667B CN202110642482.0A CN202110642482A CN113448667B CN 113448667 B CN113448667 B CN 113448667B CN 202110642482 A CN202110642482 A CN 202110642482A CN 113448667 B CN113448667 B CN 113448667B
- Authority
- CN
- China
- Prior art keywords
- path
- segmentation unit
- segmentation
- determining
- display diagram
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/451—Execution arrangements for user interfaces
-
- 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
Abstract
The embodiment of the invention provides a method and a device for generating a display relation diagram, wherein the method comprises the steps of dividing the display diagram by taking an occupied area of an object as a whole for any object in the display diagram to obtain a division diagram, determining that the division unit is a passing area or an obstacle area for any division unit in the division diagram, determining a path between a first object and a second object by taking the division unit as a dimension, and drawing each path between the objects in the display diagram. Because the display diagram is unevenly segmented by taking the occupied area of the objects as a whole and the path is found by taking the segmentation unit as a dimension, the path between the objects can be rapidly and accurately determined so as to timely and accurately draw the right-angle connecting lines between the objects, thereby realizing the automatic and accurate drawing of the path connecting lines between the objects in the display relation diagram and realizing that the barrier objects can be automatically avoided when the drawing is performed based on the right-angle connecting lines.
Description
Technical Field
The embodiment of the invention relates to the technical field of graphic processing, in particular to a method and a device for generating a display relationship diagram.
Background
In the current UI interface presentation, presenting a relationship diagram is a common data presentation manner. The illustrated relationship diagram is generally used to describe the relationship between objects, typically by one or more wires connecting two or more objects. Wherein, the simpler description mode is connected by straight lines or arrows, which are used for indicating the intercommunication property between objects; a complex way of describing this may be to connect objects using curved or irregular paths to exhibit more complex interworking properties, such as map routing paths, etc.
At this stage, there are mainly two forms for the connection between two or more objects. One is a simple connection of two or more objects, which can be drawn, typically in an automatically generated wiring manner. Another is the complex connection of two or more objects, which are typically cut in a uniform cut pattern and based on a search algorithm to draw a line between the two or more objects. However, in this drawing method, a uniform graph cutting method is adopted, so that the calculation amount of the search algorithm is large, and the drawing efficiency of the connecting line is low.
In summary, there is a need for a method for generating a display relationship graph, which is used for automatically and accurately drawing path lines between objects in the display relationship graph, and can automatically avoid obstacle objects when drawing based on right-angle lines.
Disclosure of Invention
The embodiment of the invention provides a method and a device for generating a display relation diagram, which are used for automatically and accurately drawing a path connecting line among objects in the display relation diagram, and can automatically avoid barrier objects when drawing is performed based on right-angle connecting lines.
In a first aspect, an embodiment of the present invention provides a method for generating a display relationship diagram, including:
for any object in the display diagram, dividing the display diagram by taking the occupied area of the object as a whole to obtain a division diagram;
determining that the segmentation unit is a passing area or an obstacle area aiming at any segmentation unit in the segmentation graph; wherein, the passing area means that the segmentation unit is not occupied by any object;
determining a path between the first object and the second object by taking the segmentation unit as a dimension; the path is each segmentation unit of a segmentation unit path from a segmentation unit where a starting point of the first object is located to a segmentation unit where an end point of the second object is located; the first object and the second object are objects in the display diagram;
And drawing each path among the objects in the display diagram.
In the above technical solution, for any object in the display diagram, the display diagram is segmented by taking the occupied area of the object as a whole, so as to obtain a segmentation diagram, and for any segmentation unit in the segmentation diagram, the segmentation unit is determined to be a passing area or an obstacle area. And determining a path between the first object and the second object by taking the segmentation unit as a dimension, wherein the path is each segmentation unit of a segmentation unit path from the segmentation unit where the starting point of the first object is located to the segmentation unit where the end point of the second object is located. Then, each path between each object is drawn in the presentation diagram. Because the display diagram is unevenly segmented by taking the occupied area of the object as a whole, the problem that the determination efficiency of paths among the objects is low due to the fact that the display diagram is evenly segmented in the prior art can be solved. And then the path searching is carried out by taking the segmentation unit as a dimension, so that the path between the objects can be rapidly and accurately determined, and the right-angle connecting lines between the objects can be timely and accurately drawn, thereby automatically drawing the connecting lines between the objects, automatically avoiding the barrier objects when drawing based on the right-angle connecting lines, drawing the connecting lines without depending on manual given paths, and further realizing automatic and accurate drawing of the path connecting lines between the objects in the display relationship graph.
Optionally, for any object in the display diagram, the dividing the display diagram by taking the occupied area of the object as a whole to obtain a divided diagram includes:
for any object in the display diagram, determining a minimum rectangular frame of an occupied area of the object;
dividing the display diagram according to the edges of the minimum rectangular frame;
and cutting through the minimum rectangular frame of each object to obtain the cutting graph.
According to the technical scheme, the display diagram is segmented according to the edges of the minimum rectangular frames corresponding to the objects, so that the segmentation diagram corresponding to the display diagram can be accurately segmented, support is provided for the subsequent rapid and accurate determination of paths among the objects, and the problem that in the prior art, the determination efficiency of the paths among the objects is low due to the fact that the display diagram is evenly segmented can be solved.
Optionally, the drawing each path of each object in the display diagram includes:
determining a segmentation unit serving as an inflection point in any path;
converting a segmentation unit with a starting point, a segmentation unit with an inflection point and a segmentation unit with an end point into coordinate points in the display diagram;
Connecting all coordinate points in a right-angle connecting mode to form a path line;
adjusting the path lines with overlapping paths in the path lines to obtain adjusted path lines;
and drawing each path line after adjustment in the display diagram.
According to the technical scheme, for any path, the inflection point in the path is determined by optimizing the path, and the inflection point in the path is reserved, so that unnecessary path points when some path connecting lines are drawn can be screened out, the calculation amount of performing overlap removing processing on each path in the follow-up process can be reduced, the path points needed by the path connecting lines in the follow-up process can be reduced, and the efficiency of drawing the path connecting lines can be improved.
Optionally, the adjusting for the path lines with overlapping path lines in each path line to obtain adjusted path lines includes:
if the overlapping path lines exist in the path lines, adjusting the overlapping path lines based on the de-overlapping vector until the overlapping path lines do not exist in the path lines, so as to determine the adjusted path lines; the de-overlapping vector is determined based on the size of each segmentation unit.
In the technical scheme, if the overlapping path lines are determined to exist in the path lines, the overlapping path lines are adjusted based on the de-overlapping vector, so that the path lines are ensured not to overlap, the attractive appearance of the path lines on the canvas is improved, and more visual and comfortable experience is provided for users.
Optionally, after determining the adjusted path lines, the method further includes:
determining whether a path point with a position outside a corresponding original segmentation unit exists in the path lines according to any path line in the adjusted path lines;
if the fact that the path points with the positions outside the corresponding original segmentation units exist in the path line is determined, resetting the coordinate positions of the original segmentation units corresponding to the path points, and acquiring the path line again based on the reset original segmentation units.
In the above technical solution, if it is determined that a path point whose position is located outside the corresponding original segmentation unit exists in the path line, the coordinate position of the original segmentation unit corresponding to the path point is reset, so as to ensure that the path lines do not overlap, and ensure that the drawn path line can truly and intuitively reflect the intercommunication relationship between the objects.
Optionally, the determining the path between the first object and the second object with the segmentation unit as a dimension includes:
and determining a path between the first object and the second object by using the segmentation unit as a dimension through a shortest path algorithm.
In the technical scheme, the occupied area of the objects is taken as a whole to split the display diagram, and the splitting unit is taken as a dimension to search the path through the shortest path algorithm, so that the path among the objects can be rapidly and accurately determined, and support is provided for the follow-up timely and accurate drawing of right-angle connecting lines among the objects.
Optionally, for any segmentation unit in the segmentation graph, determining the segmentation unit as a traffic zone or an obstacle zone includes:
graying treatment is carried out on the segmentation graph to obtain a first gray value of each segmentation unit in the segmentation graph;
performing binarization processing on the gray value of each segmentation unit in the segmentation graph to obtain a second gray value of each segmentation unit in the segmentation graph;
for any segmentation unit in the segmentation graph, if the second gray value of the segmentation unit is determined to be a first value, determining that the segmentation unit is a passing area; and if the second gray value of the segmentation unit is determined to be the second value, determining the segmentation unit to be an obstacle region.
According to the technical scheme, the segmentation map is subjected to gray level processing, and the gray level value of each segmentation unit in the segmentation map is subjected to binary processing, so that each segmentation unit can be rapidly and accurately identified as a passing area or an obstacle area.
In a second aspect, an embodiment of the present invention further provides an apparatus for generating a display relationship diagram, including:
the segmentation unit is used for segmenting any object in the display diagram by taking the occupied area of the object as a whole to obtain a segmentation diagram;
the processing unit is used for determining that the segmentation unit is a passing area or an obstacle area aiming at any segmentation unit in the segmentation graph; wherein, the passing area means that the segmentation unit is not occupied by any object; determining a path between the first object and the second object by taking the segmentation unit as a dimension; the path is each segmentation unit of a segmentation unit path from a segmentation unit where a starting point of the first object is located to a segmentation unit where an end point of the second object is located; the first object and the second object are objects in the display diagram; and drawing each path among the objects in the display diagram.
Optionally, the slicing unit is specifically configured to:
For any object in the display diagram, determining a minimum rectangular frame of an occupied area of the object;
dividing the display diagram according to the edges of the minimum rectangular frame;
and cutting through the minimum rectangular frame of each object to obtain the cutting graph.
Optionally, the processing unit is specifically configured to:
determining a segmentation unit serving as an inflection point in any path;
converting a segmentation unit with a starting point, a segmentation unit with an inflection point and a segmentation unit with an end point into coordinate points in the display diagram;
connecting all coordinate points in a right-angle connecting mode to form a path line;
adjusting the path lines with overlapping paths in the path lines to obtain adjusted path lines;
and drawing each path line after adjustment in the display diagram.
Optionally, the processing unit is specifically configured to:
if the overlapping path lines exist in the path lines, adjusting the overlapping path lines based on the de-overlapping vector until the overlapping path lines do not exist in the path lines, so as to determine the adjusted path lines; the de-overlapping vector is determined based on the size of each segmentation unit.
Optionally, the processing unit is further configured to:
determining whether a path point with a position outside a corresponding original segmentation unit exists in the path lines according to any path line in the adjusted path lines;
if the fact that the path points with the positions outside the corresponding original segmentation units exist in the path line is determined, resetting the coordinate positions of the original segmentation units corresponding to the path points, and acquiring the path line again based on the reset original segmentation units.
Optionally, the processing unit is specifically configured to:
and determining a path between the first object and the second object by using the segmentation unit as a dimension through a shortest path algorithm.
Optionally, the processing unit is specifically configured to:
graying treatment is carried out on the segmentation graph to obtain a first gray value of each segmentation unit in the segmentation graph;
performing binarization processing on the gray value of each segmentation unit in the segmentation graph to obtain a second gray value of each segmentation unit in the segmentation graph;
for any segmentation unit in the segmentation graph, if the second gray value of the segmentation unit is determined to be a first value, determining that the segmentation unit is a passing area; and if the second gray value of the segmentation unit is determined to be the second value, determining the segmentation unit to be an obstacle region.
In a third aspect, an embodiment of the present invention provides a computing device, including at least one processor and at least one memory, where the memory stores a computer program that, when executed by the processor, causes the processor to perform the method for generating a presentation relationship diagram according to any of the first aspects described above.
In a fourth aspect, an embodiment of the present invention provides a computer readable storage medium storing a computer program executable by a computing device, which when run on the computing device, causes the computing device to perform the method of generating a presentation relationship diagram of any of the first aspects described above.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a system architecture according to an embodiment of the present invention;
FIG. 2 is a flowchart of a method for generating a display relationship diagram according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of an initial canvas according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a plurality of irregular patterns after being segmented according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a grid based on irregular patterns according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a digital grid based on irregular patterns according to an embodiment of the present invention;
fig. 7 is a schematic diagram of a right-angle connection drawn based on an irregular graph according to an embodiment of the present invention;
FIG. 8 is a schematic structural diagram of an apparatus for generating a relationship diagram according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of a computing device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Fig. 1 is a system architecture according to an embodiment of the present invention. As shown in fig. 1, the system architecture may be a server 100 including a processor 110, a communication interface 120, and a memory 130.
The communication interface 120 is used for communicating with a terminal device, receiving and transmitting information transmitted by the terminal device, and realizing communication.
The processor 110 is a control center of the server 100, connects various parts of the entire server 100 using various interfaces and lines, and performs various functions of the server 100 and processes data by running or executing software programs and/or modules stored in the memory 130, and calling data stored in the memory 130. Optionally, the processor 110 may include one or more processing units.
The memory 130 may be used to store software programs and modules, and the processor 110 performs various functional applications and data processing by executing the software programs and modules stored in the memory 130. The memory 130 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, application programs required for at least one function, and the like; the storage data area may store data created according to business processes, etc. In addition, memory 130 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.
It should be noted that the structure shown in fig. 1 is merely an example, and the embodiment of the present invention is not limited thereto.
Based on the foregoing description, fig. 2 illustrates a flow of a method for generating a presentation relationship diagram according to an embodiment of the present invention, where the flow may be executed by an apparatus for generating a presentation relationship diagram.
As shown in fig. 2, the process specifically includes:
step 201, for any object in the display diagram, dividing the display diagram by taking the occupied area of the object as a whole, to obtain a division diagram.
Step 202, determining that the segmentation unit is a traffic zone or an obstacle zone according to any segmentation unit in the segmentation graph.
In step 203, the path between the first object and the second object is determined by using the segmentation unit as a dimension.
And 204, drawing each path among each object in the display diagram.
In the above step 201, for any object in the display diagram, the display diagram is segmented by taking the occupied area of the object as a whole, and a segmentation diagram is obtained. That is, for any object in the display diagram, a minimum rectangular frame of the occupied area of the object is determined, the display diagram is segmented according to the edges of the minimum rectangular frame, and then the segmentation is performed through the minimum rectangular frame of each object, so that a segmentation diagram is obtained. Therefore, the segmentation diagram corresponding to the display diagram can be accurately segmented by segmenting the display diagram according to the edges of each minimum rectangular frame corresponding to each object, so that support is provided for the subsequent rapid and accurate determination of the paths among the objects, and the problem that the determination efficiency of the paths among the objects is low due to the fact that the display diagram is evenly segmented in the prior art can be solved. Specifically, an irregular pattern collision detection algorithm may be used to sequentially perform collision detection on each object in the display diagram. That is, for each object in the display diagram, collision detection is performed on the object, the position of the object and the outline size of the object are identified, and a rectangular frame wrapping the object is determined. Therefore, based on the irregular pattern collision detection algorithm, the positions of the objects in the display diagram and the outline sizes of the objects can be identified, and the rectangular frames of the objects can be determined.
In step 202, for any segmentation unit in the segmentation map, the segmentation unit is determined to be a traffic zone or an obstacle zone. The method comprises the steps of carrying out graying treatment on a segmentation graph to obtain a first gray value of each segmentation unit in the segmentation graph, and carrying out binarization treatment on the gray value of each segmentation unit in the segmentation graph to obtain a second gray value of each segmentation unit in the segmentation graph. Then, aiming at any segmentation unit in the segmentation graph, if the second gray value of the segmentation unit is determined to be a first value, the segmentation unit is determined to be a passing area; and if the second gray value of the segmentation unit is determined to be the second value, determining the segmentation unit to be an obstacle region. The passing area refers to that the segmentation unit is not occupied by any object. Therefore, the dividing map is subjected to gray level processing, and the gray level value of each dividing unit in the dividing map is subjected to binary processing, so that each dividing unit can be rapidly and accurately identified as a passing area or an obstacle area. Specifically, the segmentation map is subjected to gray processing to obtain a gray segmentation map, the gray segmentation map is subjected to binarization processing to obtain a binarized segmentation map, then the binarized segmentation map is identified, gray values corresponding to each segmentation unit in the segmentation map are identified, and each segmentation unit is represented by a number based on the gray values corresponding to each segmentation unit. For example, if the gray value corresponding to a certain segmentation unit is 0, it indicates that the segmentation unit area has an obstacle (i.e. the segmentation unit area has an object occupied), and therefore, in the embodiment of the present invention, the number 1 indicates that the segmentation unit area has an obstacle. If the gray value corresponding to a certain segmentation unit is 255, it indicates that the segmentation unit area has no obstacle (i.e., the segmentation unit area has no object occupation and can pass through), so in the embodiment of the present invention, the number 0 indicates that the segmentation unit area can pass through.
In the step 203, the path between the first object and the second object is determined by using the segmentation unit as a dimension. That is, a path between the first object and the second object is determined by a shortest path algorithm with the segmentation unit as a dimension. Therefore, the occupied area of the objects is taken as a whole to segment the display diagram, and the path is found by taking the segmentation unit as a dimension through the shortest path algorithm, so that the path between the objects can be rapidly and accurately determined, and support is provided for the follow-up timely and accurate drawing of right-angle connecting lines between the objects. The path is each segmentation unit of a segmentation unit path from a segmentation unit where a starting point of a first object is located to a segmentation unit where an end point of a second object is located; the first object and the second object are objects in the display diagram. Specifically, an a-algorithm may be used to process the first object and the second object, and find a shortest path between the first object and the second object. Of course, other shortest path algorithms may be used to find the shortest path between the first object and the second object. The embodiments of the present invention are not limited in this regard.
In step 204, paths between objects are drawn in the display diagram. That is, for any path, a segmentation cell that is an inflection point in the path is determined, and the segmentation cell where the start point is located, the segmentation cell where the inflection point is located, and the segmentation cell where the end point is located are converted into coordinate points in the display diagram. And connecting the coordinate points in a right-angle connection mode to form path lines, and adjusting the path lines with overlapping paths in the path lines to obtain adjusted path lines. And then drawing the adjusted path lines in the display diagram. Based on the method, for any path, the inflection point in the path is determined by optimizing the path, and the inflection point in the path is reserved, so that unnecessary path points when some path connecting lines are drawn can be screened out, the calculation amount of performing de-overlapping processing on each path in the follow-up process can be reduced, the path points needed by the path connecting lines in the follow-up process can be reduced, and the efficiency of drawing the path connecting lines can be improved.
Wherein, a procedure of adjusting path lines where there is overlap in each path line is described. That is, if it is determined that there is an overlapping path line in each path line, the overlapping path line is adjusted based on the de-overlapping vector until there is no overlapping path line in each path line, thereby determining each path line after adjustment. Therefore, the paths and the lines of the paths are not overlapped, which is helpful to increase the beauty of the paths and the lines on the canvas, so as to provide more visual and comfortable experience for users. Wherein the de-overlap vector is determined based on the size of each segmentation unit.
In the process of adjusting the overlapped path lines, it is necessary to determine whether the path points in the adjusted overlapped path lines are located in the corresponding original segmentation units. That is, for any one of the adjusted path lines, it is determined whether there is a path point in the path line whose position is outside the corresponding original segmentation unit. If the existence of the path point with the position outside the corresponding original segmentation unit in the path line is determined, resetting the coordinate position of the original segmentation unit corresponding to the path point, and acquiring the path line again based on the reset original segmentation unit. Therefore, the method can help to ensure that all path lines are not overlapped, and ensure that the drawn path lines can truly and intuitively reflect the intercommunication relation among objects. Specifically, if each path point in the adjusted overlapped path line is located in the corresponding original segmentation cell, the rest of the overlapped path line judgment is continuously completed. If each path point in the adjusted overlapped path line has a path point outside the corresponding original segmentation cell, setting the digital coordinate position of the original segmentation cell corresponding to the path point to be 1, then re-acquiring the path, and completing the adjustment process again until all paths are processed.
In view of this, the implementation process of the method for generating the display relationship diagram in the embodiment of the present invention is described in detail below.
Step1: and carrying out irregular cutting on the plurality of irregular patterns.
Illustratively, as shown in FIG. 3, FIG. 3 is a schematic drawing of an initial canvas provided by an embodiment of the present invention. In a specific implementation process, the method responds to a path drawing request triggered by a user at a client or a timing path drawing request set by the user at the client. After the server obtains the path drawing request, according to the path drawing information (such as drawing the path among the irregular figures) in the path drawing request, an initial canvas containing a plurality of irregular figures (such as two or more irregular figures) in the path drawing information is obtained. And then, adopting an irregular pattern collision detection algorithm to sequentially perform collision detection on the plurality of irregular patterns in the initial canvas. Namely, for each irregular figure in a plurality of irregular figures, collision detection is carried out on the irregular figure, the position of the irregular figure in an initial canvas and the outline size of the irregular figure are identified, and a rectangular frame wrapping the irregular figure is determined. Therefore, based on the irregular graph collision detection algorithm, the positions of the plurality of irregular graphs in the initial canvas and the outline sizes of the plurality of irregular graphs can be identified, and the rectangular frames of the plurality of irregular graphs can be determined. The schematic diagram after splitting the multiple irregular graphs may be shown in fig. 4.
Step2: a digital grid is generated based on the respective positions of the plurality of irregular figures in the initial canvas, the contour size, and the rectangular box.
After the irregular patterns are subjected to irregular pattern cutting, dividing the whole canvas into grids according to the cut irregular patterns. That is, four sides of the rectangular frame of each of the plurality of irregular figures are extended over the canvas to generate the grid shown in FIG. 5. And carrying out graying treatment on the grid graph to obtain a grayed grid graph, carrying out binarization treatment on the grayed grid graph to obtain a binarized grid graph, identifying the gray value corresponding to each grid in the grid graph, and expressing each grid by numbers based on the gray value corresponding to each grid, so that the digital grid shown in fig. 6 can be formed. Wherein the number grid is a two-dimensional array, and each element in the two-dimensional array is a number. The number 0 indicates that the area is passable and the number 1 indicates that the area has an obstacle. When generating the digital grids, the size and the coordinate position corresponding to each grid need to be stored and recorded. Here, it is mainly because the irregular cutting of a plurality of irregular patterns is uneven, and the size and coordinate position of each grid are different, so that it is necessary to save records.
Wherein, the digital grid may correspond to:
for example, the position information corresponding to Matrix [1] [2] is:
step3: paths between the start irregular pattern and the end irregular pattern are determined on the digital grid using a shortest path algorithm.
Illustratively, the embodiments of the present invention describe determining paths between a start irregular pattern and an end irregular pattern on a digital grid using an a-algorithm as an example. The aim of the embodiment of the invention is to automatically draw two points or points on a graphThe connection between multiple points, therefore, embodiments of the present invention may abstract the relationship between two or more points into a point-to-point list (i.e., a point-to-point list for representing a starting irregular figure and an ending irregular figure), each item in the list describing a pair of points, i.e., the coordinates (x) 1 ,y 1 )，(x 2 ,y 2 ). Note that, the point (x 1 ,y 1 ) Is an arbitrary point in the starting point irregular figure, a point (x 1 ,y 1 ) Has a grid (cell) corresponding to itself, and points (x 1 ,y 1 ) Is positioned in the grid corresponding to the user. Point (x) 2 ,y 2 ) For any point in the end point irregularity pattern, a point (x 2 ,y 2 ) Has a grid corresponding to itself, and points (x 2 ,y 2 ) Is positioned in the grid corresponding to the user.
In addition, since Step2 has already determined the digital grid and the position information corresponding to each grid in the digital grid, it is possible to calculate (x 1 ,y 1 )，(x 2 ,y 2 ) Corresponding coordinates (x m1 ,y m1 )，(x m2 ,y m2 ). At this time, the shortest path between two or more points can be obtained by using an algorithm a to find a path between two or more points on the digital grid. Illustratively, find (x 1 ,y 1 ) And (x) 2 ,y 2 ) The shortest path between (x) pairs on the digital grid using an a-algorithm m1 ,y m1 ) And (x) m2 ,y m2 ) And a path is found between them so as to obtain (x) 1 ,y 1 ) And (x) 2 ,y 2 ) The shortest path between them. The a algorithm is a relatively fast shortest path algorithm, but since the a algorithm is a heuristic algorithm, it is also time consuming when the amount of data is large. In the embodiment of the invention, a plurality of irregular patterns are compressed to form a digital grid (two-dimensional array) on the basis of Step1 and Step2, and then the A-type algorithm is used for searching paths on the digital grid.Wherein, (x) m1 ,y m1 )，(x m2 ,y m2 ) Can be respectively based on (x 1 ,y 1 )，(x 2 ,y 2 ) The corresponding position information (top, left, width, height) on the digital grid is calculated, i.e., (x) m1 ,y m1 ) Or (x) m2 ,y m2 ) Can be calculated according to the formula (left+width/2, top+height/2).
Step4: and optimizing any path, and determining the position information of the optimized path in the canvas.
Since the shortest path between two points generated based on the algorithm a is a set of path coordinates describing a path between two points on Matrix, the path coordinates between two points need to be processed to correlate the path with the canvas. The method for processing the path coordinates between the two points specifically comprises the following steps:
a. and (5) optimizing path coordinates.
For each path in each path, the coordinates of the path are a series of point sets, but when the path is drawn and connected, a plurality of points are redundant in practice, so that optimization processing can be carried out on each path point in the path to determine the path point needed to be used for drawing the path connection. It should be understood that since two points can draw a line segment, only the starting point, the ending point and the inflection point of the path line are required to be remained, so that the line drawing of the path can be realized, the calculation amount of performing the de-overlapping processing on each path can be reduced, and the path points required for drawing the path line can be reduced, thereby improving the efficiency of drawing the path line.
Illustratively, the method is described as (x 1 ,y 1 ) And (x) 2 ,y 2 ) The shortest path between them is described for example for path coordinate optimization. Namely, for (x) 1 ,y 1 ) And (x) 2 ,y 2 ) At a point (x 3 ,y 3 ) So long as it is determined (x 1 ,y 1 )、(x 2 ,y 2 ) And (x) 3 ,y 3 ) Satisfy (x) 2 -x 1 )*(y 3 -y 2 )≠(x 3 -x 2 )*(y 2 -y 1 ) The point (x 3 ,y 3 ) This is the inflection point and is preserved.
It should be noted that, since there may be one or more inflection points in each path, each inflection point in each path needs to be determined and reserved for each inflection point in each path.
b. And determining the basic positions of the starting point, the ending point and the inflection point of the path on the canvas according to the position information corresponding to the starting point, the ending point and the inflection point of the path.
Because Step2 has already determined the digital grid and the position information corresponding to each grid in the digital grid, the position information corresponding to each path point in the path can be determined. After the start point, the end point, and the inflection point included in each path are obtained based on Step4, the position information (top, left, width, height) corresponding to each of the start point, the end point, and the inflection point can be queried. And then according to the position information corresponding to the starting point, the ending point and the inflection point, calculating the basic positions of the starting point, the ending point and the inflection point on the canvas by means of a basic position calculation formula (left+width/2, top+height/2).
Step5: and carrying out de-overlapping treatment on each path by using a path de-overlapping algorithm to obtain each path after de-overlapping.
After the paths are optimized, the path connection line of each optimized path can be determined according to the basic positions corresponding to the path points in the optimized path (namely, the basic positions of the starting point, the end point and the inflection point in the optimized path on the canvas). However, when the paths after the optimization are connected, there may be an overlap between the path connections. Therefore, it is necessary to perform the overlap removal processing on each optimized path by using the path overlap removal algorithm, and obtain each optimized path after overlap removal. Therefore, paths after optimization processing can be ensured not to be overlapped, the attractiveness of the connecting lines of the paths on the canvas can be increased, and more visual and comfortable experience can be provided for users.
The process of performing the de-overlapping processing on each path by using the path de-overlapping algorithm specifically comprises the following steps:
a. the de-overlapping vector set is defined according to the size of the canvas and the size of the segmentation grid (segmentation cells).
Illustratively, the set of de-overlapping vectors is [ (1, 0), (-1, 0), (0, 1), (0, -1) ] n m.
Wherein n is the iteration number of the path de-overlapping algorithm; m is a distance for each path point in the overlapping path to move, and may be set according to the size of each division cell.
b. And performing de-overlapping processing on each optimized path by using the de-overlapping vector set.
First, it is determined whether a line segment on a certain path overlaps an existing path. Assume that a line segment on the existing path is (x) 1 ,y 1 )→(x 2 ,y 2 ) One line segment on the path to be processed is (a) 1 ,b 1 )→(a 2 ,b 2 ). Because the drawn connection lines of the paths in the embodiment of the invention are all right-angle connection lines, the line segments can only be horizontal or vertical line segments, and the mode for judging whether the line segments overlap can be as follows:
if x 1 ＝＝a 1 Then y 1 ≤(b 1 |b 2 )≤y 2 Or y 2 ≤(b 1 |b 2 )≤y 1 When determining line segment (a) 1 ,b 1 )→(a 2 ,b 2 ) And line segment (x) 1 ,y 1 )→(x 2 ,y 2 ) There is an overlap.
If y 1 ＝＝b 1 X is then 1 ≤(a 1 |a 2 )≤x 2 Or x 2 ≤(a 1 |a 2 )≤x 1 When determining line segment (a) 1 ,b 1 )→(a 2 ,b 2 ) And line segment (x) 1 ,y 1 )→(x 2 ,y 2 ) There is an overlap.
In addition, in the process of performing the de-overlapping process on each optimized path by using the de-overlapping vector set, it is necessary to determine whether each path point in the de-overlapped path is located inside the corresponding original segmentation cell. Illustratively, the position information of a certain segmentation cell is (top, left, width, height). The basic position of the path point corresponding to the splitting cell is (x, y), and the mode of judging whether the path point is positioned in the original splitting cell may be: left < x < left+width & & top < y < top+height.
Specifically, if it is judged that the line segment (a 1 ,b 1 )→(a 2 ,b 2 ) And line segment (x) 1 ,y 1 )→(x 2 ,y 2 ) If there is overlap, then for line segment (a 1 ,b 1 )→(a 2 ,b 2 ) All the path points in the path line are moved by using the de-overlapping vectors in turn (wherein the horizontal line segment only changes the ordinate and the vertical line segment only changes the abscissa) until the line segment (a) 1 ,b 1 )→(a 2 ,b 2 ) And line segment (x) 1 ,y 1 )→(x 2 ,y 2 ) There is no overlap. Then, whether each path point after movement is positioned in the corresponding original segmentation cell or not needs to be judged, and if each path point after movement is positioned in the corresponding original segmentation cell, the rest segment judgment is continuously finished. If the path points outside the corresponding original segmentation cells exist in the moved path points, the Matrix is copied, the digital coordinate position of the original segmentation cells corresponding to the path points is set to be 1, then the paths are acquired again, and the de-overlapping processing process is completed again until all the paths are processed or no path exists on the Matrix. In addition, if there is no path on Matrix, it means that the path formed by the non-overlapping horizontal and vertical line segments cannot be drawn on canvas so that the connection between two points is made.
Step6: and drawing connecting lines according to the paths after the de-overlapping.
Through the processing procedures from Step1 to Step5, each path point required for drawing the right-angle connection can be obtained, and the right-angle connection between the irregular figure of the starting point and the irregular figure of the end point can be drawn based on each path point. However, since the paths between the starting point irregular pattern and the ending point irregular pattern may be processed by the path de-overlapping algorithm, which may cause the starting point and the ending point to deviate slightly from the starting point and the ending point in the given point-to-point list, it is necessary to add the starting point and the ending point in the given point-to-point list to the drawing path when drawing each path connection line, and then draw a right angle connection line between the starting point irregular pattern and the ending point irregular pattern. A schematic drawing of a right-angle connection line between the starting irregular pattern and the ending irregular pattern after drawing is shown in fig. 7.
It should be noted that, in one possible implementation manner of the embodiment of the present invention, rule segmentation may also be performed for a plurality of rule graphs to obtain a segmentation graph. Namely, a segmentation algorithm of the rule patterns is adopted to sequentially detect a plurality of rule patterns in the initial canvas. For each rule graph in the plurality of rule graphs, detecting the rule graph, identifying the position of the rule graph in the initial canvas and the outline size of the rule graph, and determining a rectangular frame wrapping the rule graph. Therefore, based on the segmentation algorithm of the rule patterns, the positions of the rule patterns in the initial canvas and the outline sizes of the rule patterns can be identified, and the rectangular frames of the rule patterns can be determined. And then processing the plurality of rule patterns based on the processing modes from Step2 to Step6, determining path lines among the plurality of rule patterns, and drawing right-angle connecting lines among the plurality of rule patterns based on the path lines among the plurality of rule patterns.
The above embodiment shows that, for any object in the display diagram, the display diagram is segmented by taking the occupied area of the object as a whole, so as to obtain a segmentation diagram, and for any segmentation unit in the segmentation diagram, the segmentation unit is determined to be a traffic zone or an obstacle zone. And determining a path between the first object and the second object by taking the segmentation unit as a dimension, wherein the path is each segmentation unit of a segmentation unit path from the segmentation unit where the starting point of the first object is located to the segmentation unit where the end point of the second object is located. Then, each path between each object is drawn in the presentation diagram. Because the display diagram is unevenly segmented by taking the occupied area of the object as a whole, the problem that the determination efficiency of paths among the objects is low due to the fact that the display diagram is evenly segmented in the prior art can be solved. And then the path searching is carried out by taking the segmentation unit as a dimension, so that the path between the objects can be rapidly and accurately determined, and the right-angle connecting lines between the objects can be timely and accurately drawn, thereby automatically drawing the connecting lines between the objects, automatically avoiding the barrier objects when drawing based on the right-angle connecting lines, drawing the connecting lines without depending on manual given paths, and further realizing automatic and accurate drawing of the path connecting lines between the objects in the display relationship graph.
Based on the same technical concept, fig. 8 illustrates an apparatus for generating a relationship diagram according to an embodiment of the present invention, where the apparatus may perform a flow of a method for generating a relationship diagram.
As shown in fig. 8, the apparatus includes:
a segmentation unit 801, configured to segment, for any object in the display diagram, the display diagram with an occupied area of the object as a whole, to obtain a segmentation diagram;
a processing unit 802, configured to determine, for any segmentation unit in the segmentation graph, that the segmentation unit is a traffic zone or an obstacle zone; wherein, the passing area means that the segmentation unit is not occupied by any object; determining a path between the first object and the second object by taking the segmentation unit as a dimension; the path is each segmentation unit of a segmentation unit path from a segmentation unit where a starting point of the first object is located to a segmentation unit where an end point of the second object is located; the first object and the second object are objects in the display diagram; and drawing each path among the objects in the display diagram.
Optionally, the slicing unit 801 is specifically configured to:
for any object in the display diagram, determining a minimum rectangular frame of an occupied area of the object;
Dividing the display diagram according to the edges of the minimum rectangular frame;
and cutting through the minimum rectangular frame of each object to obtain the cutting graph.
Optionally, the processing unit 802 is specifically configured to:
determining a segmentation unit serving as an inflection point in any path;
converting a segmentation unit with a starting point, a segmentation unit with an inflection point and a segmentation unit with an end point into coordinate points in the display diagram;
connecting all coordinate points in a right-angle connecting mode to form a path line;
adjusting the path lines with overlapping paths in the path lines to obtain adjusted path lines;
and drawing each path line after adjustment in the display diagram.
Optionally, the processing unit 802 is specifically configured to:
if the overlapping path lines exist in the path lines, adjusting the overlapping path lines based on the de-overlapping vector until the overlapping path lines do not exist in the path lines, so as to determine the adjusted path lines; the de-overlapping vector is determined based on the size of each segmentation unit.
Optionally, the processing unit 802 is further configured to:
Determining whether a path point with a position outside a corresponding original segmentation unit exists in the path lines according to any path line in the adjusted path lines;
if the fact that the path points with the positions outside the corresponding original segmentation units exist in the path line is determined, resetting the coordinate positions of the original segmentation units corresponding to the path points, and acquiring the path line again based on the reset original segmentation units.
Optionally, the processing unit 802 is specifically configured to:
and determining a path between the first object and the second object by using the segmentation unit as a dimension through a shortest path algorithm.
Optionally, the processing unit 802 is specifically configured to:
graying treatment is carried out on the segmentation graph to obtain a first gray value of each segmentation unit in the segmentation graph;
performing binarization processing on the gray value of each segmentation unit in the segmentation graph to obtain a second gray value of each segmentation unit in the segmentation graph;
for any segmentation unit in the segmentation graph, if the second gray value of the segmentation unit is determined to be a first value, determining that the segmentation unit is a passing area; and if the second gray value of the segmentation unit is determined to be the second value, determining the segmentation unit to be an obstacle region.
Based on the same technical concept, the embodiment of the present invention further provides a computing device, as shown in fig. 9, including at least one processor 901, and a memory 902 connected to the at least one processor, where a specific connection medium between the processor 901 and the memory 902 is not limited in the embodiment of the present invention, and in fig. 9, the processor 901 and the memory 902 are connected by a bus, for example. The buses may be divided into address buses, data buses, control buses, etc.
In the embodiment of the present invention, the memory 902 stores instructions executable by the at least one processor 901, and the at least one processor 901 may execute the steps included in the method for generating a presentation relationship diagram described above by executing the instructions stored in the memory 902.
Where the processor 901 is a control center of a computing device, various interfaces and lines may be utilized to connect various portions of the computing device, through execution or execution of instructions stored in the memory 902 and invocation of data stored in the memory 902, to effect data processing. Alternatively, the processor 901 may include one or more processing units, and the processor 901 may integrate an application processor and a modem processor, wherein the application processor primarily processes an operating system, a user interface, an application program, and the like, and the modem processor primarily processes issuing instructions. It will be appreciated that the modem processor described above may not be integrated into the processor 901. In some embodiments, processor 901 and memory 902 may be implemented on the same chip, and in some embodiments they may be implemented separately on separate chips.
The processor 901 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present invention. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with an embodiment of a method of generating a presentation relationship diagram may be embodied directly in a hardware processor for execution or in a combination of hardware and software modules in a processor for execution.
The memory 902 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 902 may include at least one type of storage medium, which may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (Random Access Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory), magnetic Memory, magnetic disk, optical disk, and the like. Memory 902 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 902 of embodiments of the present invention may also be circuitry or any other device capable of performing memory functions for storing program instructions and/or data.
Based on the same technical idea, an embodiment of the present invention further provides a computer readable storage medium storing a computer program executable by a computing device, which when run on the computing device causes the computing device to perform the steps of the above-described method of generating a presentation relationship graph.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.
Claims (10)
1. A method of generating a presentation relationship graph, comprising:
for any object in the display diagram, dividing the display diagram by taking the occupied area of the object as a whole to obtain a division diagram;
determining that the segmentation unit is a passing area or an obstacle area aiming at any segmentation unit in the segmentation graph; wherein, the passing area means that the segmentation unit is not occupied by any object;
determining a path between the first object and the second object by taking the segmentation unit as a dimension; the path is each segmentation unit of a segmentation unit path from a segmentation unit where a starting point of the first object is located to a segmentation unit where an end point of the second object is located; the first object and the second object are objects in the display diagram;
and drawing each path among the objects in the display diagram.
2. The method of claim 1, wherein the segmenting the display diagram for any object in the display diagram with the occupation area of the object as a whole to obtain a segmented diagram includes:
For any object in the display diagram, determining a minimum rectangular frame of an occupied area of the object;
dividing the display diagram according to the edges of the minimum rectangular frame;
and cutting through the minimum rectangular frame of each object to obtain the cutting graph.
3. The method of claim 1, wherein drawing paths for objects in the display diagram comprises:
determining a segmentation unit serving as an inflection point in any path;
converting a segmentation unit with a starting point, a segmentation unit with an inflection point and a segmentation unit with an end point into coordinate points in the display diagram;
connecting all coordinate points in a right-angle connecting mode to form a path line;
adjusting the path lines with overlapping paths in the path lines to obtain adjusted path lines;
and drawing each path line after adjustment in the display diagram.
4. The method of claim 3, wherein the adjusting for each path line for which there is an overlap in the path lines, comprises:
if the overlapping path lines exist in the path lines, adjusting the overlapping path lines based on the de-overlapping vector until the overlapping path lines do not exist in the path lines, so as to determine the adjusted path lines; the de-overlapping vector is determined based on the size of each segmentation unit.
5. The method of claim 4, further comprising, after determining the adjusted path routes:
determining whether a path point with a position outside a corresponding original segmentation unit exists in the path lines according to any path line in the adjusted path lines;
if the fact that the path points with the positions outside the corresponding original segmentation units exist in the path line is determined, resetting the coordinate positions of the original segmentation units corresponding to the path points, and acquiring the path line again based on the reset original segmentation units.
6. The method of claim 1, wherein determining a path between the first object and the second object with the segmentation unit as a dimension comprises:
and determining a path between the first object and the second object by using the segmentation unit as a dimension through a shortest path algorithm.
7. The method according to any one of claims 1 to 6, wherein determining that the segmentation unit is a traffic zone or an obstacle zone for any segmentation unit in the segmentation map comprises:
graying treatment is carried out on the segmentation graph to obtain a first gray value of each segmentation unit in the segmentation graph;
Performing binarization processing on the gray value of each segmentation unit in the segmentation graph to obtain a second gray value of each segmentation unit in the segmentation graph;
for any segmentation unit in the segmentation graph, if the second gray value of the segmentation unit is determined to be a first value, determining that the segmentation unit is a passing area; and if the second gray value of the segmentation unit is determined to be the second value, determining the segmentation unit to be an obstacle region.
8. An apparatus for generating a presentation relationship graph, comprising:
the segmentation unit is used for segmenting any object in the display diagram by taking the occupied area of the object as a whole to obtain a segmentation diagram;
the processing unit is used for determining that the segmentation unit is a passing area or an obstacle area aiming at any segmentation unit in the segmentation graph; wherein, the passing area means that the segmentation unit is not occupied by any object; determining a path between the first object and the second object by taking the segmentation unit as a dimension; the path is each segmentation unit of a segmentation unit path from a segmentation unit where a starting point of the first object is located to a segmentation unit where an end point of the second object is located; the first object and the second object are objects in the display diagram; and drawing each path among the objects in the display diagram.
9. A computing device comprising at least one processor and at least one memory, wherein the memory stores a computer program that, when executed by the processor, causes the processor to perform the method of any of claims 1 to 7.
10. A computer readable storage medium, characterized in that it stores a computer program executable by a computing device, which when run on the computing device, causes the computing device to perform the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110642482.0A CN113448667B (en) | 2021-06-09 | 2021-06-09 | Method and device for generating display relationship diagram |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110642482.0A CN113448667B (en) | 2021-06-09 | 2021-06-09 | Method and device for generating display relationship diagram |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113448667A CN113448667A (en) | 2021-09-28 |
| CN113448667B true CN113448667B (en) | 2023-08-01 |
Family
ID=77811062
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110642482.0A Active CN113448667B (en) | 2021-06-09 | 2021-06-09 | Method and device for generating display relationship diagram |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113448667B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006030809A1 (en) * | 2004-09-17 | 2006-03-23 | Catena Corporation | Software generating method |
| CN105243018A (en) * | 2015-10-24 | 2016-01-13 | 北京航空航天大学 | Object-oriented class test data generation method |
| CN106802947A (en) * | 2017-01-13 | 2017-06-06 | 中国工商银行股份有限公司 | The data handling system and method for entity relationship diagram |
| CN107357846A (en) * | 2017-06-26 | 2017-11-17 | 北京金堤科技有限公司 | The methods of exhibiting and device of relation map |
| CN108635853A (en) * | 2018-03-23 | 2018-10-12 | 腾讯科技（深圳）有限公司 | The control method and device of object, storage medium, electronic device |
| CN110941683A (en) * | 2019-11-05 | 2020-03-31 | 北京字节跳动网络技术有限公司 | Method, device, medium and electronic equipment for acquiring object attribute information in space |
| CN111460047A (en) * | 2020-03-09 | 2020-07-28 | 平安科技（深圳）有限公司 | Method, device and equipment for constructing characteristics based on entity relationship and storage medium |
| CN112672857A (en) * | 2019-01-15 | 2021-04-16 | 欧姆龙株式会社 | Route generation device, route generation method, and route generation program |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10558626B2 (en) * | 2016-11-07 | 2020-02-11 | Salesforce.Com, Inc. | Merging and unmerging objects using graphical representation |
| EP3816758B1 (en) * | 2019-10-17 | 2024-01-17 | Nokia Solutions and Networks Oy | Grid-based movement control |
-
2021
- 2021-06-09 CN CN202110642482.0A patent/CN113448667B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006030809A1 (en) * | 2004-09-17 | 2006-03-23 | Catena Corporation | Software generating method |
| CN105243018A (en) * | 2015-10-24 | 2016-01-13 | 北京航空航天大学 | Object-oriented class test data generation method |
| CN106802947A (en) * | 2017-01-13 | 2017-06-06 | 中国工商银行股份有限公司 | The data handling system and method for entity relationship diagram |
| CN107357846A (en) * | 2017-06-26 | 2017-11-17 | 北京金堤科技有限公司 | The methods of exhibiting and device of relation map |
| CN108635853A (en) * | 2018-03-23 | 2018-10-12 | 腾讯科技（深圳）有限公司 | The control method and device of object, storage medium, electronic device |
| CN112672857A (en) * | 2019-01-15 | 2021-04-16 | 欧姆龙株式会社 | Route generation device, route generation method, and route generation program |
| CN110941683A (en) * | 2019-11-05 | 2020-03-31 | 北京字节跳动网络技术有限公司 | Method, device, medium and electronic equipment for acquiring object attribute information in space |
| CN111460047A (en) * | 2020-03-09 | 2020-07-28 | 平安科技（深圳）有限公司 | Method, device and equipment for constructing characteristics based on entity relationship and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113448667A (en) | 2021-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3620981B1 (en) | Object detection method, device, apparatus and computer-readable storage medium | |
| CN111210429B (en) | Point cloud data partitioning method and device and obstacle detection method and device | |
| US20150109290A1 (en) | Device and method for removing noise points in point clouds | |
| CN111860502A (en) | Picture table identification method and device, electronic equipment and storage medium | |
| CN111582054A (en) | Point cloud data processing method and device and obstacle detection method and device | |
| CN104809684A (en) | Graphic processing method, device and system | |
| CN111915657A (en) | Point cloud registration method and device, electronic equipment and storage medium | |
| CN111353580A (en) | Training method of target detection network, electronic device and storage medium | |
| CN114529773A (en) | Form identification method, system, terminal and medium based on structural unit | |
| CN110020598B (en) | Method and device for detecting foreign matters on telegraph pole based on deep learning | |
| CN108280135B (en) | Method and device for realizing visualization of data structure and electronic equipment | |
| CN112505652B (en) | Target detection method, device and storage medium | |
| CN113448667B (en) | Method and device for generating display relationship diagram | |
| CN113763412A (en) | Image processing method and device, electronic equipment and computer readable storage medium | |
| CN108564637B (en) | Geometric model arrangement method and device | |
| CN105447839A (en) | Rectangular frame merging method and system | |
| CN116309628A (en) | Lane line recognition method and device, electronic equipment and computer readable storage medium | |
| CN113516765B (en) | Map management method, map management device and intelligent equipment | |
| US11281935B2 (en) | 3D object detection from calibrated 2D images | |
| CN110717969A (en) | Shadow generation method and device | |
| CN114066958A (en) | Method and device for predicting depth information of target, electronic device and storage medium | |
| CN113112488A (en) | Road center line extraction method and device, storage medium and terminal equipment | |
| CN115170580A (en) | Plate processing control method and device, computer equipment and storage medium | |
| CN112037328A (en) | Method, device, equipment and storage medium for generating road edges in map | |
| CN111783180A (en) | Drawing splitting method and related 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 |