Design intention-based building engineering geometric constraint solving method and system

Abstract

The invention relates to the technical field of constructional engineering digital design, and particularly discloses a constructional engineering geometric constraint solving method and system based on a design intention. And the high-dimensional nonlinear equation set is converted into cascade solution of a plurality of low-dimensional subsystems. A single geometric constraint system is sequentially calculated in order, and the degree of freedom corresponding to each calculation is solved, so that the calculation complexity is remarkably reduced; on one hand, for an unfixed geometric constraint system, a fixed geometric constraint condition conforming to a building design intention is added; and on the other hand, when the geometric constraint is solved, only the constrained degree of freedom of the component primitive is calculated, so that the solving result is more in line with the design intention.

Description

Technical Field

[0001] The present invention relates to the technical field of digital design of construction projects, and in particular to a method and system for solving geometric constraints of construction projects based on design intent. Background Art

[0002] As the core engine of parametric modeling, geometric constraint solving technology faces challenges in computational logic complexity and algorithmic stability. The divergent development paths of current mainstream methods reflect the inexorable entanglement between domain-specific and algorithmic characteristics. Algebraic equation-based solvers, while mathematically rigorous, offer advantages in scenarios driven by mechanical precision. However, their core drawback lies in the exponential increase in computational complexity of nonlinear equations with nested constraint levels, hindering the efficiency of solving large-scale assemblies and introducing ambiguity in multiple solutions. Graph-theoretic solution algorithms excel at topological mapping, rapidly matching constraint networks within building plans through node traversal. However, they exhibit numerical limitations when deducing surface parameters, making them unable to meet the stringent millimeter-level accuracy requirements of structural engineering. Rule-based reasoning mechanisms, while inherently dependent on a knowledge base of solidified experience, effectively verify compliance with building codes, lack agility in open parametric design. Summary of the Invention

[0003] In order to overcome the problems of multi-solution ambiguity and insufficient agility in existing geometric constraint solving, the present invention provides a method and system for solving geometric constraints of architectural engineering based on design intent.

[0004] In a first aspect, the present invention provides a method for solving geometric constraints of architectural engineering based on design intent, the method comprising: S1. Based on the constructed building model, all component primitives and geometric constraints in the building model are obtained, and a component primitive set and a geometric constraint set are generated respectively; wherein each geometric constraint records the component primitives that have a binding relationship with the geometric constraint; S2. Traversing the geometric constraint set, extracting geometric constraints with fixed relationships from the geometric constraint set, and extracting all component primitives and geometric constraints corresponding to the geometric constraints with fixed relationships from the component primitive set and the geometric constraint set according to the binding relationship, to obtain a fixed geometric constraint system; S3, repeat S2 to obtain all the fixed geometric constraint systems; S4. Generate a first set of all the fixed geometric constraint systems in order; S5. Traverse the set of component graphic elements, extract the remaining component graphic elements from the set of component graphic elements, and then extract all geometric constraints and component graphic elements corresponding to the remaining component graphic elements from the geometric constraint set and the set of component graphic elements according to the binding relationship to obtain an unfixed geometric constraint system; S6. Repeat S5 to obtain all unfixed geometric constraint systems; S7. Attach fixed constraints to the component graphic elements in the unfixed geometric constraint system based on the design intention of the building model, and then generate a second set in sequence for all the unfixed geometric constraint systems; S8. Calculate the degrees of freedom of each component graphic element in the first set and the second set in sequence to complete the solution.

[0005] According to a specific embodiment, in the above geometric constraint solving method, attaching fixed constraints to the component graphic elements in the unfixed geometric constraint system based on the design intention of the building model includes: Screen the component graphic elements in the unfixed geometric constraint system according to the design intention; Attach fixed constraints to the screened component graphic elements; Wherein, the design intention includes the relationship between the component graphic elements and the coordinate system.

[0006] According to a specific embodiment, in the above geometric constraint solving method, the fixed relationship includes geometric constraints bound to the coordinate system, fixed points or related component graphic elements.

[0007] According to a specific embodiment, in the above geometric constraint solving method, S8 specifically includes: S81. Calculate the degrees of freedom of the component graphic elements corresponding to the geometric constraints in the first set or the second set in sequence; wherein, the degrees of freedom of the remaining unbound component graphic elements remain the same as the initial conditions; S82. Based on the component graphic elements calculated in S81, find the corresponding next geometric constraint and calculate the degrees of freedom of the other component graphic elements corresponding to the next geometric constraint until the degrees of freedom of all component graphic elements are calculated.

[0008] According to a specific embodiment, in the above geometric constraint solving method, based on the calculations of S81 and S82, if there are geometric constraints on the same degree of freedom of the same component graphic element, it corresponds to redundant constraints.

[0009] According to a specific embodiment, in the above geometric constraint solving method, based on the calculations of S81 and S82, if there are geometric constraints conflicting with the corresponding constraint conditions, stop the calculation and issue a conflict prompt.

[0010] According to a specific implementation, in the above geometric constraint solving method, the method further includes: S9. Obtain the internal information of the component primitives in the building model; the internal information includes the graphic elements of the component primitives and the geometric constraints corresponding to the graphic elements; S10. Repeat S1 to S8 to calculate the degrees of freedom of the graphic elements in the internal information, and complete the solution.

[0011] In a second aspect, the present invention provides a geometric constraint solving system for building engineering based on design intent. The system includes: An information collection module, configured to obtain all the component primitives and geometric constraints in the building model based on the constructed building model, and respectively generate a component primitive set and a geometric constraint set; wherein, each geometric constraint records the component primitives having a binding relationship with the geometric constraint; A first constraint module, configured to traverse the geometric constraint set, extract the geometric constraints having a fixed relationship from the geometric constraint set, and extract all the component primitives and geometric constraints corresponding to the geometric constraints having the fixed relationship from the component primitive set and the geometric constraint set according to the binding relationship, to obtain a fixed geometric constraint system; and, in the case of obtaining all the fixed geometric constraint systems, generate a first set in sequence for all the fixed geometric constraint systems; A second constraint module, configured to traverse the component primitive set, extract the remaining component primitives from the component primitive set, and then extract all the geometric constraints and component primitives corresponding to the remaining component primitives from the geometric constraint set and the component primitive set according to the binding relationship, to obtain an unfixed geometric constraint system; and, in the case of obtaining all the unfixed geometric constraint systems, attach fixed constraints to the component primitives in each unfixed geometric constraint system based on the design intent of the building model, and generate a second set in sequence for all the unfixed geometric constraint systems; A calculation and processing module, configured to sequentially calculate the degrees of freedom of each component primitive in the first set and the second set, and complete the solution.

[0012] According to a specific implementation, in the above geometric constraint solving system, the information collection module is further configured to obtain the internal information of the component primitives in the building model; the internal information includes the graphic elements of the component primitives and the geometric constraints corresponding to the graphic elements; The information collection module, the first constraint module, the second constraint module, and the calculation and processing module are further configured to calculate the degrees of freedom of the graphic elements in the internal information according to the internal information, and complete the solution.

[0013] According to a specific implementation, in the above geometric constraint solving system, the system further includes: A reminder processing module, which is used to correspond to redundant constraints based on the situation that there are geometric constraints in the calculation processing module for the same degree of freedom constraints of the same component primitive; and, based on the situation that there are conflicts between geometric constraints and corresponding constraint conditions in the calculation processing module, stop the calculation and issue a conflict reminder.

[0014] Compared with the prior art, the beneficial effects of the present invention are as follows: The present invention decomposes all component primitives and corresponding geometric constraints in the building model, and converts the high-dimensional non-linear equations into the cascaded solution of multiple low-dimensional subsystems. The orderly sequential calculation of a single geometric constraint system, and the corresponding degree of freedom is solved each time, significantly reducing the calculation complexity; on the one hand, for the unfixed geometric constraint system, additional fixed geometric constraint conditions that conform to the architectural design intention are added; on the other hand, when solving geometric constraints, only the degrees of freedom of the component primitive that are constrained are calculated, making the solution result more in line with the design intention. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 It is a schematic flowchart of a method for solving geometric constraints in a building project based on design intention provided by an embodiment of the present invention; Figure 2 It is a schematic flowchart of a method for solving geometric constraints in a building project based on design intention provided by another embodiment of the present invention; Figure 3 It is a schematic flowchart of solving a single geometric constraint system provided by an embodiment of the present invention; Figure 4 It is a schematic diagram of fixed geometric constraints provided by an embodiment of the present invention; Figure 5 It is a schematic diagram of redundant constraints provided by an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0016] The present invention will be further described in detail below with reference to specific embodiments. However, this should not be understood as limiting the scope of the above-mentioned subject matter of the present invention to the following embodiments. Any technology implemented based on the content of the present invention belongs to the scope of the present invention.

[0017] In the description of the specific embodiments of the present invention, without special instructions, the expressions such as "first", "second", "third", etc. in the terms are only used to distinguish the descriptions of the same or similar components, and should not be understood as emphasizing or implying the relative importance of specific components.

[0018] In geometric constraint solving, the fragmented characteristics of industry demands have put general solutions in a dilemma. The mechanical field pursues micro-precision, while the construction engineering field requires more macro-efficiency. A single algorithm framework is difficult to balance the multiple conflicting performances. These limitations in technology adaptation not only give rise to the need for independent research and development of solvers in specific fields but also point to new potential breakthrough directions. Further, the present invention adopts a hierarchical constraint strategy by predicting the design intent, enabling the algorithm to actively reduce non-critical degrees of freedom during the parsing stage and achieving the dual goals of both efficiency improvement and intent restoration.

[0019] The present invention is particularly applicable to the scenario of solving complex constraint systems in the field of construction engineering. Its core technology is to decouple engineering logic from mathematical constraints, decompose the global constraint system into multiple independent sub-problems, transform high-dimensional non-linear equation systems into multiple low-dimensional subsystems, support multi-level parallel solving, and solve the problems of long calculation time, low intent restoration degree, and high cost of multi-solution conflict correction in existing geometric constraint solvers in the field of construction engineering. It can be widely applied to links such as rapid iteration of construction plans, collaborative structural design, and automatic generation of construction drawings.

[0020] The technical solutions provided by the present invention are described and explained in detail below.

[0021] Specifically, please refer to Figure 1 , which shows a schematic flowchart of a method for solving geometric constraints in construction engineering based on design intent provided by an embodiment of the present invention. The method includes: S1. Based on the constructed building model, obtain all the component graphics and geometric constraints in the building model, and generate a component graphics set and a geometric constraint set respectively; wherein, each geometric constraint records the component graphics that have a binding relationship with the geometric constraint.

[0022] S2. Traverse the geometric constraint set, extract the geometric constraints with a fixed relationship from the geometric constraint set, and extract all the component graphics and geometric constraints corresponding to the geometric constraints with the fixed relationship from the component graphics set and the geometric constraint set according to the binding relationship, to obtain a fixed geometric constraint system.

[0023] Wherein, the fixed relationship includes geometric constraints bound to a coordinate system, a fixed point, or related component graphics.

[0024] S3. Repeat S2 to obtain all the fixed geometric constraint systems.

[0025] S4. Generate a first set in sequence for all the fixed geometric constraint systems.

[0026] S5. Traverse the set of component graphic elements, extract the remaining component graphic elements from the set of component graphic elements, and then extract all geometric constraints and component graphic elements corresponding to the remaining component graphic elements from the set of geometric constraints and the set of component graphic elements according to the binding relationship, to obtain an unfixed geometric constraint system.

[0027] S6. Repeat S5 to obtain all the unfixed geometric constraint systems.

[0028] S7. Attach fixed constraints to the component graphic elements in the unfixed geometric constraint system based on the design intention of the building model, and then generate a second set in sequence for all the unfixed geometric constraint systems.

[0029] Among them, attaching fixed constraints to the component graphic elements in the unfixed geometric constraint system based on the design intention of the building model includes: Screen the component graphic elements according to the design intention; Attach fixed constraints to the screened component graphic elements.

[0030] Specifically, the design intention includes the relationship between the component graphic elements and the coordinate system.

[0031] S8. Calculate the degrees of freedom of each component graphic element in the first set and the second set in sequence to complete the solution.

[0032] Specifically, S8 specifically includes: S81. Calculate the degrees of freedom of the component graphic elements corresponding to the geometric constraints in the first set or the second set in sequence; among them, the degrees of freedom of the remaining unbound component graphic elements remain the same as the initial conditions; S82. Based on the component graphic elements calculated in S81, find the corresponding next geometric constraint, and calculate the degrees of freedom of the other component graphic elements corresponding to the next geometric constraint until the degrees of freedom of all component graphic elements are calculated.

[0033] In a possible implementation manner, based on the calculations of S81 and S82, if there is a geometric constraint that constrains the same degree of freedom of the same component graphic element, it corresponds to a redundant constraint. And, based on the calculations of S81 and S82, if there is a conflict between the geometric constraint and the corresponding constraint condition, stop the calculation and issue a conflict prompt.

[0034] On this basis, a method for solving geometric constraints in building engineering based on design intention provided by the present invention further includes: S9. Obtain the internal information of the component graphic elements in the building model; the internal information includes the graphic elements of the component graphic elements and the corresponding geometric constraints; S10. Repeat S1 to S8 to calculate the degrees of freedom of the graphic elements in the internal information to complete the solution.

[0035] Based on the above technical solution, the present invention decomposes all the component primitives and corresponding geometric constraints in the building model, and transforms the high-dimensional non-linear equations into cascaded solutions of multiple low-dimensional subsystems. By sequentially calculating the ordered single geometric constraint system and solving the corresponding degrees of freedom each time, the computational complexity is significantly reduced. On the one hand, for the unfixed geometric constraint system, fixed geometric constraint conditions that conform to the architectural design intention are added; on the other hand, when solving the geometric constraints, only the degrees of freedom of the component primitives that are constrained are calculated, making the solution result more in line with the design intention.

[0036] The present invention will be further explained and described below in conjunction with specific embodiments.

[0037] Please refer to Figure 2 , which shows a schematic flowchart of a method for solving geometric constraints in a building project based on design intention provided by another embodiment of the present invention. Further, as described in S1 above, all the component primitives and geometric constraints arranged in the software interface are collected.

[0038] Specifically, the component primitives are collected to form a component primitive list List <element>E, that is, the set of component graphic elements. Collect all geometric constraints to form a list List <constraint>C, that is, the geometric constraint set. Among them, each geometric constraint records the component primitive Id that has a binding relationship with the geometric constraint and the constrained rules. The constrained rules include point-to-point distance, point-to-line distance, line-to-line distance, line-to-line parallelism, arc tangent to a straight line, line perpendicular to a line, etc., arc or circle diameter length, arc sagitta, distance between entities, etc. Each geometric constraint has two ends, and one end can be bound to a component primitive, point, line, surface, coordinate system, etc. For example, for a dimension constraint, it constrains the distance between the two bound endpoints. Replace the two endpoints with two parallel lines, which means constraining the distance between the lines. Replace them with two three-dimensional parallel planes, which means constraining the distance between the surfaces.

[0039] Further, as described in S2 above, sort and group the model information.

[0040] Specifically, traverse the geometric constraint set C and determine whether there is a fixed relationship in the geometric constraint, that is, whether one end is fixed (a geometric constraint bound to a coordinate system, a fixed point, or a related component primitive); if not, continue traversing; if so, extract the geometric constraint and record it in the new constraint list Ci. Through the component primitive Id recorded in this geometric constraint, traverse the component primitive list to find the corresponding component primitive with a binding relationship, and extract this component primitive and add it to the new component primitive list Ei. Then, according to this component primitive, traverse whether there are geometric constraints with a binding relationship in the geometric constraint set C. If so, repeat the above operations. That is, extract all the component primitives and geometric constraints corresponding to the geometric constraint with the fixed relationship from the component primitive set and the geometric constraint set according to the binding relationship. Finally, the fixed geometric constraint system {Ei, Ci} can be obtained.

[0041] Further, as described in S3 above, repeat S2 to obtain all the fixed geometric constraint systems.

[0042] Further, as described in S4 above, after traversing all the geometric constraints associated with the fixed coordinate system, generate the first set in sequence for all the fixed geometric constraint systems, including {E1, C1}, {E2, C2}... {En, Cn}, where n is the number of geometric constraints associated with the fixed coordinate system in the current system. It can be understood that there are several component primitives in each component primitive list Ei and several geometric constraints in the constraint list Ci.

[0043] Further, as described in S5 above, after the traversal of S2 and S3 is completed, the remaining geometric constraints and component primitives in the geometric constraint set C and the component primitive set E cannot have a direct relationship with the coordinate system or fixed points, and it is no longer necessary to determine whether one end of the geometric constraint is fixed. At this time, start traversing in the order of E, extract the remaining component primitives and record them in the new component primitive list Ei0, and then traverse the geometric constraints with binding relationships in the geometric constraint set C according to the component primitives, and record them in the new constraint list Ci0. The rest is the same as S2. Finally, the unfixed geometric constraint system {Ei0, Ci0} can be obtained. This geometric constraint system is not associated with the fixed coordinate system, has a large degree of freedom in solving, and the solution is not unique.

[0044] Further, as described in S6 above, repeat S5 to obtain all unfixed geometric constraint systems. At this time, as described in S7 above, based on the architectural engineering design intent, screen the component primitives in the unfixed geometric constraint system and attach fixed constraints to the component primitives. Specifically, the attached fixed constraint is a constraint with one end on the coordinate system and the other end on the remaining component primitives in E. This constraint makes it no longer necessary to calculate all the degrees of freedom of the component primitive, and the initial conditions can be maintained, regardless of the constraint type.

[0045] After the attachment of the constraints is completed, generate the second set in order for all unfixed geometric constraint systems, and the unfixed geometric constraint systems with attached fixed constraints can be obtained, including {E10, C10}, {E20, C20}... {En0, Cn0}.

[0046] The screening of the design intent conditions is comprehensively determined according to factors such as the degree of closeness of the relationship between the component primitive and the coordinate system. For example, whether the component primitive is parallel or tangent to the coordinate system; whether the distance from the origin of the coordinate system to the component primitive is the smallest, etc. The screened component primitives are used to attach fixed constraints, and after the fixed constraints are attached, the geometric constraint system can be calculated. The degrees of freedom of this component primitive are used as known through the initial conditions to solve other component primitives under this constraint system.

[0047] Further, as described in S8 above, solve a single geometric constraint system, that is, {Ei, Ci} or {Ei0, Ci0}.

[0048] Specifically, please refer to Figure 3 , which shows a schematic flow chart of solving a single geometric constraint system provided by an embodiment of the present invention. For a certain geometric constraint system, find the geometric constraint that is fixed at the beginning in order, solve the degrees of freedom of the component primitive corresponding to the Id that are constrained according to the constraint rules, and the remaining unbound degrees of freedom are consistent with the initial conditions (in line with the design intent). Based on the calculated component primitive, find the next geometric constraint and repeat the calculation in turn.

[0049] Specifically, please refer to Figure 4 , which shows a schematic diagram of the fixed geometric constraints provided by the embodiments of the present invention. As Figure 4 shown, the spacing E is a geometric constraint, the left end of which is fixed on the Y-axis of the coordinate system. By traversing the set of component primitives, it is found that the straight line 1 is bound to the other end of the spacing E. According to the straight line 1, by traversing the set of geometric constraints, it is found that one end of the spacing D is bound to the straight line 1, and according to the spacing D, it is found that the straight line 2 is bound to the other end of the geometric constraint. By traversing the set of geometric constraints again, it is found that no geometric constraint is bound to the straight line 2. In this way, a fixed geometric constraint system {E1, C1} is formed, where E1 {includes the straight line 1 and the straight line 2}, and C1 includes two dimensional constraints of the spacing E and the spacing D. The internal characteristics of these two dimensional constraints, that is, the components bound between the primitives are parallel, and the distance is controlled by parameters. The specific solution process is as follows: According to the relationship between the Y-axis and the straight line 1, find the straight line 1: Y-axis: X = 0; Straight line 1: A1x + B1y + C1 = 0; Constraint condition: parallel B1 = 0; then it is simplified to X = -C1 / A1 = E; According to the constraint E value. If E = 1000, then the straight line 1: X = 1000.

[0050] According to the constraint relationship between the straight line 1 and the straight line 2, find the straight line 2: A2x + B2y + C2 = 0; Straight line 1 X = 1000; Constraint condition, parallel B2 = 0; simplified x = -C2 / A2 = 1000 + D; According to the constraint D value. If D = 400, then the straight line 2: X = 1400.

[0051] If during the calculation process, it is found that a certain geometric constraint has redundant constraint situations for the same degree of freedom constraint of the same component primitive. At this time, if calculating this geometric constraint causes a conflict with the corresponding previous constraint conditions, the calculation is stopped and the user is reminded of the constraint conflict. At this time, a panel for selecting and deleting redundant constraints is popped up, and at the same time, the geometric constraints and constraint rules in the software interface are highlighted for the user to modify.

[0052] Further, referring to Figure 5 , which shows a schematic diagram of the redundant constraints provided by the embodiments of the present invention. As Figure 5 shown, if in addition to the spacings E and D, there is also a spacing F, and the straight line equation of the straight line 2 is X = F due to the spacing F; there is a redundant constraint between the straight line equation X = E + D obtained from the spacings E and D. If F = E + D, no error is reported, if F!= E + D, then an error is reported and prompted.

[0053] If there is no conflict during the calculation process, the current calculation result is returned.

[0054] Furthermore, as described in S9 above, solve the internal constraints of the component primitive.

[0055] Specifically, the component primitives calculated through internal information in construction projects generally include: shapes (extruded bodies, revolved bodies, lofted bodies, blended bodies, blended lofted bodies), blocks (two- and three-dimensional), family instances, fills, etc.; the internal information of these component primitives includes geometric constraints and graphic elements that make up the graphics.

[0056] Furthermore, as described in S10 above, repeat S1 to S8, decompose the internal information into a geometric constraint system, and calculate the degrees of freedom of the graphic elements in the internal information to complete the solution.

[0057] Specifically, the non-association of each geometric constraint system provides conditions for parallel computing by the computer: first, calculate the geometric constraint system inside the component primitive, perform parallel computing between different geometric constraint systems, and perform parallel computing between different component primitives; after the internal information of the component primitive is calculated, then perform parallel computing on the geometric constraint system in the absolute coordinate system. Finally, assemble all the calculation results to complete the calculation.

[0058] Based on the above technical solutions, the present invention mainly has the following advantages: 1. Design-intention-driven constraint completion mechanism: When there is an excess of degrees of freedom, automatically attach fixed constraints or maintain the initial values of the original degrees of freedom based on the design intention, solve the problem of the lack of design intention in traditional methods, and ensure that the solution result conforms to the original logic of the architectural design; 2. Hierarchical decoupled constraint decomposition algorithm: By decomposing the global constraint system into multiple independent sub-problems ({E1, C1},..., {En, Cn}), transforming the high-dimensional non-linear equations into a cascaded solution of multiple low-dimensional subsystems, significantly reducing the computational dimension; 3. Parallel computing architecture: Parallel computing of the internal constraint system of component primitives, parallel computing between different component primitives, and parallel solution of sub-systems without dependent constraints under the absolute coordinate system, achieving an order-of-magnitude improvement in efficiency through a multi-level parallelization strategy; 4. Conflict detection reminder and redundant constraint selection and deletion: Solve each geometric constraint system sequentially. When it is detected that the degrees of freedom of the component primitive are fixed by multiple geometric constraints and the solution results cannot be satisfied simultaneously, pop up a panel for selecting and deleting redundant constraints, and at the same time, highlight the geometric constraints and constraint rules in the software interface for easy user modification. Avoid solution failures caused by conflicts and reduce the cost of manual intervention.

[0059] On the other hand, an embodiment of the present invention further provides a geometric constraint solving system for construction engineering based on design intent. The system includes: An information collection module, configured to obtain all component graphics elements and geometric constraints in the construction model based on the constructed construction model, and respectively generate a component graphics element set and a geometric constraint set; wherein, each geometric constraint records the component graphics elements having a binding relationship with the geometric constraint; A first constraint module, configured to traverse the geometric constraint set, extract geometric constraints having a fixed relationship from the geometric constraint set, and extract all component graphics elements and geometric constraints corresponding to the geometric constraints having a fixed relationship from the component graphics element set and the geometric constraint set according to the binding relationship, to obtain a fixed geometric constraint system; and, in the case of obtaining all the fixed geometric constraint systems, generating a first set in sequence of all the fixed geometric constraint systems; A second constraint module, configured to traverse the component graphics element set, extract the remaining component graphics elements from the component graphics element set, and then extract all geometric constraints and component graphics elements corresponding to the remaining component graphics elements from the geometric constraint set and the component graphics element set according to the binding relationship, to obtain an unfixed geometric constraint system; and, in the case of obtaining all the unfixed geometric constraint systems, attaching fixed constraints to the component graphics elements in each unfixed geometric constraint system based on the design intent of the construction model, and generating a second set in sequence of all the unfixed geometric constraint systems; A calculation and processing module, configured to sequentially calculate the degrees of freedom of each component graphics element in the first set and the second set in sequence to complete the solution.

[0060] According to a specific embodiment, in the above geometric constraint solving system, the information collection module is further configured to obtain the internal information of the component graphics elements in the construction model; the internal information includes the graphic elements of the component graphics elements and the geometric constraints corresponding to the graphic elements; The information collection module, the first constraint module, the second constraint module, and the calculation and processing module are further configured to calculate the degrees of freedom of the graphic elements in the internal information according to the internal information to complete the solution.

[0061] According to a specific embodiment, in the above geometric constraint solving system, the system further includes: A reminder processing module, configured to correspond to redundant constraints in the case that there are geometric constraints on the same degree of freedom constraint of the same component graphics element in the calculation and processing module; and, in the case that there are geometric constraints conflicting with the corresponding constraint conditions in the calculation and processing module, stop the calculation and issue a conflict prompt.

[0062] It is understandable that the computing and processing module can be a Central Processing Unit (CPU) or a Microcontroller (MCU).

[0063] The computing and processing module may further include a hardware chip. The above-mentioned hardware chip can be an Application-Specific Integrated Circuit (ASIC), a Programmable Logic Device (PLD), or a combination thereof. The above-mentioned PLD can be a Complex Programmable Logic Device (CPLD), a Field-Programmable Gate Array (FPGA), a Generic Array Logic (GAL), or any combination thereof.

[0064] The computing and processing module may further include a memory for storing the above-mentioned fault information, programs of the central controller, etc. The memory may include volatile memory, such as random-access memory (RAM); the memory may also include non-volatile memory, such as flash memory, a hard disk drive (HDD), or a solid-state drive (SSD); the memory may also include a combination of the above-mentioned types of memory.

[0065] The various methods, steps, and logic block diagrams disclosed in the embodiments of the present invention can be implemented or executed. The general-purpose processor can be a microprocessor, or the processor can also be any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present invention can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers, etc. The processor reads the information in the storage medium and combines its hardware to complete the steps of the above-mentioned method.

[0066] The storage medium can be a memory, for example, it can be volatile memory or non-volatile memory, or can include both volatile and non-volatile memory.

[0067] Among them, the non-volatile memory can be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash memory.

[0068] The volatile memory can be a Random Access Memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), SyncLink DRAM (SLDRAM), and Direct Rambus RAM (DRRAM).

[0069] The storage media described in the embodiments of the present invention are intended to include, but not limited to, these and any other suitable types of memories.

[0070] It should be understood that the system disclosed in the embodiments of the present invention can be implemented in other ways. For example, the division of the units is only a logical function division, and there can be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the communication connection between the units can be through some interfaces, servers or indirect coupling or communication connections, which can be electrical or other forms.

[0071] In addition, each functional unit in the various embodiments of the present invention can be integrated in a processing unit, or each module can exist physically alone, or two or more modules can be integrated in a processing unit. The above integrated units can be implemented in the form of hardware or in the form of software functional units.

[0072] When 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 computer-readable storage medium. Based on such understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The foregoing storage medium includes: various media that can store program codes, such as USB flash drives, read-only memories (ROMs), random access memories (RAMs), mobile hard disks, magnetic disks, or optical discs.

[0073] Any embodiment or design solution described as "exemplary" or "for example" in the embodiments of the present invention should not be construed as being more preferred or having more advantages than other embodiments or design solutions. Rather, the use of words such as "exemplary" or "for example" is intended to present relevant concepts in a specific manner for easy understanding.

[0074] The foregoing are only the preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent replacements, and improvements made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.< / constraint> < / element>

Claims

1. A geometric constraint solving method for construction engineering based on design intent, characterized in that, The method includes: S1. Based on the constructed building model, obtain all the component graphic elements and geometric constraints in the building model, and generate a component graphic element set and a geometric constraint set respectively; wherein, each geometric constraint records the component graphic elements that have a binding relationship with the geometric constraint; S2. Traverse the geometric constraint set, extract the geometric constraints with a fixed relationship from the geometric constraint set, and extract all the component graphic elements and geometric constraints corresponding to the geometric constraints with the fixed relationship from the component graphic element set and the geometric constraint set according to the binding relationship, to obtain a fixed geometric constraint system; S3. Repeat S2 to obtain all the fixed geometric constraint systems; S4. Generate a first set in sequence for all the fixed geometric constraint systems; S5. Traverse the component graphic element set, extract the remaining component graphic elements from the component graphic element set, and then extract all the geometric constraints and component graphic elements corresponding to the remaining component graphic elements from the geometric constraint set and the component graphic element set according to the binding relationship, to obtain an unfixed geometric constraint system; S6. Repeat S5 to obtain all the unfixed geometric constraint systems; S7. Attach fixed constraints to the component graphic elements in the unfixed geometric constraint system based on the design intention of the building model, and then generate a second set in sequence for all the unfixed geometric constraint systems; S8. Calculate the degrees of freedom of each component graphic element in the first set and the second set in sequence to complete the solution.

2. A geometric constraint solving method for construction engineering based on design intent according to claim 1, characterized in that Attaching fixed constraints to the component graphic elements in the unfixed geometric constraint system based on the design intention of the building model includes: Screen the component graphic elements in the unfixed geometric constraint system according to the design intention; Attach fixed constraints to the screened component graphic elements; wherein, the design intention includes the relationship between the component graphic elements and the coordinate system.

3. A geometric constraint solving method for construction engineering based on design intent according to claim 1, characterized in that, The fixed relationship includes geometric constraints bound to the coordinate system, fixed points or related component graphic elements.

4. A geometric constraint solving method for construction engineering based on design intent according to claim 1, characterized in that, The specific content of S8 includes: S81. Calculate the degrees of freedom of the component graphic elements corresponding to the geometric constraints in the first set or the second set in sequence; wherein, the degrees of freedom of the remaining unbound component graphic elements remain consistent with the initial conditions; S82. Based on the component graphic elements calculated in S81, find the corresponding next geometric constraint, and calculate the degrees of freedom of the other component graphic elements corresponding to the next geometric constraint until the degrees of freedom of all component graphic elements are calculated.

5. A method for solving geometric constraints in construction engineering based on design intent according to claim 4, characterized in that Based on the calculations of S81 and S82, if there are geometric constraints that constrain the same degree of freedom of the same component graphic element, it corresponds to redundant constraints.

6. The method for solving geometric constraints in a construction project based on design intent according to claim 5, characterized in that, Based on the calculations of S81 and S82, if there are geometric constraints that conflict with the corresponding constraint conditions, stop the calculation and issue a conflict prompt.

7. A method for solving geometric constraints in construction engineering based on design intent according to claim 6, characterized in that, The method further includes: S9. Obtain the internal information of the component graphic elements in the building model; the internal information includes the graphic elements of the component graphic elements and the corresponding geometric constraints; S10. Repeat S1 to S8 to calculate the degrees of freedom of the graphic elements in the internal information to complete the solution.

8. A geometric constraint solving system for construction projects based on design intent, characterized in that, The system includes: An information collection module, configured to obtain all component graphics elements and geometric constraints in the constructed building model, and respectively generate a component graphics element set and a geometric constraint set; wherein, each geometric constraint records the component graphics elements having a binding relationship with the geometric constraint. A first constraint module, configured to traverse the geometric constraint set, extract the geometric constraints having a fixed relationship from the geometric constraint set, and extract all component graphics elements and geometric constraints corresponding to the geometric constraints having the fixed relationship from the component graphics element set and the geometric constraint set according to the binding relationship, so as to obtain a fixed geometric constraint system; and, in the case of obtaining all the fixed geometric constraint systems, generate a first set in sequence for all the fixed geometric constraint systems. A second constraint module, configured to traverse the component graphics element set, extract the remaining component graphics elements from the component graphics element set, and then extract all geometric constraints and component graphics elements corresponding to the remaining component graphics elements from the geometric constraint set and the component graphics element set according to the binding relationship, so as to obtain an unfixed geometric constraint system; and, in the case of obtaining all the unfixed geometric constraint systems, attach fixed constraints to the component graphics elements in each unfixed geometric constraint system based on the design intention of the building model, and generate a second set in sequence for all the unfixed geometric constraint systems. A calculation and processing module, configured to calculate the degrees of freedom of each component graphics element in the first set and the second set in sequence to complete the solution.

9. The geometric constraint solving system for construction projects based on design intent according to claim 8, characterized in that, The information collection module is further configured to obtain the internal information of the component graphics elements in the building model; the internal information includes the graphic elements of the component graphics elements and the geometric constraints corresponding to the graphic elements. The information collection module, the first constraint module, the second constraint module, and the calculation and processing module are further configured to calculate the degrees of freedom of the graphic elements in the internal information according to the internal information to complete the solution.

10. A geometric constraint solving system for construction engineering based on design intent according to any one of claims 8 to 9, characterized in that, The system further includes: A reminder processing module, configured to correspond to redundant constraints in the case that there are geometric constraints on the same degree of freedom constraint of the same component graphics element in the calculation and processing module; and, in the case that there are geometric constraints conflicting with the corresponding constraint conditions in the calculation and processing module, stop the calculation and issue a conflict prompt.

Images