Image cutting method and device, medium and product

Abstract

The invention provides an image cutting method and device, a medium and a product, relates to the technical field of image processing, and aims to solve the problem that the relation between sub-images cannot be defined by a general technology. The graph segmentation method comprises the following steps: acquiring a node relation graph of a to-be-segmented region; the node relation graph comprises a plurality of service nodes and service relations between the service nodes; according to the service relationship of each service node, segmenting the sub-region to which each service node belongs, so as to obtain a sub-relationship graph corresponding to each sub-region; any two adjacent sub-relation graphs comprise at least one same service node.

Description

Technical Field

[0001] The present application relates to the field of image processing technology, and in particular to a method, device, medium and product for cutting images. Background Art

[0002] With the development of the fifth generation mobile communication technology (5G), digital technology is applied in the field of engineering drawing in multiple industries (including communication, electricity, construction, survey, etc.), especially in the survey industry. The application of digital technology drawing can draw a link diagram containing various business nodes and the relationship between business nodes. In the subsequent application of the link diagram, the overall drawing (also called the overall design drawing) needs to be divided into multiple sub-graphs.

[0003] The general technology is to use the automatic cutting tool to cut the drawing as a whole.

[0004] However, the automatic graph cutting tool cannot identify the business relationships in the link graph, so the general technology cannot clarify the relationship between the subgraphs. Summary of the invention

[0005] The embodiments of the present disclosure provide a graph cutting method, device, medium and product, aiming to solve the technical problem that the general technology cannot clearly define the relationship between sub-graphs.

[0006] In order to achieve the above objectives, this application adopts the following technical solutions:

[0007] In a first aspect, a graph cutting method is provided, comprising: obtaining a node relationship graph of an area to be cut; the node relationship graph comprises a plurality of business nodes and the business relationship between each business node; according to the business relationship of each business node, the sub-area to which each business node belongs is cut to obtain a sub-relationship graph corresponding to each sub-area; any two adjacent sub-relationship graphs include at least one identical business node.

[0008] Optionally, the sub-region to which each business node belongs is divided according to the business relationship of each business node to obtain a sub-relationship graph corresponding to each sub-region, including: dividing the first sub-region to which the first business node belongs according to the business relationship of the first business node to obtain a first sub-relationship graph corresponding to the first sub-region; the first sub-relationship graph includes business nodes that have a business relationship with the first business node; determining the second business node from the first sub-relationship graph; the second business node has a business relationship with business nodes other than the first sub-relationship graph; dividing the second sub-region to which the second business node belongs according to the business relationship of the second business node to obtain a second sub-relationship graph corresponding to the second sub-region; the second sub-relationship graph includes business nodes that have a business relationship with the second business node, and does not include nodes other than the second business node in the first sub-relationship graph; repeating the above operations until the sub-relationship graph corresponding to each sub-region is determined.

[0009] Optionally, based on the business relationship of each business node, the sub-area to which each business node belongs is divided to obtain a sub-relationship graph corresponding to each sub-area, including: for each business node, obtaining the required area size of the sub-area to which the business node belongs; determining the range of the sub-area based on the required area size, and dividing according to the range of the sub-area to obtain a sub-relationship graph corresponding to the sub-area; the sub-relationship graph includes business nodes that have a business relationship with the business node and business nodes that do not have a business relationship within the range of the sub-area.

[0010] Optionally, in the case where the first business node is the starting business node, the first sub-region to which the first business node belongs is divided according to the business relationship of the first business node to obtain a first sub-relationship graph corresponding to the first sub-region, including: determining a dividing direction of the sub-region to which the starting business node belongs according to the location information of the starting business node; and dividing the sub-region to which the starting business node belongs according to the dividing direction and the business relationship of the starting business node to obtain a sub-relationship graph to which the starting business node belongs.

[0011] Optionally, the graph cutting method further includes: determining a starting business node according to position information of each business node in the node relationship graph.

[0012] Optionally, after dividing the sub-area to which each business node belongs according to the business relationship of each business node to obtain a sub-relationship graph corresponding to each sub-area, it also includes: marking the same business nodes included in any two adjacent sub-relationship graphs to associate any two adjacent sub-relationship graphs.

[0013] Optionally, after dividing the sub-region to which each business node belongs according to the business relationship of each business node to obtain the sub-relationship graph corresponding to each sub-region, it also includes: when the structural difference of adjacent sub-relationship graphs does not meet the preset conditions, the adjacent sub-relationship graphs are adjusted so that the structural difference of the adjusted adjacent sub-relationship graphs meets the preset conditions; the preset conditions include: the difference in the number of nodes of adjacent sub-relationship graphs is less than a preset threshold, and the complexity of the links of adjacent sub-relationship graphs is less than a preset complexity; the links are used to indicate that there is a business relationship between the business nodes.

[0014] In a second aspect, a graph cutting device is provided, which includes: a communication unit and a processing unit; the communication unit is used to obtain a node relationship graph of the area to be cut; the node relationship graph includes multiple business nodes and the business relationship between each business node; the processing unit is used to cut the sub-area to which each business node belongs according to the business relationship of each business node to obtain a sub-relationship graph corresponding to each sub-area; any two adjacent sub-relationship graphs include at least one identical business node.

[0015] Optionally, the processing unit is specifically used to: divide the first sub-region to which the first business node belongs according to the business relationship of the first business node to obtain a first sub-relationship graph corresponding to the first sub-region; the first sub-relationship graph includes business nodes that have a business relationship with the first business node; determine the second business node from the first sub-relationship graph; the second business node has a business relationship with business nodes other than the first sub-relationship graph; divide the second sub-region to which the second business node belongs according to the business relationship of the second business node to obtain a second sub-relationship graph corresponding to the second sub-region; the second sub-relationship graph includes business nodes that have a business relationship with the second business node, and does not include nodes other than the second business node in the first sub-relationship graph; repeat the above operations until the sub-relationship graph corresponding to each sub-region is determined.

[0016] Optionally, the processing unit is specifically used to: obtain, for each business node, a required area size of a sub-area to which the business node belongs; determine the range of the sub-area based on the required area size, and divide the sub-area based on the range of the sub-area to obtain a sub-relationship graph corresponding to the sub-area; the sub-relationship graph includes business nodes that have a business relationship with the business node and business nodes that do not have a business relationship with the business node within the range of the sub-area.

[0017] Optionally, in the case where the first business node is the starting business node, the processing unit is specifically used to: determine the splitting direction of the sub-area to which the starting business node belongs based on the location information of the starting business node; and split the sub-area to which the starting business node belongs based on the splitting direction and the business relationship of the starting business node to obtain a sub-relationship graph to which the starting business node belongs.

[0018] Optionally, the processing unit is further configured to determine a starting service node according to position information of each service node in the node relationship graph.

[0019] Optionally, after dividing the sub-area to which each business node belongs according to the business relationship of each business node to obtain a sub-relationship graph corresponding to each sub-area, the processing unit is also used to mark the same business nodes included in any two adjacent sub-relationship graphs to associate any two adjacent sub-relationship graphs.

[0020] Optionally, after the sub-region to which each business node belongs is divided according to the business relationship of each business node to obtain the sub-relationship graph corresponding to each sub-region, the processing unit is also used to adjust the adjacent sub-relationship graphs when the structural difference of adjacent sub-relationship graphs does not meet the preset conditions, so that the structural difference of the adjusted adjacent sub-relationship graphs meets the preset conditions; the preset conditions include: the difference in the number of nodes of adjacent sub-relationship graphs is less than a preset threshold, and the complexity of the links of adjacent sub-relationship graphs is less than a preset complexity; the links are used to indicate that there is a business relationship between the business nodes.

[0021] In a third aspect, a picture cutting device is provided, comprising a memory and a processor; the memory is used to store computer execution instructions, and the processor is connected to the memory through a bus; when the picture cutting device is running, the processor executes the computer execution instructions stored in the memory, so that the picture cutting device executes the picture cutting method of the first aspect.

[0022] The image cutting device may be an electronic device or a part of an electronic device, such as a chip system in an electronic device. The chip system is used to support the electronic device to implement the functions involved in the first aspect and any possible implementation thereof, for example, to obtain and determine the data and / or information involved in the above-mentioned image cutting method. The chip system includes a chip and may also include other discrete devices or circuit structures.

[0023] In a fourth aspect, a computer-readable storage medium is provided, the computer-readable storage medium comprising computer execution instructions, and when the computer execution instructions are executed on a computer, the computer executes the image cutting method described in the first aspect.

[0024] In a fifth aspect, a computer program product is also provided, which includes a computer program or instructions. When the computer instructions are executed on a picture cutting device, the picture cutting device executes the picture cutting method as described in the first aspect above.

[0025] It should be noted that the above computer instructions may be stored in whole or in part on a computer-readable storage medium, wherein the computer-readable storage medium may be packaged together with the processor of the image cutting device, or may be packaged separately from the processor of the image cutting device, which is not limited in the present embodiment.

[0026] The description of the second, third, fourth and fifth aspects of the present application can refer to the detailed description of the first aspect.

[0027] In the embodiments of the present application, the name of the above-mentioned image cutting device does not limit the device or functional module itself. In actual implementation, these devices or functional modules may appear with other names. For example, the receiving unit may also be called a receiving module, a receiver, etc. As long as the functions of each device or functional module are similar to those of the present application, they fall within the scope of the claims of the present application and their equivalent technologies.

[0028] The technical solution provided by this application brings at least the following beneficial effects:

[0029] Based on any of the above aspects, an embodiment of the present application provides a graph cutting method. First, a node relationship graph of the area to be cut is obtained; the node relationship graph includes multiple business nodes and the business relationship between each business node; according to the business relationship of each business node, the sub-area to which each business node belongs is cut to obtain a sub-relationship graph corresponding to each sub-area; any two adjacent sub-relationship graphs include at least one identical business node.

[0030] As can be seen from the above, the present application can obtain the node relationship graph of the area to be segmented, and segment the sub-area to which each business node belongs according to the business relationship of each business node in the node relationship graph, and obtain the sub-relationship graph corresponding to each sub-area, wherein any two adjacent sub-relationship graphs include at least one identical business node. In this way, the present application can segment the graph according to the business relationship of the business node, and can obtain the connection relationship between the sub-relationship graphs. This solves the technical problem that the general technology cannot clearly define the relationship between the sub-graphs.

[0031] The beneficial effects of the first, second, third, fourth and fifth aspects of the present application can all be referred to the analysis of the above beneficial effects, which will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 A schematic diagram of the structure of a picture cutting system provided in an embodiment of the present application;

[0033] Figure 2 A schematic diagram of a hardware structure of a communication device provided in an embodiment of the present application;

[0034] Figure 3A schematic diagram of a flow chart of a method for cutting a graph provided in an embodiment of the present application;

[0035] Figure 4 A schematic diagram of a flow chart of another method for cutting a picture provided in an embodiment of the present application;

[0036] Figure 5 A node relationship diagram of a region to be segmented provided in an embodiment of the present application;

[0037] Figure 6 A schematic diagram of a flow chart of another method for cutting a picture provided in an embodiment of the present application;

[0038] Figure 7 A schematic diagram of a result provided in an embodiment of the present application;

[0039] Figure 8 A schematic diagram of a flow chart of another method for cutting a picture provided in an embodiment of the present application;

[0040] Fig. 9 Another result schematic diagram provided for the embodiment of the present application;

[0041] Fig.10 Another result schematic diagram provided for the embodiment of the present application;

[0042] Fig.11 Another result schematic diagram provided for the embodiment of the present application;

[0043] Fig.12 Another result schematic diagram provided for the embodiment of the present application;

[0044] Fig.13 A schematic diagram of a flow chart of another method for cutting a picture provided in an embodiment of the present application;

[0045] Fig.14 A schematic diagram of the structure of a picture cutting device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0046] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0047] It should be noted that, in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0048] In order to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first", "second", etc. are used to distinguish the same items or similar items with basically the same functions and effects. Those skilled in the art can understand that the words "first", "second", etc. are not limiting the quantity and execution order.

[0049] Before introducing the image cutting method provided by the present application in detail, a brief introduction is first given to the application scenarios and implementation environment involved in the present application.

[0050] First, a brief introduction to the application scenarios involved in this application is given.

[0051] As described in the background technology, with the development of 5G technology, digital technology is applied in the field of engineering drawing in multiple industries (including: communications, electricity, construction, surveying, etc.), especially in the surveying industry, the application of digital technology drawing can draw a link diagram containing various business nodes and the relationship between business nodes. In the subsequent application of the link diagram, the overall drawing (also called the overall design drawing) needs to be divided into multiple sub-graphs.

[0052] The general technology is to use an automatic cutting tool to cut the drawing as a whole. However, the automatic cutting tool cannot identify the business relationship in the link diagram, so the general technology cannot clarify the relationship between the sub-graphs.

[0053] Moreover, the use of general technology for cutting images is limited by the existing frame recognition model. In some cases, the cutting accuracy is easily lost for low-quality drawings and complex drawings, and it usually does not support re-editing and adjustment of cutting at any time. Therefore, the accuracy of the obtained sub-image is low.

[0054] In addition to using automatic graph cutting tools to cut graphs, graph cutting can also be done by manually identifying business relationships in link graphs. This consumes a lot of manpower and time costs, and the graph cutting efficiency is low.

[0055] In response to the above problems, an embodiment of the present application provides a graph cutting method. First, a node relationship graph of the area to be cut is obtained; the node relationship graph includes multiple business nodes and the business relationship between each business node; according to the business relationship of each business node, the sub-area to which each business node belongs is cut to obtain a sub-relationship graph corresponding to each sub-area; any two adjacent sub-relationship graphs include at least one identical business node.

[0056] As can be seen from the above, the present application can obtain the node relationship graph of the area to be segmented, and segment the sub-area to which each business node belongs according to the business relationship of each business node in the node relationship graph, and obtain the sub-relationship graph corresponding to each sub-area, wherein any two adjacent sub-relationship graphs include at least one identical business node. In this way, the present application can segment the graph according to the business relationship of the business node, and can obtain the connection relationship between the sub-relationship graphs. This solves the technical problem that the general technology cannot clearly define the relationship between the sub-graphs.

[0057] Furthermore, the present application cuts the graph according to the business relationship of the business node, and the accuracy of the sub-relationship graph is not affected by the cutting of the graph, and it can also support re-editing.

[0058] In addition, the present application does not rely on manually identifying business relationships in a node relationship graph (also called a link graph), thereby improving graph cutting efficiency.

[0059] The implementation environment of the above-mentioned image cutting method can be the image cutting system provided in the embodiment of the present application.

[0060] Figure 1 FIG. 1 shows a schematic diagram of the structure of the image cutting system provided in an embodiment of the present application. Figure 1 As shown, the image cutting system includes: an image cutting device 101 and a data storage device 102.

[0061] The image cutting device 101 and the data storage device 102 are communicatively connected.

[0062] In practical applications, the image cutting device 101 can be connected to any number of data storage devices 102. For ease of understanding, Figure 1 An example is given for describing the connection between a picture cutting device 101 and a data storage device 102.

[0063] In an embodiment of the present application, the data storage device 102 is used to provide data for graph cutting (for example, business nodes, business relationships, etc.) to the graph cutting device 101, so that the graph cutting device 101 implements graph cutting according to the data sent by the data storage device 102.

[0064] Optionally, the physical devices of the image cutting device 101 and the data storage device 102 may be terminals or other types of electronic devices, which is not limited in the embodiments of the present application.

[0065] Optionally, the terminal may be a device that provides voice and / or data connectivity to a user, a handheld device with wireless connection function, or other processing device connected to a wireless modem. The wireless terminal may communicate with one or more core networks via a radio access network (RAN). The wireless terminal may be a mobile terminal, such as a mobile phone (or "cellular" phone) and a computer with a mobile terminal, or a portable, pocket-sized, handheld, computer-built-in or vehicle-mounted mobile device that exchanges language and / or data with a radio access network, such as a mobile phone, tablet computer, laptop computer, netbook, personal digital assistant (PDA).

[0066] Optionally, the image cutting device 101 and the data storage device 102 may be two devices independently set up, or may be integrated into the same device. When the image cutting device 101 and the data storage device 102 are integrated into the same device, the data storage device 102 may be a storage module (such as a database, etc.) of the image cutting device 101.

[0067] It is easy to understand that when the image cutting device 101 and the data storage device 102 are integrated into the same device, the communication mode between the image cutting device 101 and the data storage device 102 is the communication between the internal modules of the device. In this case, the communication process between the two is the same as the communication process between the image cutting device 101 and the data storage device 102 when they are independent of each other.

[0068] For ease of understanding, the present application is described by taking the example that the image cutting device 101 and the data storage device 102 are independent of each other.

[0069] The cutting equipment in the cutting system includes: Figure 2 The following are the components included. Figure 2 Taking the communication device shown in the figure as an example, the hardware structure of the image cutting device is introduced.

[0070] Figure 2 , which is a schematic diagram of a hardware structure of a communication device provided in an embodiment of the present application. The communication device includes a processor 21, a memory 22, a communication interface 23, and a bus 24. The processor 21, the memory 22, and the communication interface 23 can be connected via a bus 24.

[0071] The processor 21 is the control center of the communication device, which can be a processor or a general term for multiple processing elements. For example, the processor 21 can be a general-purpose central processing unit (CPU) or other general-purpose processors. Among them, the general-purpose processor can be a microprocessor or any conventional processor.

[0072] As an embodiment, the processor 21 may include one or more CPUs, such as Figure 2 CPU0 and CPU1 are shown in the figure.

[0073] The memory 22 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0074] In a possible implementation, the memory 22 may exist independently of the processor 21, and the memory 22 may be connected to the processor 21 via a bus 24 to store instructions or program codes. When the processor 21 calls and executes the instructions or program codes stored in the memory 22, the image cutting method provided in the following embodiments of the present application can be implemented.

[0075] In the embodiment of the present application, for the communication device, the software programs stored in the memory 22 are different, so the functions implemented by the communication device are different. The functions performed by each device will be described in conjunction with the following flowchart.

[0076] In another possible implementation, the memory 22 may also be integrated with the processor 21 .

[0077] The communication interface 23 is used for the communication device to connect with other devices through a communication network, and the communication network may be Ethernet, wireless access network, wireless local area network (WLAN), etc. The communication interface 23 may include a receiving unit for receiving data and a sending unit for sending data.

[0078] The bus 24 may be an industry standard architecture (ISA) bus, a peripheral component interconnect (PCI) bus, or an extended industry standard architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 2 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0079] It should be pointed out that Figure 2 The structure shown in the figure does not constitute a limitation on the communication device, except Figure 2 In addition to the components shown, the communication device may include more or fewer components than shown, or combine certain components, or arrange the components differently.

[0080] The following is a detailed description of the image cutting method provided in the embodiments of the present application in conjunction with the accompanying drawings.

[0081] The image cutting method provided in the embodiment of the present application is applied to Figure 1 The image cutting device in the image cutting system shown in FIG. Figure 3 As shown, the image cutting method provided in the embodiment of the present application includes:

[0082] S301: The graph cutting device obtains a node relationship graph of the area to be cut.

[0083] The node relationship diagram includes multiple business nodes and the business relationship between each business node.

[0084] Combination Figure 1 ,The graph cutting device obtains the node relationship graph of the area to be cut from the data storage device.

[0085] Business nodes include: physical implementation nodes and business process nodes.

[0086] Physical implementation nodes refer to the marking points of various physical infrastructures in the communication network in the node relationship diagram.

[0087] A business process node refers to a marking point in a node relationship diagram that is part of a key process involved in the development of a communications business.

[0088] When the service node is used to represent a physical implementation node, the service node includes: communication base stations, optical switching boxes, computer rooms and other facilities.

[0089] When a business node is used to represent a business process node, the business node includes: a business handling point, an equipment installation point, and a maintenance operation point.

[0090] Business node relationships include: facility association relationships and business process relationships.

[0091] When business nodes are used to represent physical implementation nodes, business relationships are used to represent facility association relationships, that is, the connection relationships between various physical infrastructures.

[0092] When business nodes are used to represent business process nodes, business relationships are used to represent the sequence and logical relationships of various key process links.

[0093] Optionally, the multiple service nodes in the node relationship diagram and the service relationship between each service node can be represented in the form of a link. The nodes in the link are used to represent the service nodes, and the connection between two nodes in the link is used to represent that the two nodes have a service relationship.

[0094] A link includes: endpoints and branch points.

[0095] An endpoint is used to represent the first or last node in a link. A complete link has one or more endpoints.

[0096] A branch point is used to represent a node in a link that is connected to at least three nodes.

[0097] Exemplarily, if node A is connected to node B, node C, and node D respectively, then node A is a branch point.

[0098] In one achievable method, the graph cutting device can obtain a node relationship graph of the area to be cut, wherein the node relationship graph includes multiple business nodes and the business relationship between each business node, so that the subsequent graph cutting device can cut according to the business relationship of the nodes to obtain the connection relationship between the sub-relationship graphs.

[0099] S302: The graph cutting device divides the sub-region to which each service node belongs according to the service relationship of each service node to obtain a sub-relationship graph corresponding to each sub-region.

[0100] Any two adjacent sub-relationship graphs include at least one identical service node.

[0101] In one achievable method, the graph cutting device can divide the sub-area to which each business node belongs according to the business relationship of each business node, and obtain a sub-relationship graph corresponding to each sub-area. Any two adjacent sub-relationship graphs include at least one identical business node. In this way, the graph cutting device can determine the connection relationship of the sub-relationship graphs based on the same business nodes.

[0102] In some embodiments, in combination Figure 3 ,like Figure 4As shown, in S302, the graph cutting device divides the sub-area to which each service node belongs according to the service relationship of each service node to obtain a sub-relationship graph corresponding to each sub-area, specifically including:

[0103] S401. A graph cutting device cuts a first sub-region to which a first service node belongs according to a service relationship of the first service node, so as to obtain a first sub-relationship graph corresponding to the first sub-region.

[0104] The first sub-relationship graph includes service nodes having a service relationship with the first service node.

[0105] Optionally, the graph cutting device determines the second business node connected to the first business node based on the business relationship of the first business node, and determines the third business node connected to the second business node based on the business relationship of the second business node, and so on. The graph cutting device can traverse the business nodes directly connected to the first business node and the business nodes indirectly connected to the first business node based on the business relationship of the first business node to obtain a first sub-relationship graph.

[0106] In one achievable method, the graph cutting device can divide the first sub-region to which the first business node belongs according to the business relationship of the first business node to obtain a first sub-relationship graph corresponding to the first sub-region. In this way, the graph cutting device can determine the first sub-relationship graph corresponding to the first sub-region to which the first business node belongs according to the business relationship of the first business node. The obtained first sub-relationship graph includes the first business node, the business node directly connected to the first business node, and the business node indirectly connected to the first business node.

[0107] In some embodiments, when the first service node is the starting service node, the graph cutting device divides the first sub-region to which the first service node belongs according to the service relationship of the first service node to obtain a first sub-relationship graph corresponding to the first sub-region, specifically including:

[0108] The graph cutting device determines the starting service node according to the position information of each service node in the node relationship graph.

[0109] The location information includes: the longitude and latitude of the service node.

[0110] The starting nodes include: the business node with the largest longitude, the business node with the smallest longitude, the business node with the largest latitude, and the business node with the smallest latitude.

[0111] The map cutting device determines the cutting direction of the sub-area to which the starting service node belongs according to the location information of the starting service node.

[0112] The cutting directions include: horizontally to the right (i.e. starting from the leftmost side), horizontally to the left (i.e. starting from the rightmost side), vertically downward (i.e. starting from the topmost side), and vertically upward (i.e. starting from the bottommost side).

[0113] When the starting service node is used to represent the service node with the largest longitude, the segmentation direction is horizontally to the left.

[0114] When the starting service node is used to represent the service node with the smallest longitude, the segmentation direction is horizontally to the right.

[0115] When the starting service node is used to represent the service node with the largest latitude, the splitting direction is vertically downward.

[0116] When the starting service node is used to represent the service node with the smallest latitude, the segmentation direction is vertically upward.

[0117] The graph cutting device cuts the sub-area to which the starting service node belongs according to the cutting direction and the service relationship of the starting service node, so as to obtain the sub-relationship graph to which the starting service node belongs.

[0118] As can be seen from the above, the graph cutting device can first determine the starting node and determine the cutting direction according to the starting business node. In this way, the graph cutting device can avoid turning back at a certain business node and repeatedly traversing a certain business node, and can quickly cut the graph from the starting business node.

[0119] S402: The graph cutting device determines a second service node from the first sub-relationship graph.

[0120] The second service node has a service relationship with service nodes outside the first sub-relationship graph.

[0121] For example, Figure 5 The node relationship diagram of the area to be segmented is shown. In the node relationship diagram, service node C is connected to service node B, service node D, and service node E respectively, and service node D is connected to service node C, service node F, and service node G respectively.

[0122] When the first sub-relationship graph includes: business node A, business node B, business node C, business node D, and business node F, the graph cutting device determines the second business node from the first sub-relationship graph, because business node C has a business relationship with business nodes outside the first sub-relationship graph, that is, business node C has a business relationship with business node E, and business node D has a business relationship with business nodes outside the first sub-relationship graph, that is, business node D has a business relationship with business node G. Therefore, the second business node includes: business node C and business node D.

[0123] The graph cutting device selects one node from service node C and service node D as the second service node.

[0124] S403: The graph cutting device divides the second sub-region to which the second service node belongs according to the service relationship of the second service node to obtain a second sub-relationship graph corresponding to the second sub-region.

[0125] The second sub-relationship graph includes the business nodes having a business relationship with the second business node, and does not include nodes other than the second business node in the first sub-relationship graph.

[0126] In one achievable manner, the graph cutting device can divide the second sub-region to which the second business node belongs according to the business relationship of the second business node, and can obtain a second sub-relationship graph corresponding to the second sub-region. The second sub-relationship graph includes business nodes that have a business relationship with the second business node, and does not include nodes other than the second business node in the first sub-relationship graph. In this way, the graph cutting device can avoid having more than two identical business nodes in two sub-relationship graphs, thereby avoiding wasting graph cutting resources.

[0127] S404: The graph cutting device repeats the above operations until a sub-relationship graph corresponding to each sub-region is determined.

[0128] In order to obtain the sub-relationship graph corresponding to each sub-region, the cutting graph is completed.

[0129] In one achievable manner, the graph cutting device may repeat the above operation to obtain each sub-graph of the node relationship graph of the area to be cut, and at least two sub-graphs have a common business node, so that the node relationship graph can be restored through the sub-graphs.

[0130] In some embodiments, in S302, the graph cutting device divides the sub-region to which each service node belongs according to the service relationship of each service node to obtain a sub-relationship graph corresponding to each sub-region, specifically including:

[0131] The map cutting device obtains, for each service node, a required area size of a sub-area to which the service node belongs.

[0132] The image cutting device can obtain the length and width of the sub-region, wherein the length of the sub-region is the maximum horizontal longitude difference distance that can be accommodated in the Computer Aided Design (CAD) frame, and the width of the sub-region is the maximum vertical latitude difference distance that can be accommodated in the CAD frame.

[0133] Optionally, the map cutting device may also convert the longitude and latitude into coordinates on a Mercator projection plane.

[0134] Specifically, the image cutting device can convert the latitude into the vertical axis value y in the rectangular coordinate system. The latitude and the vertical axis value y satisfy the following formula:

[0135]

[0136] Among them, R is used to represent the radius of the earth and is used to represent the latitude.

[0137] The image cutting device can convert the longitude into the horizontal axis value x in the rectangular coordinate system. The latitude and the vertical axis value x satisfy the following formula:

[0138] x = R × lambda;

[0139] Here, R is used to represent the radius of the earth and lambda is used to represent the longitude.

[0140] The graph cutting device determines the range of the sub-region according to the required region size, and performs segmentation according to the range of the sub-region to obtain the sub-relationship graph corresponding to the sub-region.

[0141] The sub-relationship graph includes business nodes that have a business relationship with the business node and business nodes that do not have a business relationship with the business node within the scope of the sub-area.

[0142] Optionally, the image cutting device sets the size of the sub-region in advance.

[0143] From the above, it can be seen that the graph cutting device can obtain the required area size of the sub-area to which the business node belongs, determine the range of the sub-area based on the required area size, and divide it according to the range of the sub-area to obtain the sub-relationship graph corresponding to the sub-area. In this way, it can avoid the sub-relationship graph being too large or too small, making the size of the sub-relationship graph more reasonable.

[0144] In some embodiments, in combination Figure 4 ,like Figure 6 As shown, according to the business relationship of each business node, the sub-area to which each business node belongs is divided to obtain a sub-relationship graph corresponding to each sub-area, and the graph cutting method further includes:

[0145] S601: The graph cutting device marks the same business nodes included in any two adjacent sub-relationship graphs to associate any two adjacent sub-relationship graphs.

[0146] In one practicable manner, the graph cutting device may mark the same business nodes included in any two adjacent sub-relationship graphs to associate any two adjacent sub-relationship graphs, so as to restore the overall node relationship graph through the graph cutting marks later.

[0147] For example, Figure 7 A schematic diagram of the results is shown. Figure 7 (a) in FIG. 1 shows the first sub-relationship graph, Figure 7 (b) in FIG. 1 shows the second sub-relationship graph. Figure 7 In (a) of Figure 1, the “Connection” is marked next to the service node C. Figure 2 / 2", Figure 7 In (b) of Figure 1, the “Connection” is marked next to the service node C. Figure 1 / 2". The cutting device passes Figure 7 (a) and Figure 7 (b) in the figure can restore the overall node relationship graph.

[0148] In some embodiments, in combination Figure 6 ,like Figure 8 As shown, according to the business relationship of each business node, the sub-area to which each business node belongs is divided to obtain a sub-relationship graph corresponding to each sub-area, and the graph division also includes:

[0149] S801: When the structural difference between adjacent sub-relationship graphs does not satisfy a preset condition, the graph cutting device adjusts the adjacent sub-relationship graphs so that the structural difference between the adjacent sub-relationship graphs after adjustment satisfies the preset condition.

[0150] The preset conditions include: the difference in the number of nodes of adjacent sub-relationship graphs is less than a preset threshold, and the complexity of the links of adjacent sub-relationship graphs is less than a preset complexity. The link is used to indicate that there is a business relationship between business nodes.

[0151] Optionally, when the complexity of the links of the adjacent sub-relationship graphs is greater than or equal to the preset complexity, the graph cutting device may use an N-ary tree minimum depth-first traversal algorithm to adjust the adjacent sub-relationship graphs.

[0152] For example, when a branch point is encountered, the sub-relationship graph determined by the graph cutting device may cause the branch links in the node relationship graph to be not in the same sub-relationship graph. Fig. 9 As shown, the graph cutting device cuts the node relationship graph with cutting into three sub-relationship graphs, wherein the business node connected to the branch node D is not cut into one sub-relationship graph.

[0153] The graph cutting device performs graph cutting verification and adds the link with the smallest depth to the first sub-relationship graph. Fig. 9 The link depth shown in (b) is 3. Fig. 9 The link depth shown in (c) is 4, so the graph cutting device will be as follows Fig. 9 The link shown in (b) joins Fig. 9 In (a), it is determined whether the first sub-relationship graph at this time exceeds a preset sub-region range (also referred to as a preset graph frame).

[0154] When the first sub-relationship graph does not exceed the preset sub-region range, it is cut off from the branch node D, that is, the graph cutting device removes the service node D and the service nodes connected to the service node D. Fig. 9 (a) in the equation, we get Fig.10 The first sub-relationship graph shown in (a) in .

[0155] Then, the graph cutting device uses the service node C as the starting service node of the second sub-relationship graph, and obtains the service nodes connected to the service node C along the horizontal direction or the vertical direction, and obtains the following: Fig.10 The second sub-relationship graph shown in (b) in .

[0156] Optionally, when the difference in the number of nodes between adjacent sub-relationship graphs is greater than or equal to a preset threshold, the graph cutting determination device may adjust the length of the link in the adjacent sub-relationship graph to adjust the adjacent sub-relationship graph.

[0157] For example, when the difference in the number of nodes of adjacent sub-relationship graphs is greater than or equal to a preset threshold, Fig.11 As shown, Fig.11 The sub-relationship graph shown in (a) contains 5 business nodes, the link length is 4, and Fig.11 The sub-relationship graph shown in (b) contains 2 business nodes and the link length is 1.

[0158] The cutting device performs cutting verification. The cutting device can set the link length parameter of the preset sub-relationship graph. The cutting determination device can adjust the length of the link in the adjacent sub-relationship graph according to the link length parameter to obtain the following Fig.12 The cutting result is shown. Fig.12 The sub-relationship graph shown in (a) contains 4 business nodes, and the link length is 4. Fig.12 The sub-relationship graph shown in (b) contains 3 business nodes and the link length is 2.

[0159] In one practicable manner, when the structural differences of adjacent sub-relationship graphs do not meet the preset conditions, the graph cutting device can adjust the adjacent sub-relationship graphs so that the structural differences of the adjusted adjacent sub-relationship graphs meet the preset conditions. In this way, the sub-relationship graphs determined by the graph cutting device are more conducive to reading and application.

[0160] For example, Fig.13 A complete flow chart of the graph cutting method is shown.

[0161] First, the graph cutting device determines whether there are any service nodes that are not included in the sub-relationship graph in the node relationship graph of the area to be cut (that is, determines whether there are any untraversed links in the total link graph).

[0162] When there are business nodes in the node relationship graph of the area to be split that are not included in the sub-relationship graph, the graph cutting device determines the first business node based on the location information of the business node (when the first business node is the starting business node, the graph cutting starting point is selected in the endpoint), and determines the segmentation direction based on the location information of the first business node (that is, the graph cutting traversal direction is selected according to the endpoint type).

[0163] Then, the graph cutting device adds the business node connected to the first business node to the first sub-relationship graph (ie, selects the link connected to the first business node and adds the link to the first graph cutting link), and determines whether the first sub-relationship graph exceeds the preset sub-area range.

[0164] When the first sub-relationship graph exceeds the preset sub-area range, the graph cutting device removes the business node connected to the first business node in the first sub-relationship graph out of the first sub-relationship graph, and determines that the first sub-relationship graph is the first sub-relationship graph in the graph cutting result (that is, the first graph cutting link is added to the graph cutting result of the total graph cutting link). Then, the graph cutting device removes the business node in the first sub-relationship graph in the node relationship graph of the area to be cut, and restarts to determine whether there are business nodes in the node relationship graph of the area to be cut that are not included in the sub-relationship graph.

[0165] When the first sub-relationship graph does not exceed the preset sub-region range, it is determined whether there is a branch node in the first sub-relationship graph.

[0166] When there is a branch node in the first sub-relationship graph, the graph cutting device obtains the business node connected to the branch node, and adds the business node connected to the branch node to the first sub-relationship graph (i.e., selects the link connected to the branch point, and adds the link to the first graph cutting link). Then, the graph cutting device determines whether the first sub-relationship graph exceeds the preset sub-area range.

[0167] When the first sub-relationship graph exceeds the preset sub-region range, the graph cutting device removes the business node connected to the branch node in the first sub-relationship graph from the first sub-relationship graph, and determines the branch point as the starting business node of the second sub-relationship graph. Then, the graph cutting device determines whether there is a business node connected to the branch point that is not included in the sub-relationship graph in the node relationship graph of the to-be-split region (i.e., determines whether there is an untraversed link connected to the branch point in the total link graph).

[0168] When there is a service node connected to the branch point that is not included in the sub-relationship graph in the node relationship graph of the area to be segmented, the graph segmentation device re-determines whether there is a branch node in the first sub-relationship graph.

[0169] When there is no service node connected to the branch point that is not included in the sub-relationship graph in the node relationship graph of the area to be segmented, the graph cutting device restarts to determine whether there is a service node that is not included in the sub-relationship graph in the node relationship graph of the area to be segmented.

[0170] In the case that the first sub-relationship graph does not exceed the preset sub-region range, the graph cutting device obtains the business node indirectly connected to the branch node (i.e., obtains the link indirectly connected to the branch point, i.e., the next business node of the business node connected to the branch node). Then, the graph cutting device adds the business node indirectly connected to the branch node to the first sub-relationship graph (i.e., selects the link indirectly connected to the branch point, and adds the link to the first graph cutting link). Then, the graph cutting device re-determines whether the first sub-relationship graph exceeds the preset sub-region range.

[0171] In the case that there is no branch node in the first sub-relationship graph, the graph cutting device determines whether the second service node connected to the service node in the first sub-relationship graph exceeds the range of the preset sub-region.

[0172] In the case where the second business node connected to the business node in the first sub-relationship graph exceeds the range of the preset sub-area, the graph cutting device moves the business node connected to the business node in the first sub-relationship graph out of the first sub-relationship graph. Then the graph cutting device performs a graph cutting check. When the structural difference of adjacent sub-relationship graphs meets the preset conditions, the graph cutting device determines that the first sub-relationship graph is the first sub-relationship graph in the graph cutting result. When the structural difference of adjacent sub-relationship graphs does not meet the preset conditions, the graph cutting device adjusts the adjacent sub-relationship graphs. Then, the graph cutting device restarts to determine whether there are business nodes that are not included in the sub-relationship graph in the node relationship graph of the area to be cut.

[0173] When the second service node connected to the service node in the first sub-relationship graph does not exceed the range of the preset sub-region, the graph cutting device determines whether there is a service node connected to the second service node that is not included in the sub-relationship graph in the node relationship graph of the to-be-cut region.

[0174] In the case where there is a service node connected to the second service node that is not included in the sub-relationship graph in the node relationship graph of the area to be segmented, the graph segmentation device obtains the service node connected to the second service node along the segmentation direction and sets the starting service node of the second sub-relationship graph. Then, the graph segmentation service device determines the segmentation direction of the second sub-relationship graph according to the position information of the starting service node of the second sub-relationship graph.

[0175] When there is no service node connected to the second service node that is not included in the sub-relationship graph in the node relationship graph of the area to be segmented, the graph segmentation device restarts to determine whether there is a service node that is not included in the sub-relationship graph in the node relationship graph of the area to be segmented.

[0176] The graph cutting is completed until there are no business nodes that are not included in the sub-graph in the node relationship graph of the area to be cut.

[0177] Exemplarily, the graph cutting process is explained by taking the starting node as an example to represent the business node with the largest longitude.

[0178] The node relationship graph of the area to be segmented determines the starting service node A, service node A is connected to service node B, and the graph segmentation device determines whether service node B is a branch node.

[0179] When service node B is not a branch node, the graph cutting device obtains service node C connected to service node B, and adds service node C to the first sub-relationship graph. Then, the graph cutting device determines whether the first sub-relationship graph at this time exceeds the preset area range.

[0180] When the first sub-relationship graph exceeds the preset area at this time, the graph cutting device moves the service node B out of the first sub-relationship graph and determines the service node B as the starting point of the second sub-relationship graph.

[0181] When the first sub-relationship graph at this time does not exceed the preset area range, the graph cutting device uses the service node C as the starting node and repeats the above process.

[0182] When service node B is a branch node, the graph cutting device obtains service node C and service node D connected to service node B. The graph cutting device first adds service node C to the first sub-relationship graph, and then determines whether the first sub-relationship graph at this time exceeds the preset area range.

[0183] When the first sub-relationship graph exceeds the preset area at this time, the graph cutting device moves the service node C out of the first sub-relationship graph and determines the service node B as the starting point of the second sub-relationship graph.

[0184] When the first sub-relationship graph does not exceed the preset area, the graph cutting device uses the service node C as the starting node. Then, the graph cutting device adds the service node D to the first sub-relationship graph and repeats the above process.

[0185] The above mainly introduces the solution provided by the embodiment of the present application from the perspective of the method. In order to realize the above functions, it includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0186] The embodiment of the present application can divide the functional modules of the image cutting device according to the above method example. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. Optionally, the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation.

[0187] Fig.14 FIG. 1 is a schematic diagram showing the structure of a picture cutting device provided in an embodiment of the present application. Fig.14 As shown, the image cutting device includes: a communication unit 1401 and a processing unit 1402;

[0188] The communication unit 1401 is used to obtain a node relationship diagram of the area to be divided; the node relationship diagram includes multiple business nodes and the business relationship between each business node; the processing unit 1402 is used to divide the sub-area to which each business node belongs according to the business relationship of each business node to obtain a sub-relationship diagram corresponding to each sub-area; any two adjacent sub-relationship diagrams include at least one identical business node.

[0189] Optionally, processing unit 1402 is specifically used to: divide the first sub-region to which the first business node belongs according to the business relationship of the first business node to obtain a first sub-relationship graph corresponding to the first sub-region; the first sub-relationship graph includes business nodes that have a business relationship with the first business node; determine the second business node from the first sub-relationship graph; the second business node has a business relationship with business nodes other than the first sub-relationship graph; divide the second sub-region to which the second business node belongs according to the business relationship of the second business node to obtain a second sub-relationship graph corresponding to the second sub-region; the second sub-relationship graph includes business nodes that have a business relationship with the second business node, and does not include nodes other than the second business node in the first sub-relationship graph; repeat the above operations until the sub-relationship graph corresponding to each sub-region is determined.

[0190] Optionally, the processing unit 1402 is specifically used to: obtain, for each business node, a required area size of a sub-area to which the business node belongs; determine the range of the sub-area according to the required area size, and divide the sub-area according to the range of the sub-area to obtain a sub-relationship graph corresponding to the sub-area; the sub-relationship graph includes business nodes that have a business relationship with the business node and business nodes that do not have a business relationship with the business node within the range of the sub-area.

[0191] Optionally, in the case where the first business node is the starting business node, the processing unit 1402 is specifically used to: determine the splitting direction of the sub-area to which the starting business node belongs based on the location information of the starting business node; and split the sub-area to which the starting business node belongs based on the splitting direction and the business relationship of the starting business node to obtain a sub-relationship graph to which the starting business node belongs.

[0192] Optionally, the processing unit 1402 is further configured to determine a starting service node according to position information of each service node in the node relationship graph.

[0193] Optionally, after the sub-area to which each business node belongs is divided according to the business relationship of each business node to obtain a sub-relationship graph corresponding to each sub-area, the processing unit 1402 is also used to mark the same business nodes included in any two adjacent sub-relationship graphs to associate any two adjacent sub-relationship graphs.

[0194] Optionally, after the sub-region to which each business node belongs is divided according to the business relationship of each business node to obtain the sub-relationship graph corresponding to each sub-region, the processing unit 1402 is also used to adjust the adjacent sub-relationship graphs when the structural difference of adjacent sub-relationship graphs does not meet the preset conditions, so that the structural difference of the adjusted adjacent sub-relationship graphs meets the preset conditions; the preset conditions include: the difference in the number of nodes of adjacent sub-relationship graphs is less than a preset threshold, and the complexity of the links of adjacent sub-relationship graphs is less than a preset complexity; the links are used to indicate that there is a business relationship between the business nodes.

[0195] The embodiment of the present application also provides a computer-readable storage medium, which includes computer-executable instructions. When the computer-executable instructions are executed on a computer, the computer executes the image cutting method provided in the above embodiment.

[0196] The embodiment of the present application also provides a computer program, which can be directly loaded into a memory and contains software code. After being loaded and executed by a computer, the computer program can implement the image cutting method provided in the above embodiment.

[0197] Those skilled in the art should be aware that in one or more of the above examples, the functions described in this application can be implemented using hardware, software, firmware, or any combination thereof. When implemented using software, these functions can be stored in a computer-readable medium or transmitted as one or more instructions or codes on a computer-readable medium. Computer-readable media include computer-readable storage media and communication media, wherein communication media include any media that facilitates the transmission of computer programs from one place to another. Storage media can be any available media that can be accessed by general or special-purpose computers.

[0198] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0199] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of the modules or units is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. Another point is that the coupling or direct coupling or communication connection between each other shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms. The unit described as a separate component may or may not be physically separated, and the component displayed as a unit may be a physical unit or multiple physical units, that is, it may be located in one place, or it may be distributed in multiple different places. Some or all of the units can be selected according to actual needs to achieve the purpose of the scheme of this embodiment.

[0200] In addition, each functional unit in each embodiment of the present application can be integrated into a processing unit, or each unit can exist physically alone, or two or more units can be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of a software functional unit. If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on such an understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the general technology or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium, including several instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor (processor) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a U disk, a mobile hard disk, a ROM, a RAM, a disk, or an optical disk.

[0201] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A method for cutting a picture, characterized in that: The method comprises: Obtaining a node relationship diagram of the area to be segmented; the node relationship diagram includes multiple business nodes and business relationships between each business node; According to the business relationship of each business node, the sub-area to which each business node belongs is divided to obtain a sub-relationship graph corresponding to each sub-area; any two adjacent sub-relationship graphs include at least one identical business node.

2. The method according to claim 1, characterized in that According to the business relationship of each business node, the sub-area to which each business node belongs is divided to obtain a sub-relationship graph corresponding to each sub-area, including: According to the service relationship of the first service node, a first sub-region to which the first service node belongs is divided to obtain a first sub-relationship graph corresponding to the first sub-region; the first sub-relationship graph includes service nodes having a service relationship with the first service node; Determine a second service node from the first sub-relationship graph; the second service node has a service relationship with service nodes outside the first sub-relationship graph; According to the business relationship of the second business node, the second sub-region to which the second business node belongs is divided to obtain a second sub-relationship graph corresponding to the second sub-region; the second sub-relationship graph includes business nodes having business relationships with the second business node, and does not include nodes other than the second business node in the first sub-relationship graph; The above operation is repeated until the sub-relationship graph corresponding to each sub-region is determined.

3. The method according to claim 1, characterized in that: According to the service relationship of each service node, the sub-area to which each service node belongs is divided to obtain a sub-relationship graph corresponding to each sub-area, including: For each of the service nodes, obtaining a required area size of a sub-area to which the service node belongs; The scope of the sub-region is determined according to the required area size, and the sub-region is divided according to the scope of the sub-region to obtain a sub-relationship graph corresponding to the sub-region; the sub-relationship graph includes business nodes that have a business relationship with the business node and business nodes that do not have a business relationship with the business node within the scope of the sub-region.

4. The method according to claim 2, characterized in that: In the case where the first service node is a starting service node, dividing the first sub-region to which the first service node belongs according to the service relationship of the first service node to obtain a first sub-relationship graph corresponding to the first sub-region includes: Determining a division direction of the sub-area to which the starting service node belongs according to the location information of the starting service node; The sub-area to which the starting service node belongs is divided according to the division direction and the service relationship of the starting service node, so as to obtain a sub-relationship graph to which the starting service node belongs.

5. The method according to claim 4, characterized in that The method further comprises: The starting service node is determined according to the position information of each service node in the node relationship graph.

6. The method according to claim 3, characterized in that After the sub-region to which each service node belongs is divided according to the service relationship of each service node to obtain a sub-relationship graph corresponding to each sub-region, the method further includes: The same service nodes included in the any two adjacent sub-relationship graphs are marked to associate the any two adjacent sub-relationship graphs.

7. The method according to claim 3, characterized in that After the sub-region to which each service node belongs is divided according to the service relationship of each service node to obtain a sub-relationship graph corresponding to each sub-region, the method further includes: When the structural difference between adjacent sub-relationship graphs does not meet the preset conditions, the adjacent sub-relationship graphs are adjusted so that the structural difference between the adjusted adjacent sub-relationship graphs meets the preset conditions; the preset conditions include: the difference in the number of nodes of adjacent sub-relationship graphs is less than a preset threshold, and the complexity of the links of adjacent sub-relationship graphs is less than a preset complexity; the links are used to indicate that there is a business relationship between the business nodes.

8. A picture cutting device, characterized in that: The device comprises: a communication unit and a processing unit; The communication unit is used to obtain a node relationship diagram of the area to be segmented; the node relationship diagram includes multiple service nodes and the service relationship between each service node; The processing unit is used to divide the sub-area to which each business node belongs according to the business relationship of each business node to obtain a sub-relationship graph corresponding to each sub-area; any two adjacent sub-relationship graphs include at least one identical business node.

9. A picture cutting device, characterized in that: include: A processor and a memory; wherein the memory is used to store one or more programs, and the one or more programs include computer-executable instructions. When the device is running, the processor executes the computer-executable instructions stored in the memory to enable the device to perform the method described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: When the computer-executable instructions stored in the computer-readable storage medium are executed by a processor of a graphics cutting device, the graphics cutting device can execute the method as claimed in any one of claims 1 to 7.

11. A computer program product, characterized in that The computer program product comprises: a computer program or instructions, and when the computer program or instructions are run on a computer, the computer is caused to perform the method according to any one of claims 1 to 7.

Images