A method, system and storage medium for neat wiring of electrical boxes based on house types

Abstract

The present invention discloses a method, system and storage medium for neatly wiring electrical boxes based on house types. The present invention generates a 2D grid for a room, extracts multiple points for path selection in the room, abstracts the room as a 2D grid, eliminates the environmental impact of rooms of different house types, improves the abstraction level, makes the performance stable and easy to understand, and can be modified personalized according to specific services. And an entrance and multiple exits are specified in the 2D grid, thereby simulating multiple feasible basic paths in the room, laying a foundation for free wiring, making the reusability good and easy to expand, and at the same time making full use of the room space to effectively improve the wiring effect. On this basis, multiple paths are continuously merged to obtain a prefix tree under the house type, realizing the orderly arrangement of multiple paths to ensure the accuracy rate when paths are merged, and extracting each branch path through the conversion of the prefix tree to a ternary tree, and obtaining the final wiring based on the offset of the branch path.

Description

Technical Field

[0001] This application belongs to the field of intelligent generation of decoration design, and particularly relates to a method, system and storage medium for neatly wiring electrical boxes based on house types. Background Art

[0002] The decoration of water and electricity belongs to the concealed project decoration in the decoration industry. It is invisible after decoration and the effect cannot be changed. The placement position of the water and electricity model and its pipeline layout need to comply with certain national standards and industry practices, and generally are constructed on-site by experienced water and electricity workers. Decoration design software came into being precisely under the impetus of this demand, and with the development of computer graphics and computer vision technologies, its application scenarios are also becoming wider and wider.

[0003] Decoration design software is a software that applies computer graphics to the field of decoration. However, currently, during the design process using decoration design software, the vast majority relies on manual design and lacks intelligent generation functions. Specifically for the water and electricity decoration in decoration design software, users must spend a lot of energy on placing and adjusting models, establishing and adjusting the relationships between models, and arranging and adjusting pipelines. There are different national standards for different types of lines, different layout methods for different house types, different needs for different users, and even differences in rules for layout due to different habits in different regions, and these different intelligent generation methods are not clearly restricted by national standards.

[0004] In the decoration of water and electricity, the wiring of electrical boxes is a very important part of power wiring. For the wiring of electrical boxes, many conduit pipes will be branched out from the electrical box, and these conduit pipes are required to be neat, horizontal and vertical, and not cross. However, in the prior art, the wiring of electrical boxes still relies too much on manual wiring, resulting in low efficiency and high error rates. Summary of the Invention

[0005] One of the purposes of this application is to provide a method for neatly wiring electrical boxes based on house types, with fast electrical box wiring speed, good reusability, and high accuracy.

[0006] To achieve the above purpose, the technical solutions adopted in this application are as follows:

[0007] A method for neatly wiring electrical boxes based on house types, the method for neatly wiring electrical boxes based on house types includes:

[0008] Designate any room in the specified house type as the room where the electrical box is located, and use the breadth-first search algorithm to generate a room connectivity graph with the room where the electrical box is located as the starting point;

[0009] Generate a 2D grid for each room based on horizontal and vertical lines, and specify an entrance and multiple exits in each 2D grid;

[0010] Generate paths from the entrance to each exit in the 2D grid based on the 2D grid of each room;

[0011] Merge the same points in the multiple paths of each room to obtain a room prefix tree, and merge the same points in the room prefix trees of all rooms to obtain a floor plan prefix tree, and the head node of the floor plan prefix tree is the electrical box;

[0012] Generate a ternary tree according to the floor plan prefix tree, traverse the ternary tree from left to right to obtain multiple branch paths, and add corresponding path numbers to each branch path according to the traversal order;

[0013] Connect the points on each branch path to obtain a default wiring, and offset each default wiring according to the offset to obtain the final wiring, completing the neat wiring of the electrical box.

[0014] The following also provides several optional methods, but they are not additional limitations to the above overall solution, but only further supplements or optimizations. Without technical or logical contradictions, each optional method can be combined with the above overall solution alone, or multiple optional methods can be combined with each other.

[0015] Preferably, when generating the paths from the entrance to each exit in the 2D grid, it is completed by using a path search algorithm.

[0016] Preferably, the path search algorithm includes one or more of the depth search algorithm and the A* algorithm.

[0017] Preferably, the calculation method of the offset is as follows:

[0018] Offset = default offset * path number

[0019] Each default wiring is offset according to the offset calculation method to obtain the corresponding offset.

[0020] Through the above technical solution, by generating a 2D grid for the room and extracting multiple points for path selection in the room, the room is abstracted as a 2D grid, ignoring the environmental impact of rooms with different house types, improving the abstraction level, making the performance stable and easy to understand, and can be customized according to specific business requirements. And by specifying an entrance and multiple exits in the 2D grid, multiple basic paths feasible in the room are simulated, laying a foundation for free wiring, making the reusability good and easy to expand. At the same time, the room space is utilized to a great extent, effectively improving the wiring effect. On this basis, multiple paths are continuously merged to obtain a prefix tree for the house type, realizing the orderly arrangement of multiple paths to ensure the accuracy rate when paths are merged. And by converting the prefix tree into a ternary tree, each branch path is extracted, and the final wiring is obtained based on the offset of the branch path. Without a large amount of data calculation, the best wiring can be obtained, realizing high-speed, efficient, accurate and beautiful wiring.

[0021] The second object of the present application is to provide a neat wiring system for electrical boxes based on house types, with fast wiring speed, good effect and high accuracy rate for electrical box wiring.

[0022] To achieve the above object, the technical solution adopted by the present application is as follows:

[0023] A neat wiring system for electrical boxes based on house types, the neat wiring system for electrical boxes based on house types includes:

[0024] A connected graph generation module, which is used to specify any room in the house type as the room where the electrical box is located, and generate a room connected graph with the room where the electrical box is located as the starting point by using the breadth-first search algorithm;

[0025] A grid division module, which is used to generate a 2D grid for each room based on horizontal lines and vertical lines, and specify an entrance and multiple exits in each 2D grid;

[0026] A path generation module, which is used to generate paths from the entrance in the 2D grid to each exit based on the 2D grid of each room;

[0027] A prefix tree generation module, which is used to merge the same points in multiple paths of each room to obtain a room prefix tree, and merge the same points in the room prefix trees of all rooms to obtain a house type prefix tree, and the head node of the house type prefix tree is the electrical box;

[0028] A ternary tree generation module, which is used to generate a ternary tree according to the house type prefix tree, traverse the ternary tree from left to right to obtain multiple branch paths, and add corresponding path numbers to each branch path according to the traversal order;

[0029] A wiring module, which is used to connect the points on each branch path to obtain a default wiring, and offset each default wiring according to the offset amount to obtain the final wiring, completing the neat wiring of the electrical box.

[0030] Through the above technical solution, by generating a 2D grid for the room, extracting multiple points for path selection in the room, abstracting the room as a 2D grid, setting aside the environmental impacts of rooms with different house types, improving the abstraction level, making the performance stable and easy to understand, and allowing for personalized modification according to specific business requirements. Moreover, by specifying an entrance and multiple exits in the 2D grid, multiple feasible basic paths in the room can be simulated, laying a foundation for free wiring, making the reusability good and easy to expand. At the same time, the room space is utilized to a great extent, effectively improving the wiring effect. On this basis, multiple paths are continuously merged to obtain a prefix tree for the house type, realizing the orderly arrangement of multiple paths to ensure the accuracy rate when paths are merged, and extracting each branch path through the conversion of the prefix tree to a ternary tree. Based on the offset of the branch paths, the final wiring is obtained, achieving high-speed, efficient, accurate, and beautiful wiring without the need for a large amount of data calculation.

[0031] The third object of the present application is to provide a computer-readable storage medium that can store corresponding programs, facilitating the achievement of fast, good, and highly accurate electrical box wiring.

[0032] To achieve the above object, the technical solution adopted by the present application is as follows:

[0033] A computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it realizes the program of the electrical box neat wiring method based on the house type as described above.

[0034] Through the above technical solution, by generating a 2D grid for the room, extracting multiple points for path selection in the room, abstracting the room as a 2D grid, setting aside the environmental impacts of rooms with different house types, improving the abstraction level, making the performance stable and easy to understand, and allowing for personalized modification according to specific business requirements. Moreover, by specifying an entrance and multiple exits in the 2D grid, multiple feasible basic paths in the room can be simulated, laying a foundation for free wiring, making the reusability good and easy to expand. At the same time, the room space is utilized to a great extent, effectively improving the wiring effect. On this basis, multiple paths are continuously merged to obtain a prefix tree for the house type, realizing the orderly arrangement of multiple paths to ensure the accuracy rate when paths are merged, and extracting each branch path through the conversion of the prefix tree to a ternary tree. Based on the offset of the branch paths, the final wiring is obtained, achieving high-speed, efficient, accurate, and beautiful wiring without the need for a large amount of data calculation. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 It is a flowchart of the electrical box neat wiring method based on the house type of the present application;

[0036] Figure 2 This is the floor plan in an embodiment of the present application;

[0037] Figure 3 This is based on the present application Figure 2 The room connection diagram generated from the floor plan in;

[0038] Figure 4 This is the 2D grid schematic diagram in an embodiment of the present application;

[0039] Figure 5 This is the path schematic diagram in an embodiment of the present application;

[0040] Figure 6 This is based on the present application Figure 5 The room prefix tree merged with the path in as an example;

[0041] Figure 7 This is the schematic diagram of a ternary tree in an embodiment of the present application;

[0042] Figure 8 This is the default wiring schematic diagram of the present application;

[0043] Figure 9 It is based on Figure 8 The final wiring schematic diagram obtained after offsetting the default wiring in;

[0044] Figure 10 This is the wiring effect diagram of neat wiring of the electrical box in the present application. Detailed implementation manners

[0045] Next, the technical solutions in the embodiments of the present application will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present application without creative efforts shall fall within the protection scope of the present application.

[0046] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the technical field to which the present application belongs. The terms used in the specification of the present application herein are only for the purpose of describing specific embodiments and are not intended to limit the present application.

[0047] Currently, the technical requirements for electrical box wiring are high and the operation is complex. Therefore, it has become an inevitable trend to automatically achieve neat wiring of the electrical box. This embodiment provides a method for neat wiring of the electrical box based on the floor plan, realizing neat, fast, accurate, and non-crossing pipeline wiring of the electrical box.

[0048] For the convenience of understanding this application, the basic concepts in the electrical box wiring are first explained as follows: Electrical box: including the main electrical box, weak electrical box, etc., providing main electrical and weak electrical functions. Electrical appliances: using electricity and connected to the electrical box, such as televisions, refrigerators, wired telephones, network interfaces. Circuit: A circuit breaker in the electrical box controls one circuit. Electrical box wire splitting: The electrical box splits into dozens of wires, which are connected to electrical appliances, and each wire represents one circuit.

[0049] As Figure 1 shown, the method for neatly wiring the electrical box based on the house type in this embodiment includes the following steps:

[0050] Step 1: Designate any room in the house type as the room where the electrical box is located, and use the breadth-first search algorithm to generate a room connectivity graph with the room where the electrical box is located as the starting point.

[0051] As Figure 2 shown, the house type diagram usually contains information such as floors, rooms, doors, walls, etc., and a house type contains multiple rooms, such as bathrooms, living and dining rooms, balconies, elderly rooms, kitchens, secondary bedrooms, and studies. In the electrical box wiring, the electrical box is placed in a certain room, and this room can be any room. To other rooms from this room, a connectivity graph is required. Therefore, a room connectivity graph can be generated using the breadth-first search algorithm with the room where the electrical box is placed as the starting point according to the connection method. The connection method between rooms is through doors, room dividing lines, etc., and other connection methods can also be specified.

[0052] For example, for the house type shown in Figure 2 , if the living and dining room is the room where the electrical box is located and the door is used as the connection method, the generated room connectivity graph is as shown in Figure 3 (left). The rooms connected to the living and dining room are the bathroom, balcony, study, and kitchen. Downward, the rooms connected to the kitchen are the elderly room and the secondary bedroom. If the kitchen is the room where the electrical box is located and the door is used as the connection method, the generated room connectivity graph is as shown in Figure 3 (right). The rooms connected to the kitchen are the secondary bedroom, elderly room, and living and dining room. Downward, the rooms connected to the living and dining room are the bathroom, study, and balcony.

[0053] Step 2: Generate a 2D grid for each room based on horizontal and vertical lines, and specify an entrance and multiple exits in each 2D grid.

[0054] Due to the irregular shape of the rooms, the rooms in the house type are often irregular polygons. Therefore, for the convenience of neat wiring, this embodiment uses horizontal and vertical lines to generate a 2D grid, that is, the room is divided by horizontal and vertical lines. Therefore, various styles of rooms can be abstracted into a 2D grid, reducing the original influence of the house type rooms through a highly abstract way, and improving the reusability of the wiring method of this application.

[0055] When generating a 2D grid, without any restrictions on the number of horizontal and vertical lines and the line spacing in the 2D grid, on the premise of ensuring that there is a preset number of grid intersection points in the room. The spacing between two adjacent horizontal lines in the same room can be the same or different, and similarly, the spacing between two adjacent vertical lines can be the same or different. It is necessary to ensure that there is a preset number of grid intersection points in the room to lay the foundation for subsequent path generation. The preset number can be, for example, 10, 20, etc. When generating the 2D grid, horizontal and vertical lines can be randomly generated, and as long as the quantity condition is met, it can be used.

[0056] As Figure 4 shown, each room in the housing type corresponds to a 2D grid. In the 2D grid, a room has one entrance (starting point) and multiple exits (ending points). Among them, the entrance can be an electrical box, a door, or a dividing line. The exits can be doors, dividing lines, or electrical appliances. The dividing lines are the horizontal and vertical lines, and the intersection positions of the dividing lines and the room boundary can be used as either the entrance or the exit.

[0057] In this embodiment, the electrical box and electrical appliances are abstracted as the starting point and ending point in the 2D grid to prepare for finding the path later and facilitate data processing. And in this embodiment, the housing type is abstracted as a 2D grid, and the specified entrance and exit are freely selected in the 2D grid, making the wiring method of this embodiment highly flexible and having a better fit in various wiring scenarios, with strong applicability.

[0058] Step 3: Based on the 2D grid of each room, generate the path from the entrance to each exit in the 2D grid.

[0059] The 2D grid belongs to the category of graphs. The 2D grid contains graphs, points, and lines, and has been highly abstracted. Abstract processing can reduce the limitations of the housing type or habits in automatic wiring and obtain a neat and unified wiring result.

[0060] Generating the path is the path search of the graph, which can be completed using path search algorithms, such as depth search algorithm, A* algorithm, etc. And to ensure the validity of the path, invalid points in the 2D grid can be excluded before finding the path, such as points outside the room or points too close to the room contour line.

[0061] From one starting point to one ending point, there can be multiple paths. Sort them according to specific rules and select a suitable path. Since a room can have one starting point and multiple ending points, there will be multiple paths.

[0062] As Figure 5As shown in the figure, a point can have 4 adjacent points on its top, bottom, left, and right. For example, B is the upper adjacent point of C, and R, L, and H are the lower, left, and right adjacent points of G respectively. It is easy to understand that if the adjacent point in a certain direction of a point is discarded during the invalid point exclusion, it is considered that there is no corresponding adjacent point in this direction for the point in the path planning of this embodiment, but the adjacent point in the corresponding direction exists in the overall grid.

[0063] Set Figure 5 In this example, the starting point is N and the ending points are C, J, and M. Based on this, the depth-first search algorithm and the A* algorithm are used to find the path from the starting point to the ending points. For example, the paths found in this embodiment are as follows:

[0064] The path from N to J is: N > L > G > H > J.

[0065] The path from N to C is: N > L > G > R > F > E > D > A > P > B > C.

[0066] The path from N to M is: N > L > G > R > F > K > M.

[0067] In this embodiment, ">" represents the transfer of the path. Figure 5 The points A, P, B, S, D, E, F, R, G, H, K, L are the points on the paths involved in the above path planning.

[0068] Step 4: Merge the same points in the multiple paths of each room to obtain a room prefix tree, and then merge the same points in the room prefix trees of all rooms to obtain a house type prefix tree, and the head node of the house type prefix tree is the electrical box.

[0069] When generating the room prefix tree, each room is processed separately to merge the paths. The prefix tree is used to merge the same points in the paths, and one room is merged to obtain one prefix tree. Taking the paths from N to J, from N to C, and from N to M found in Step 3 as examples, the room prefix trees obtained after merging are as Figure 6 shown.

[0070] After merging each room, all the rooms are merged again. The prefix trees of different rooms are merged into a large prefix tree, which is the house type prefix tree, and the head node of this prefix tree is the electrical box. Through the merging of the paths, the points corresponding to the entrance and the points corresponding to the exit in the 2D grid can be clearly represented, which is convenient for checking the correctness of the prefix tree and path sorting.

[0071] Step 5: Generate a ternary tree according to the house type prefix tree, traverse the ternary tree from left to right to obtain multiple branch paths, and add corresponding path numbers to each branch path according to the traversal order.

[0072] To facilitate sorting out the paths, in this embodiment, a ternary tree is generated from the house type prefix tree. As Figure 7(As shown in the figure above), in the 2D grid, according to the path order of the nodes, a point has a parent node and three child nodes, namely left, middle, and right, so it is called a ternary tree.

[0073] Taking Figure 7 (the ternary tree shown in the figure below) as an example, traversing the ternary tree from left to right sequentially obtains multiple paths. These paths exactly correspond to the outlet order of multiple branch lines of the electrical box, and a path number is added to each obtained path according to the traversal order. The path numbers and paths obtained from the ternary tree in the figure are: the path with path number 0 is A - B - E - K; the path with path number 1 is A - B - E - L; the path with path number 2 is A - C - F - M - N; the path with path number 3 is A - D - G - P.

[0074] It should be noted that Figure 5 , 6 and Figure 7 are all for indicating the corresponding content, and the letters used in their indication have no correlation, that is, Figure 5 , 6 the next point of point P in the figure is B, but Figure 7 the previous point of point B in the figure is A, and the two are independently indicated.

[0075] Step 6: Connect the points on each branch line path to obtain the default wiring, and offset each default wiring according to the offset amount to obtain the final wiring, completing the neat wiring of the electrical box.

[0076] Based on the points in the 2D grid, connecting the points on each branch line path as the default wiring. Since there are the same points in different paths, the default wiring must overlap. Therefore, it is necessary to offset the position of the default wiring. To ensure the regularity of the offset wiring, in this embodiment, each default wiring is set to have its own corresponding offset amount, and the offset amount is calculated as the product of the default offset amount and the path number, that is, offset amount = default offset amount * path number, and each default wiring is offset according to the offset amount calculation method to obtain the corresponding offset amount. The default offset amount is a preset value, which can be set according to actual needs, for example, it is 1 times the width of the electrical box connection line.

[0077] As Figure 8 shown, the dotted lines in the figure represent the grid paths, and there are three default wirings from the electrical box to the socket, from the electrical box to the wall lamp, and from the electrical box to the switch. As Figure 9 shown, the solid lines in the figure represent the paths after offset, and each path represents a wiring. Each wiring does not overlap, does not cross, and is very neat.

[0078] The method for neatly wiring the electrical box in this embodiment has strong logic and strong feasibility; and it is fully automated, the result data is accurate, the effect is good, and it can generate a neat and orderly wiring effect as Figure 10 shown.

[0079] It should be noted that in this embodiment, the Figure 2 and Figure 10 are schematic diagrams of the interface effects during software operation, which are only used to illustrate the distribution of house types and the wiring effects of electrical boxes. The structural content in the figures has no restrictive effect on the solution of this application. Therefore, the detailed content in the figures will not be elaborated.

[0080] The technical features of the above-described embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered to be within the scope described in this specification.

[0081] The above-described embodiments only represent several implementation manners of this application, and their descriptions are relatively specific and detailed. However, it should not be construed as a limitation on the scope of the invention patent. It should be noted that for those of ordinary skill in the art, without departing from the concept of this application, several modifications and improvements can still be made, and these all belong to the protection scope of this application. Therefore, the protection scope of the patent of this application shall be subject to the appended claims.

Claims

1. A method for neatly wiring electrical boxes based on house types, characterized in that, the method for neatly wiring electrical boxes based on house types includes: Designating any room in a specified house type as the room where the electrical box is located, and generating a room connectivity graph starting from the room where the electrical box is located using the breadth-first search algorithm; Generating a 2D grid for each room based on horizontal and vertical lines, designating an entrance and multiple exits in each 2D grid, and allowing the intersection points of the horizontal lines with the room boundaries to be designated as entrances or exits, and allowing the intersection points of the vertical lines with the room boundaries to be designated as entrances or exits; Generating paths from the entrance to each exit in the 2D grid based on the 2D grid of each room; Merging the same points in the multiple paths of each room to obtain a room prefix tree, and merging the same points in the room prefix trees of all rooms to obtain a house type prefix tree, and the head node of the house type prefix tree is the electrical box; Generating a ternary tree according to the house type prefix tree, traversing the ternary tree from left to right to obtain multiple branch paths, and adding corresponding path numbers to each branch path in the traversal order; Connecting the points on each branch path to obtain a default wiring, and offsetting each default wiring according to the offset amount to obtain the final wiring, completing the neat wiring of the electrical box, and the final wiring does not overlap and does not cross.

2. The method for neatly wiring electrical boxes based on house types according to claim 1, characterized in that, when generating the paths from the entrance to each exit in the 2D grid, it is completed using a path search algorithm.

3. The method for neatly wiring electrical boxes based on house types according to claim 2, characterized in that, the path search algorithm includes one or two of the depth-first search algorithm and the A* algorithm.

4. The method for neatly wiring electrical boxes based on house types according to claim 1, characterized in that, the calculation method of the offset amount is: Offset amount = default offset amount * path number Each default wiring is offset according to the offset amount calculation method to obtain the corresponding offset amount.

5. A system for neatly wiring electrical boxes based on house types, characterized in that, the system for neatly wiring electrical boxes based on house types includes: A connectivity graph generation module for designating any room in a specified house type as the room where the electrical box is located, and generating a room connectivity graph starting from the room where the electrical box is located using the breadth-first search algorithm; A grid division module for generating a 2D grid for each room based on horizontal and vertical lines, designating an entrance and multiple exits in each 2D grid, and allowing the intersection points of the horizontal lines with the room boundaries to be designated as entrances or exits, and allowing the intersection points of the vertical lines with the room boundaries to be designated as entrances or exits; A path generation module for generating paths from the entrance to each exit in the 2D grid based on the 2D grid of each room; A prefix tree generation module for merging the same points in the multiple paths of each room to obtain a room prefix tree, and merging the same points in the room prefix trees of all rooms to obtain a house type prefix tree, and the head node of the house type prefix tree is the electrical box; A ternary tree generation module for generating a ternary tree according to the house type prefix tree, traversing the ternary tree from left to right to obtain multiple branch paths, and adding corresponding path numbers to each branch path in the traversal order; The wiring module is used to connect the points on each branch path to obtain the default wiring, and offset each default wiring according to the offset amount to obtain the final wiring, so as to complete the neat wiring of the electrical box, and the final wiring does not overlap and does not cross.

6. The neat wiring system for electrical boxes based on house types as described in claim 5, wherein, when generating the paths from the entrances to each exit in the 2D grid, it is completed by using a path search algorithm.

7. The neat wiring system for electrical boxes based on house types as described in claim 6, wherein, the path search algorithm includes one or both of the depth search algorithm and the A* algorithm.

8. The neat wiring system for electrical boxes based on house types as described in claim 5, wherein, the calculation method of the offset amount is: Offset amount = default offset amount * path sequence number Each default wiring is offset according to the offset amount obtained by the offset amount calculation method.

9. A computer-readable storage medium, on which a computer program is stored, wherein, when the computer program is executed by a processor, it implements the steps of the method described in any one of claims 1 to 4.

Images