CN111783180B - Drawing splitting method and related device - Google Patents
Drawing splitting method and related device Download PDFInfo
- Publication number
- CN111783180B CN111783180B CN202010562501.4A CN202010562501A CN111783180B CN 111783180 B CN111783180 B CN 111783180B CN 202010562501 A CN202010562501 A CN 202010562501A CN 111783180 B CN111783180 B CN 111783180B
- Authority
- CN
- China
- Prior art keywords
- primitive
- primitives
- reference position
- position range
- groups
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Geometry (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Processing Or Creating Images (AREA)
Abstract
The embodiment of the application provides a drawing splitting method and a related device, wherein the method comprises the following steps: acquiring primitive information in the drawing, wherein the primitive information comprises the position of each primitive in a plurality of primitives in the drawing; determining the reference position range of each primitive according to the coordinates of each primitive, and dividing the primitives into at least one primitive set according to the relevance of the reference position ranges of the primitives; and splitting the drawing into at least one subgraph corresponding to the at least one primitive set. Therefore, the drawing splitting method and the related device can rapidly identify and split the drawing according to the relevance of each primitive in the drawing, are high in execution speed and efficiency, and can be used for performing model identification, image identification and other applications on the split sub-image more easily and accurately.
Description
Technical Field
The application relates to the field of architectural design, in particular to a drawing splitting method and a related device.
Background
DWG (DraWiNG) is a proprietary file format used by computer aided design software AutoCAD and AutoCAD-based software to store design data. In a DWG document, there are often multiple types of drawings, for example, there are sub-drawings such as a plan view, an elevation view, and a thumbnail at the same time. The drawing splitting is a process of dividing a drawing into a plurality of areas with unique properties. However, the current drawing splitting technology can only split the drawing into each drawing frame, and in practical application, the result is often inaccurate when the split drawings are subjected to image recognition or model recognition.
Disclosure of Invention
The embodiment of the application provides a drawing splitting method and a related device, aiming at rapidly splitting the contents of a drawing.
In a first aspect, an embodiment of the present application provides a drawing splitting method, where the method includes:
acquiring primitive information in the drawing, wherein the primitive information comprises the position of each primitive in a plurality of primitives in the drawing;
determining a reference position range of each primitive according to the coordinates of each primitive, wherein the reference position range comprises the position of each primitive;
dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives, wherein each primitive set comprises at least one primitive, the reference position range of any one primitive in the at least one primitive set is intersected with the reference position range of at least one other primitive in the primitive set, the target position range formed by the primitives in any two primitive sets in the at least one primitive set is not intersected, and the target position range refers to the union of the reference position ranges of all the primitives in the primitive set;
and splitting the drawing into at least one subgraph corresponding to the at least one primitive set.
In a second aspect, an embodiment of the present application provides a drawing splitting apparatus, which includes a processing unit and a communication unit, wherein,
the processing unit is used for acquiring primitive information in the drawing through the communication unit, wherein the primitive information comprises the position of each primitive in a plurality of primitives in the drawing; and a reference position range for determining each primitive according to the coordinates of each primitive, wherein the reference position range comprises the position of each primitive; the system comprises a plurality of primitives, a plurality of storage units and a processing unit, wherein the primitives are divided into at least one primitive set according to the relevance of the reference position ranges of the primitives, each primitive set comprises at least one primitive, the reference position range of any primitive in the at least one primitive has an intersection with the reference position range of at least one other primitive in the primitive set, the target position range formed by the primitives in any two primitive sets in the at least one primitive set does not have an intersection, and the target position range refers to the union of the reference position ranges of all the primitives in the primitive set; and the drawing is split into at least one subgraph corresponding to the at least one primitive set.
In a third aspect, an embodiment of the present application provides an electronic device, including a processor, a memory, a communication interface, and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, and the programs include instructions for executing steps in any method in the first aspect of the embodiment of the present application.
In a fourth aspect, the present application provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program for electronic data exchange, where the computer program makes a computer perform part or all of the steps described in any one of the methods of the first aspect of the present application.
In a fifth aspect, embodiments of the present application provide a computer program product, where the computer program product includes a non-transitory computer-readable storage medium storing a computer program, where the computer program is operable to cause a computer to perform some or all of the steps as described in the first aspect of the embodiments of the present application. The computer program product may be a software installation package.
It can be seen that, in the embodiment of the present application, primitive information in a drawing is first obtained, then a reference position range of each primitive is determined according to coordinates of each primitive, then a plurality of primitives are divided into at least one primitive set according to relevance of the reference position ranges of the plurality of primitives, and finally the paper is divided into at least one sub-graph corresponding to the at least one primitive set. Therefore, the drawing splitting method and the related device can rapidly identify and split the drawing according to the relevance of each primitive in the drawing, are high in execution speed and efficiency, and can be used for performing model identification, image identification and other applications on the split sub-image more easily and accurately.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a schematic diagram of a drawing splitting system provided in an embodiment of the present application;
fig. 2a is a schematic flowchart of a drawing splitting method according to an embodiment of the present application;
fig. 2b is a schematic diagram of an association relationship provided in the embodiment of the present application;
FIG. 2c is a schematic diagram illustrating a drawing splitting result according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application;
fig. 4 is a block diagram of functional units of a drawing splitting apparatus according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," and the like in the description and claims of the present application and in the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
At present, most of DWG drawing blocks are processed manually, drawing splitting is carried out automatically only by a clustering analysis method, but the clustering analysis needs multiple traversal judgment, so that the efficiency is low.
In view of the foregoing problems, embodiments of the present application provide a method and a related apparatus for splitting a drawing, which are described in detail below with reference to the accompanying drawings.
As shown in fig. 1, fig. 1 is a schematic diagram of a drawing splitting system provided in an embodiment of the present application, where the drawing splitting system includes a drawing splitting device, and the drawing splitting device can identify a complete drawing or a part of a drawing according to a user requirement, and split the drawing into multiple sub-drawings, where relative positions of the sub-drawings on the drawing are irrelevant.
Referring to fig. 2a, fig. 2a is a schematic flow chart of a drawing splitting method according to an embodiment of the present application, and as shown in the drawing splitting method, the drawing splitting method specifically includes the following steps.
S201, obtaining primitive information in the drawing, wherein the primitive information comprises the position of each primitive in a plurality of primitives in the drawing.
The graphic elements refer to graphic data in a drawing, and the graphic elements are visible entities and are minimum graphic elements which can be identified in the drawing. For example, in a DWG file, the primitive is the smallest graphic element which can be identified by AutoCAD, and includes a straight line, a circular arc, a label and the like. The primitive information is information capable of accurately locking the position of the primitive in the drawing, and may be geometric coordinate information, and if the drawing further includes an axis network line, the position information may also be an axis network number.
S202, determining a reference position range of each primitive according to the coordinates of each primitive, wherein the reference position range comprises the position of each primitive.
The reference position range may be a range occupied by the primitive on the drawing, the reference position range includes the whole primitive, and the reference position range may be a rectangular range, or may be a circular or fan-shaped range, as long as the reference position range can completely reflect the position of the corresponding primitive in the drawing and completely contains the primitive. The reference position range can be determined according to the coordinates of the primitive, or the axis network number of the primitive can be used as the coordinates of the primitive, so that the reference position range is determined. Of course, the reference position range of each primitive on the drawing can also be determined by numbering or coding the drawing areas and the primitives.
And S203, dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives, wherein each primitive set comprises at least one primitive, the reference position range of any one primitive in the at least one primitive set is intersected with the reference position range of at least one other primitive in the primitive set, the target position range formed by the primitives in any two primitive sets in the at least one primitive set is not intersected, and the target position range refers to the union of the reference position ranges of all the primitives in the primitive set.
Wherein the relevance of the reference position ranges of the plurality of primitives comprises whether the reference position ranges of the plurality of primitives are related or unrelated. As shown in fig. 2b, fig. 2b is a schematic diagram of an association relationship provided in the embodiment of the present application, where irrelevant means that there is no intersection between reference position ranges of any two primitives, and reference may be made to fig. 1, 2, and 3 in fig. 2 b. Whereas, related means that there is an intersection between the reference position range of a certain primitive and any other primitive, such as the 4 th and 5 th graphs in fig. 2b, in which the reference position ranges of two primitives are intersected, so that the two primitives whose reference position ranges are intersected are related. As shown in the 6 th diagram in fig. 2b, the reference position ranges of the two primitives in the diagram coincide, and therefore the correlation between the two primitives is also relevant. As in the 7 th diagram of fig. 2b, the reference position ranges of two primitives in this diagram are such that the reference position range of one primitive completely encompasses the reference position range of the other primitive, and thus the two primitives are also related.
The method comprises the steps of obtaining a reference position range, wherein the reference position range is used for correlating primitives in a drawing, wherein the primitives in the drawing are divided into a plurality of primitive sets according to the relevance of the reference position range, and the relevance of the primitives in each primitive set is related to at least one primitive in the set. For example, there are 5 primitives in a set of primitives, and the association of these 5 primitives may be that the first primitive is related to the 2 nd and 4 th primitives, the 2 nd primitive is related to only the 1 st primitive, and the 3 rd primitive is related to both the 4 th and 5 th primitives in the set of primitives. Of course, these relationships, whether intersecting, coinciding, or contained, may be collectively referred to as an intersection between the reference position ranges of the two primitives. In the multiple primitive sets, all the primitives in each single primitive set have no relation with all the primitives in other primitive sets, and all the primitives in a certain primitive set are only related to the primitives in the primitive set and have no relation with other primitives in a drawing range needing splitting. And the union of the reference position ranges of all the primitives in each primitive set is the target position range of the primitive set, that is, the target position range includes the reference position ranges of all the primitives in the set.
S204, splitting the drawing into at least one sub-graph corresponding to the at least one primitive set.
When the paper is finally divided into at least one sub-graph, each primitive set can be correspondingly divided into a plurality of sub-graphs, or a plurality of primitive sets can be combined and then divided into a primitive set according to user requirements and/or a predetermined rule and/or a divided drawing type. When the subgraph is divided, the target position range of the primitive set can be positioned in the drawing, and the division is performed according to the positioning position and the target position range.
It can be seen that, in the embodiment of the present application, primitive information in a drawing is first obtained, then a reference position range of each primitive is determined according to coordinates of each primitive, then a plurality of primitives are divided into at least one primitive set according to relevance of the reference position ranges of the plurality of primitives, and finally the drawing is split into at least one sub-graph corresponding to the at least one primitive set. Therefore, the drawing splitting method and the related device can rapidly identify and split the drawing according to the relevance of each primitive in the drawing, are high in execution speed and efficiency, and can be used for performing model identification, image identification and other applications on the split sub-image more easily and accurately.
In one possible example, the dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives includes: determining relevance of the reference position range of each primitive in the plurality of primitives and reference position ranges of other primitives, wherein the other primitives are all primitives except for each primitive in the plurality of primitives, and the relevance comprises existence of intersection and nonexistence of intersection; and dividing a plurality of primitives with the relevance of intersection into the same primitive set, and independently dividing the rest primitives into a single primitive set.
The primitive division mode may be to directly determine whether there is an intersection between each primitive and the reference position range of all primitives in the drawing range to be split, then divide multiple primitives with the intersection into one primitive set, and separately divide other primitives without the intersection into multiple primitive sets. Thus, the target position range of each primitive set is not intersected, and the reference position range of the primitive in each primitive set is at least intersected with the reference position range of at least one other primitive except the primitive.
Therefore, in the example, the incidence relation of the reference position ranges of all the primitives is directly obtained, and then the multiple primitive sets are uniformly divided according to the incidence relation, so that all the primitives can be quickly and accurately divided, and the drawing can be conveniently split according to the primitive sets.
In one possible example, the dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives includes: for the plurality of primitives, performing the following operations:
detecting whether the currently processed primitive is the last unprocessed primitive in the multiple primitives;
if not, detecting whether the currently processed primitive is the first primitive or not;
if so, distributing a primitive set for the currently processed primitive, and determining the target position range of the primitive set as the reference position range of the primitive; updating the currently processed primitive as a next unprocessed primitive;
if not, performing relevance comparison with the target position range of the distributed at least one primitive set; if an intersection exists with the target position range of the distributed primitive set, adding the currently processed primitive to the primitive set with the intersection, and merging the reference position range of the currently processed primitive into the target position range of the primitive set to update the position range of the primitive set; updating the primitive processed currently to be the next unprocessed primitive; if no intersection exists with the target position range of any one of the distributed primitive sets, classifying one primitive set for the primitive currently processed, and determining the target position range of the primitive set as the reference position range of the primitive; updating the primitive processed currently to be the next unprocessed primitive;
if yes, performing relevance comparison with a target position range of the distributed at least one primitive set; if an intersection exists with the target position range of the distributed primitive set, adding the currently processed primitive to the primitive set with the intersection, and merging the reference position range of the currently processed primitive into the target position range of the primitive set to update the position range of the primitive set; if no intersection exists with the target position range of any one distributed primitive set, classifying a primitive set for the primitive currently processed, and determining the target position range of the primitive set as the reference position range of the primitive.
When the primitive set is divided according to the reference position range of the primitives, the association between the primitives can be determined by adopting the edge, and the set is divided by adopting the edge. Firstly, determining whether a currently processed primitive is the last unprocessed primitive or not, if the currently processed primitive is not the last unprocessed primitive, determining whether the currently processed primitive is the first processed primitive again, and if the currently processed primitive is the first processed primitive, directly dividing a primitive set for the primitive and then processing the next primitive.
If the primitive processed at present is not the primitive processed at the first time, determining the relevance between the reference position range of the primitive and the target position ranges of all the primitive sets existing at present, and if the reference position range of the primitive processed at present has an intersection with the target position range of one of all the primitive sets at present, dividing the primitive into the primitive set; if the reference position range of the primitive processed currently has intersection with the target position ranges of the multiple primitive sets in all the primitive sets currently, merging the primitive and the multiple primitive sets together to divide the primitive into a new primitive set; and if the primitive processed currently does not intersect with any primitive set in all the primitive sets currently, the primitive is divided into a new primitive set independently. And after the primitive set of the currently processed primitive is divided, processing the next primitive.
If the currently processed primitive is the last unprocessed primitive, determining the relevance of the reference position range of the primitive and the target position range of all currently existing primitive sets, and if the reference position range of the currently processed primitive and the target position range of one of all currently existing primitive sets have an intersection, dividing the primitive into the primitive set; if the reference position range of the primitive processed currently has intersection with the target position ranges of the multiple primitive sets in all the primitive sets currently, merging the primitive and the multiple primitive sets together to divide the primitive into a new primitive set; and if the primitive processed currently does not intersect with any primitive set in all the primitive sets currently, the primitive is divided into a new primitive set independently. And after the last primitive is processed, dividing the primitive set of all the primitives in the drawing.
Therefore, in the example, a mode of merging the related primitive ranges in a single cycle is adopted, so that the irrelevant primitives are segmented, all the primitives can be rapidly and accurately segmented, and the drawing can be conveniently split according to the primitive set.
In one possible example, the dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives includes: determining the track of each primitive according to the coordinates of each primitive; dividing the primitives with intersection points of the tracks into a primitive group, wherein the track of the primitive contained in each primitive group has an intersection point with the track of at least one other primitive in the primitive group, the track of the primitive contained in each primitive group does not have an intersection point with the track of any primitive contained in other primitive groups, and the reference position range of the primitive group is the union of the reference position ranges of all the primitives contained in the primitive group; determining the relevance of the reference position range of each of the multiple primitive groups and the reference position range of other primitive groups, wherein the other primitive groups are all the multiple primitive groups except the each primitive group, and the relevance comprises the existence of intersection and the nonexistence of intersection; and dividing a plurality of primitive groups with the relevance of intersection into the same primitive set, and respectively and independently dividing the rest primitive groups into a single primitive set.
When the primitive set in the drawing is divided, a trajectory of each primitive in the drawing range may be determined according to coordinates of each primitive, where the trajectory refers to a position where the primitive passes on the drawing, and may also be a connection line of all coordinates included in the primitive. According to the trajectory, whether an intersection point exists between the trajectories of each primitive can be simply judged, that is, whether each primitive intersects or not can be simply understood as whether coordinates are overlapped, and if one coordinate in all coordinates contained in one primitive is the same as one coordinate in all coordinates contained in any one primitive in other primitives, the trajectories of the two primitives have an intersection point.
When the primitive set is divided, primitive groups can be divided firstly, primitives with intersection points among primitive tracks are divided into one primitive group, and the rest primitives are divided into a single primitive group independently. Thus, the trajectory of the primitive present in each primitive group has at least an intersection with the trajectory of at least one other primitive of the primitive group. And then, dividing the primitive groups into primitive sets according to the relevance of the reference position range corresponding to each primitive group, dividing a plurality of primitive groups with the relevance of intersection into the same primitive set, and respectively and independently dividing the rest primitive groups into a single primitive set. The reference position range of each primitive group is the union of the reference position ranges of all primitives contained in that primitive group. Therefore, whether the primitive group or the single primitive in each primitive set at least has intersection with other primitive groups or reference position ranges of the primitives in the primitive set, and does not have intersection with the primitive groups or the reference position ranges of the primitives in other primitive sets.
Therefore, in the example, the primitives with the intersection points are divided firstly, and then all the primitives are divided into the corresponding primitive sets according to the reference position range, so that all the primitives can be divided quickly and accurately, and the drawing can be conveniently split according to the primitive sets.
In one possible example, the splitting the drawing into at least one sub-graph corresponding to the at least one primitive set includes: determining boundary coordinates of the target position range of each primitive set, wherein the boundary coordinates refer to the maximum abscissa, the maximum ordinate, the minimum abscissa and the minimum ordinate of all primitives contained in the primitive set; determining the distance between each primitive set and other primitive sets in the multiple primitive sets according to the boundary coordinates, wherein the other primitive sets are all the primitive sets except each primitive set in the multiple primitive sets; combining the multiple primitive sets with the distances smaller than a preset threshold value into a final primitive set, wherein the residual primitive sets are respectively final primitive sets; and splitting the drawing into at least one sub-graph corresponding to the at least one final primitive set.
When the drawing is split according to the previously divided primitive sets, the boundary coordinates of each primitive set can be determined first, wherein the boundary coordinates are the maximum abscissa, the maximum ordinate, the minimum abscissa and the minimum ordinate of the primitives included in the primitive set, that is, the area divided according to the boundary coordinates can completely cover the reference position range of all the primitives in the corresponding primitive set. After the boundary coordinates of each primitive set are determined, the drawing can be initially divided according to the boundary coordinates, then each initially divided sub-graph is circled on the drawing, then the distance between the boundary of each initially divided sub-graph and the adjacent boundary of other initially divided sub-graphs is determined, if the distance between the two adjacent boundaries of the two initially divided sub-graphs is smaller than a preset threshold value, the primitive sets corresponding to the two initially divided sub-graphs are merged into a final primitive set, and then the drawing is split according to the final primitive set.
Therefore, in this example, when the drawing is split according to the primitive sets, the distance between the primitive sets can be determined first, and then the drawing is split, so that the accuracy of the divided sub-images can be improved, and the accuracy of application such as model recognition or image recognition on the sub-images can be improved.
In one possible example, the reference position range of each primitive comprises: and the rectangular range is formed by the minimum abscissa, the minimum ordinate, the maximum abscissa and the maximum ordinate of each primitive together.
The reference position range is identified according to geometric coordinates on a drawing, each primitive has a plurality of coordinates on the drawing, the largest rectangular range formed by the coordinates is the reference position range of the primitive, or the rectangular range formed by the minimum abscissa, the minimum ordinate, the maximum abscissa and the maximum ordinate in the coordinates is the reference position range of the primitive.
It can be seen that, in this example, the reference position range is determined according to the coordinates of the primitive, and this reference position range can completely include the primitive, and such determination is simple and accurate.
In one possible example, the primitives are circular arcs, and the reference position range for each primitive comprises: and the fan-shaped range is formed by the start point coordinate of the circular arc, the end point coordinate of the circular arc and the center coordinate of the circular arc.
The reference position range is identified according to geometric coordinates on a drawing, each primitive has a plurality of coordinates on the drawing, when the type of the primitive is arc, the primitive corresponds to a circular coordinate, a starting point coordinate and an end point coordinate, and a sector range surrounded by the three coordinates is the reference position range of the primitive. When the primitive corresponds to a plurality of circle center coordinates, the reference position range of the primitive can be determined according to the circle center coordinates, at least one primitive radius information, the start point coordinates and the end point coordinates.
It can be seen that, in this example, the reference position range is determined according to the coordinates of the primitive, and this reference position range can completely include the primitive, and such determination is simple and accurate.
The following is a detailed description with reference to specific examples.
As shown in fig. 2c, fig. 2c is a drawing splitting result schematic diagram provided in the embodiment of the present application, the drawing to be split is a drawing of a whole mechanical structure, and after the method is used, four different types of subgraphs in the drawing can be clearly and directly divided to obtain four subgraphs, it can be seen that there are 4 blocks in the drawing, and there are N primitives in total, and the splitting of the drawing can be realized only by executing 4 × N primitive aggregation determining steps under the limit condition, which is fast in execution speed and high in efficiency.
Referring to fig. 3, in accordance with the embodiment shown in fig. 2a, fig. 3 is a schematic structural diagram of an electronic device 300 according to an embodiment of the present application, and as shown in the figure, the electronic device 300 includes an application processor 310, a memory 320, a communication interface 330, and one or more programs 321, where the one or more programs 321 are stored in the memory 320 and configured to be executed by the application processor 310, and the one or more programs 321 include instructions for performing any step of the method embodiment.
In one possible example, the program 321 includes instructions for performing the following steps: acquiring primitive information in the drawing, wherein the primitive information comprises the position of each primitive in a plurality of primitives in the drawing; determining a reference position range of each primitive according to the coordinates of each primitive, wherein the reference position range comprises the position of each primitive; dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives, wherein each primitive set comprises at least one primitive, the reference position range of any one primitive in the at least one primitive set is intersected with the reference position range of at least one other primitive in the primitive set, the target position range formed by the primitives in any two primitive sets in the at least one primitive set is not intersected, and the target position range refers to the union of the reference position ranges of all the primitives in the primitive set; and splitting the drawing into at least one subgraph corresponding to the at least one primitive set.
In one possible example, in terms of the dividing the multiple primitives into at least one primitive set according to the relevance of the reference position ranges of the multiple primitives, the instructions in the program 321 are specifically configured to perform the following operations: determining relevance of the reference position range of each primitive in the plurality of primitives and reference position ranges of other primitives, wherein the other primitives are all primitives except for each primitive in the plurality of primitives, and the relevance comprises existence of intersection and nonexistence of intersection; and dividing a plurality of primitives with the relevance of intersection into the same primitive set, and independently dividing the rest primitives into a single primitive set.
In one possible example, in terms of the dividing the multiple primitives into at least one primitive set according to the relevance of the reference position ranges of the multiple primitives, the instructions in the program 321 are specifically configured to perform the following operations: detecting whether the currently processed primitive is the last unprocessed primitive in the multiple primitives;
if not, detecting whether the primitive processed currently is the first primitive;
if so, distributing a primitive set for the currently processed primitive, and determining the target position range of the primitive set as the reference position range of the primitive; updating the primitive processed currently to be the next unprocessed primitive;
if not, performing relevance comparison with the target position range of the distributed at least one primitive set; if an intersection exists with the target position range of the distributed primitive set, adding the currently processed primitive to the primitive set with the intersection, and merging the reference position range of the currently processed primitive into the target position range of the primitive set to update the position range of the primitive set; updating the currently processed primitive as a next unprocessed primitive; if no intersection exists with the target position range of any one of the distributed primitive sets, classifying one primitive set for the primitive currently processed, and determining the target position range of the primitive set as the reference position range of the primitive; updating the primitive processed currently to be the next unprocessed primitive;
if yes, performing relevance comparison with the target position range of the distributed at least one primitive set; if an intersection exists with the target position range of the distributed primitive set, adding the currently processed primitive to the primitive set with the intersection, and merging the reference position range of the currently processed primitive into the target position range of the primitive set to update the position range of the primitive set; if no intersection exists with the target position range of any one of the distributed primitive sets, classifying one primitive set for the primitive currently processed, and determining the target position range of the primitive set as the reference position range of the primitive.
In one possible example, in terms of the dividing the multiple primitives into at least one primitive set according to the relevance of the reference position ranges of the multiple primitives, the instructions in the program 321 are specifically configured to perform the following operations: determining the track of each primitive according to the coordinates of each primitive; dividing the primitives with intersection points on the tracks into a primitive group, and independently dividing the remaining primitives into a single primitive group, wherein the track of the primitive contained in each primitive group has an intersection point with the track of at least one other primitive in the primitive group, the track of the primitive contained in each primitive group has no intersection point with the track of any one primitive contained in other primitive groups, and the reference position range of the primitive group is the union of the reference position ranges of all the primitives contained in the primitive group; determining the relevance of the reference position range of each of the multiple primitive groups and the reference position range of other primitive groups, wherein the other primitive groups are all the multiple primitive groups except the each primitive group, and the relevance comprises the existence of intersection and the nonexistence of intersection; and dividing a plurality of primitive groups with the relevance of intersection into the same primitive set, and respectively and independently dividing the rest primitive groups into a single primitive set.
In one possible example, in terms of splitting the drawing into at least one sub-graph corresponding to the at least one primitive set, the instructions in the program 321 are specifically configured to perform the following operations: determining boundary coordinates of the target position range of each primitive set, wherein the boundary coordinates refer to the maximum abscissa, the maximum ordinate, the minimum abscissa and the minimum ordinate of all primitives contained in the primitive set; determining the distance between each primitive set and other primitive sets in the multiple primitive sets according to the boundary coordinates, wherein the other primitive sets are all the primitive sets except each primitive set in the multiple primitive sets; combining the multiple primitive sets with the distances smaller than a preset threshold value into a final primitive set, wherein the residual primitive sets are respectively final primitive sets; and splitting the drawing into at least one sub-graph corresponding to the at least one final primitive set.
In one possible example, the reference position range of each primitive comprises: and the rectangular range is formed by the minimum abscissa, the minimum ordinate, the maximum abscissa and the maximum ordinate of each graphic element.
In one possible example, the primitives are circular arcs, and the reference position range of each primitive comprises: and the sector range is formed by the start point coordinate of the circular arc, the end point coordinate of the circular arc and the center coordinate of the circular arc.
The above description has introduced the solution of the embodiment of the present application mainly from the perspective of the method-side implementation process. It is understood that the electronic device comprises corresponding hardware structures and/or software modules for performing the respective functions in order to realize the above-mentioned functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments provided herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware 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 application.
In the embodiment of the present application, the electronic device may be divided into the functional units according to the method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit may be implemented in the form of hardware, or may also be implemented in the form of a software functional unit. It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
Fig. 4 is a block diagram of functional units of a drawing splitting apparatus according to an embodiment of the present application, where the drawing splitting apparatus 400 includes a processing unit 401 and a communication unit 402, where,
the processing unit 401 is configured to obtain, through the communication unit 402, primitive information in the drawing, where the primitive information includes a position of each primitive in the drawing; and a reference position range for determining each primitive according to the coordinates of each primitive, wherein the reference position range comprises the position of each primitive; the system comprises a plurality of primitives, a plurality of storage units and a processing unit, wherein the primitives are divided into at least one primitive set according to the relevance of the reference position ranges of the primitives, each primitive set comprises at least one primitive, the reference position range of any primitive in the at least one primitive has an intersection with the reference position range of at least one other primitive in the primitive set, the target position range formed by the primitives in any two primitive sets in the at least one primitive set does not have an intersection, and the target position range refers to the union of the reference position ranges of all the primitives in the primitive set; and the drawing is split into at least one subgraph corresponding to the at least one primitive set.
In a possible example, in terms of dividing the multiple primitives into at least one primitive set according to the relevance of the reference position ranges of the multiple primitives, the processing unit 401 is specifically configured to determine the relevance of the reference position range of each primitive in the multiple primitives and the reference position ranges of other primitives, where the other primitives are all primitives except for the primitive in the multiple primitives, and the relevance includes the presence of intersection and the absence of intersection; and dividing a plurality of primitives with the relevance of intersection into the same primitive set, and independently dividing the rest primitives into a single primitive set.
In a possible example, in terms of dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives, the processing unit 401 is specifically configured to detect whether a currently processed primitive is a last unprocessed primitive in the plurality of primitives;
if not, detecting whether the currently processed primitive is the first primitive or not;
if so, distributing a primitive set for the currently processed primitive, and determining the target position range of the primitive set as the reference position range of the primitive; updating the primitive processed currently to be the next unprocessed primitive;
if not, performing relevance comparison with the target position range of the distributed at least one primitive set; if an intersection exists with the target position range of the distributed primitive set, adding the currently processed primitive to the primitive set with the intersection, and merging the reference position range of the currently processed primitive into the target position range of the primitive set to update the position range of the primitive set; updating the primitive processed currently to be the next unprocessed primitive; if no intersection exists with the target position range of any one of the distributed primitive sets, classifying one primitive set for the primitive currently processed, and determining the target position range of the primitive set as the reference position range of the primitive; updating the primitive processed currently to be the next unprocessed primitive;
if yes, performing relevance comparison with a target position range of the distributed at least one primitive set; if an intersection exists with the target position range of one distributed primitive set, adding the currently processed primitive to the primitive set with the intersection, and merging the reference position range of the currently processed primitive into the target position range of the primitive set to update the position range of the primitive set; if no intersection exists with the target position range of any one of the distributed primitive sets, classifying one primitive set for the primitive currently processed, and determining the target position range of the primitive set as the reference position range of the primitive.
In a possible example, in terms of dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives, the processing unit 401 is specifically configured to determine the trajectory of each primitive according to the coordinates of each primitive; dividing the primitives with intersection points on the tracks into a primitive group, and independently dividing the rest primitives into a single primitive group respectively, wherein the track of the primitive contained in each primitive group has an intersection point with the track of at least one other primitive in the primitive group, the track of the primitive contained in each primitive group has no intersection point with the track of any primitive contained in other primitive groups, and the reference position range of the primitive group is the union of the reference position ranges of all the primitives contained in the primitive group; determining the relevance of the reference position range of each of the multiple primitive groups and the reference position range of other primitive groups, wherein the other primitive groups are all the multiple primitive groups except the each primitive group, and the relevance comprises the existence of intersection and the nonexistence of intersection; and dividing a plurality of primitive groups with the relevance of intersection into the same primitive set, and respectively and independently dividing the rest primitive groups into a single primitive set.
In a possible example, in terms of the splitting of the drawing into at least one sub-graph corresponding to the at least one primitive set, the processing unit 401 is specifically configured to determine boundary coordinates of the target position range of each primitive set, where the boundary coordinates refer to a maximum abscissa, a maximum ordinate, a minimum abscissa, and a minimum ordinate of all primitives included in the primitive set; determining the distance between each primitive set and other primitive sets in a plurality of primitive sets according to the boundary coordinates, wherein the other primitive sets are all the primitive sets except each primitive set in the plurality of primitive sets; combining the multiple primitive sets with the distances smaller than a preset threshold value into a final primitive set, wherein the residual primitive sets are respectively final primitive sets; and splitting the drawing into at least one sub-graph corresponding to the at least one final primitive set.
In one possible example, the reference position range of each primitive includes: and the rectangular range is formed by the minimum abscissa, the minimum ordinate, the maximum abscissa and the maximum ordinate of each graphic element.
In one possible example, the primitives are circular arcs, and the reference position range of each primitive includes: and the fan-shaped range is formed by the start point coordinate of the circular arc, the end point coordinate of the circular arc and the center coordinate of the circular arc.
The camera activation control apparatus 400 may further include a storage unit 403 for storing program codes and data of the electronic device. The processing unit 401 may be a processor, the communication unit 402 may be a touch display screen or a transceiver, and the storage unit 403 may be a memory.
It can be understood that, since the method embodiment and the apparatus embodiment are different presentation forms of the same technical concept, the content of the method embodiment portion in the present application should be synchronously adapted to the apparatus embodiment portion, and is not described herein again.
Embodiments of the present application further provide a chip, where the chip includes a processor, configured to call and run a computer program from a memory, so that a device installed with the chip performs part or all of the steps described in the electronic device in the foregoing method embodiments.
Embodiments of the present application further provide a computer storage medium, where the computer storage medium stores a computer program for electronic data exchange, the computer program enables a computer to execute part or all of the steps of any one of the methods as described in the above method embodiments, and the computer includes an electronic device.
Embodiments of the present application also provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any of the methods as described in the above method embodiments. The computer program product may be a software installation package, the computer comprising an electronic device.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art will recognize that the embodiments described in this specification are preferred embodiments and that acts or modules referred to are not necessarily required for this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the above-described division of the units is only one type of division of logical functions, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed coupling or direct coupling or communication connection between each other may be through some interfaces, indirect coupling or communication connection between devices or units, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit may be stored in a computer readable memory if it is implemented in the form of a software functional unit and sold or used as a separate product. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the above-mentioned method of the embodiments of the present application. And the aforementioned memory comprises: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk, and various media capable of storing program codes.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, read-Only memories (ROMs), random Access Memories (RAMs), magnetic or optical disks, and the like.
The foregoing detailed description of the embodiments of the present application has been presented to illustrate the principles and implementations of the present application, and the above description of the embodiments is only provided to help understand the method and the core concept of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, the specific implementation manner and the application scope may be changed, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (7)
1. A drawing splitting method is characterized by comprising the following steps:
acquiring primitive information in the drawing, wherein the primitive information comprises the position of each primitive in a plurality of primitives in the drawing;
determining a reference position range of each primitive according to the coordinates of each primitive, wherein the reference position range comprises the position of each primitive;
dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives, wherein each primitive set comprises at least one primitive, the reference position range of any one primitive in the at least one primitive set is intersected with the reference position range of at least one other primitive in the primitive set, the target position range formed by the primitives in any two primitive sets in the at least one primitive set is not intersected, and the target position range refers to the union of the reference position ranges of all the primitives in the primitive set;
splitting the drawing into at least one subgraph corresponding to the at least one primitive set;
the dividing the plurality of primitives into at least one primitive set according to the relevance of the reference position ranges of the plurality of primitives comprises:
determining the track of each primitive according to the coordinates of each primitive;
dividing the primitives with intersection points on the tracks into a primitive group, and independently dividing the rest primitives into a single primitive group respectively, wherein the track of the primitive contained in each primitive group has an intersection point with the track of at least one other primitive in the primitive group, the track of the primitive contained in each primitive group has no intersection point with the track of any primitive contained in other primitive groups, and the reference position range of the primitive group is the union of the reference position ranges of all the primitives contained in the primitive group;
determining relevance of the reference position range of each of the multiple primitive groups to reference position ranges of other primitive groups, wherein the other primitive groups are all the multiple primitive groups except the each of the multiple primitive groups, and the relevance comprises existence of intersection and nonexistence of intersection;
and dividing a plurality of primitive groups with the relevance of intersection into the same primitive set, and respectively and independently dividing the rest primitive groups into a single primitive set.
2. The method of claim 1, wherein splitting the drawing into at least one subgraph corresponding to the at least one set of primitives comprises:
determining boundary coordinates of a target position range of each primitive set, wherein the boundary coordinates refer to the maximum abscissa, the maximum ordinate, the minimum abscissa and the minimum ordinate of all primitives contained in the primitive set;
determining the distance between each primitive set and other primitive sets in the multiple primitive sets according to the boundary coordinates, wherein the other primitive sets are all the primitive sets except each primitive set in the multiple primitive sets;
combining the multiple primitive sets with the distances smaller than a preset threshold value into a final primitive set, wherein the remaining primitive sets are respectively final primitive sets;
and splitting the drawing into at least one subgraph corresponding to the at least one final primitive set.
3. The method of claim 2, wherein the reference position range for each primitive comprises: and the rectangular range is formed by the minimum abscissa, the minimum ordinate, the maximum abscissa and the maximum ordinate of each primitive together.
4. The method of claim 3, wherein the primitives are arcs, and the reference position range of each primitive comprises: and the sector range is formed by the start point coordinate of the circular arc, the end point coordinate of the circular arc and the center coordinate of the circular arc.
5. A drawing splitting device is characterized by comprising a processing unit and a communication unit, wherein,
the processing unit is used for acquiring primitive information in the drawing through the communication unit, wherein the primitive information comprises the position of each primitive in a plurality of primitives in the drawing; and a reference position range for determining each primitive according to the coordinates of each primitive, wherein the reference position range comprises the position of each primitive; the system comprises a plurality of primitives, a plurality of storage units and a processing unit, wherein the primitives are divided into at least one primitive set according to the relevance of the reference position ranges of the primitives, each primitive set comprises at least one primitive, the reference position range of any primitive in the at least one primitive has an intersection with the reference position range of at least one other primitive in the primitive set, the target position range formed by the primitives in any two primitive sets in the at least one primitive set does not have an intersection, and the target position range refers to the union of the reference position ranges of all the primitives in the primitive set; the drawing is divided into at least one sub-graph corresponding to the at least one primitive set;
in respect of said dividing the plurality of primitives into at least one primitive set in accordance with the relevance of their reference position ranges, the processing unit is further configured to: determining the track of each primitive according to the coordinates of each primitive; the system comprises a plurality of primitive groups, a plurality of groups of primitives and a plurality of groups of primitives, wherein the primitives with intersection points on the tracks are divided into one primitive group, and the rest of primitives are respectively and independently divided into a single primitive group, wherein the track of the primitive contained in each primitive group has an intersection point with the track of at least one other primitive in the primitive group, the track of the primitive contained in each primitive group has no intersection point with the track of any one primitive contained in other primitive groups, and the reference position range of the primitive group is the union of the reference position ranges of all the primitives contained in the primitive group; and determining the relevance of the reference position range of each of the multiple primitive groups to the reference position ranges of other primitive groups, wherein the other primitive groups are all the primitive groups except the each of the multiple primitive groups, and the relevance comprises the existence of intersection and the nonexistence of intersection; and the system is used for dividing a plurality of primitive groups with the relevance of intersection into the same primitive set, and respectively and independently dividing the rest primitive groups into a single primitive set.
6. An electronic device comprising a processor, memory, and one or more programs stored in the memory and configured to be executed by the processor, the programs including instructions for performing the steps in the method of any of claims 1-4.
7. A computer-readable storage medium, characterized in that a computer program for electronic data exchange is stored, wherein the computer program causes a computer to perform the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010562501.4A CN111783180B (en) | 2020-06-18 | 2020-06-18 | Drawing splitting method and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010562501.4A CN111783180B (en) | 2020-06-18 | 2020-06-18 | Drawing splitting method and related device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111783180A CN111783180A (en) | 2020-10-16 |
| CN111783180B true CN111783180B (en) | 2022-12-09 |
Family
ID=72756672
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010562501.4A Active CN111783180B (en) | 2020-06-18 | 2020-06-18 | Drawing splitting method and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111783180B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113495700B (en) * | 2021-07-02 | 2024-10-11 | 上海中交海德交通科技股份有限公司 | Batch printing method, system and equipment for drawing and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108121867A (en) * | 2017-12-21 | 2018-06-05 | 山东同智伟业软件股份有限公司 | The general quick method for splitting of DWG drawings |
| CN110096270A (en) * | 2019-05-06 | 2019-08-06 | 浙江精工钢结构集团有限公司 | A kind of design drawing method for splitting and system based on .NET plug-in unit |
| CN110458857A (en) * | 2019-08-12 | 2019-11-15 | 厦门美图之家科技有限公司 | Central symmetry pel detection method, device, electronic equipment and readable storage medium storing program for executing |
| CN110909650A (en) * | 2019-11-15 | 2020-03-24 | 清华大学 | CAD drawing identification method and device based on domain knowledge and target detection |
| CN111291438A (en) * | 2020-01-22 | 2020-06-16 | 远景智能国际私人投资有限公司 | File processing method and device, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3614282A1 (en) * | 2018-08-20 | 2020-02-26 | Bricsys NV | Automatic parametric constraints in cad |
-
2020
- 2020-06-18 CN CN202010562501.4A patent/CN111783180B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108121867A (en) * | 2017-12-21 | 2018-06-05 | 山东同智伟业软件股份有限公司 | The general quick method for splitting of DWG drawings |
| CN110096270A (en) * | 2019-05-06 | 2019-08-06 | 浙江精工钢结构集团有限公司 | A kind of design drawing method for splitting and system based on .NET plug-in unit |
| CN110458857A (en) * | 2019-08-12 | 2019-11-15 | 厦门美图之家科技有限公司 | Central symmetry pel detection method, device, electronic equipment and readable storage medium storing program for executing |
| CN110909650A (en) * | 2019-11-15 | 2020-03-24 | 清华大学 | CAD drawing identification method and device based on domain knowledge and target detection |
| CN111291438A (en) * | 2020-01-22 | 2020-06-16 | 远景智能国际私人投资有限公司 | File processing method and device, electronic equipment and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| Multistroke Grouping of Online Freehand Axonometric Sketches for Mechanical Models;Shouxia Wang等;《Mathematical Problems in Engineering》;20200507;第1-13页 * |
| 工程图中查找极值点及视图划分中心点的算法;张云辉等;《工程图学学报》;20090815(第04期);第55-63页 * |
| 煤矿工程图形快速"剪裁";张东峰;《太原理工大学学报》;20000120(第01期);第22-26页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111783180A (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190163970A1 (en) | Method and device for extracting chart information in file | |
| CN110502985B (en) | Form identification method and device and form identification equipment | |
| CN112560862B (en) | Text recognition method and device and electronic equipment | |
| US20200387553A1 (en) | Digitization of technical documentation driven by machine learning | |
| CN110765893B (en) | Drawing file identification method, electronic equipment and related product | |
| WO2021164251A1 (en) | Image annotation task pre-verification method and apparatus, device, and storage medium | |
| CN106484726A (en) | A kind of page display method and device | |
| CN112818456A (en) | Layer configuration method, electronic equipment and related product | |
| CN111857704A (en) | Code generation method and device for layout relationship | |
| CN111652144A (en) | Topic segmentation method, device, equipment and medium based on target region fusion | |
| CN111783180B (en) | Drawing splitting method and related device | |
| CN111611936A (en) | Automatic identification system for similar vector diagrams in CAD drawings | |
| CN109871743B (en) | Text data positioning method and device, storage medium and terminal | |
| US20160284104A1 (en) | Determine the Shape of a Representation of an Object | |
| CN110688995B (en) | Map query processing method, computer-readable storage medium and mobile terminal | |
| CN114048539A (en) | CAD file analysis and rule judgment method and related device | |
| CN113887375A (en) | Text recognition method, device, equipment and storage medium | |
| CN111611935B (en) | Automatic identification method for similar vector diagrams in CAD drawing | |
| CN111986289B (en) | Method and device for searching closed area and electronic equipment | |
| CN112613395A (en) | Primitive position relation matching method and device and computer equipment | |
| CN114663902B (en) | Document image processing method, device, equipment and medium | |
| CN114444185A (en) | In-situ labeling identification method and device and electronic equipment | |
| CN115116084A (en) | Method, device and equipment for identifying quotation and storage medium | |
| CN111599178B (en) | Intersection identification method and device and storage medium | |
| CN112101369B (en) | Image segmentation method and 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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230703 Address after: A601, Zhongke Naneng Building, No. 06 Yuexing 6th Road, Gaoxin District Community, Yuehai Street, Nanshan District, Shenzhen City, Guangdong Province, 518063 Patentee after: Shenzhen Wanyi Digital Technology Co.,Ltd. Address before: 519000 room 105-24914, No.6 Baohua Road, Hengqin New District, Zhuhai City, Guangdong Province (centralized office area) Patentee before: WANYI TECHNOLOGY Co.,Ltd. |