Method and system for solving geometric constraints of architectural engineering based on design intent

Abstract

The present invention relates to the technical field of digital design of architectural projects, and specifically discloses a method and system for solving geometric constraints of architectural projects based on design intent. The present invention decomposes all component primitives and corresponding geometric constraints in a building model, thereby realizing a cascade solution that converts a high-dimensional nonlinear equation system into multiple low-dimensional subsystems. The orderly and sequential calculation of individual geometric constraint systems significantly reduces the computational complexity by solving the corresponding degrees of freedom each time. On the one hand, for unfixed geometric constraint systems, fixed geometric constraints that conform to the architectural design intent are added. On the other hand, when solving geometric constraints, only the degrees of freedom of the constrained component primitives are calculated, making the solution more consistent with the design intent.

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:

[0005] 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;

[0006] 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;

[0007] S3, repeat S2 to obtain all the fixed geometric constraint systems;

[0008] S4. Generate a first set of all the fixed geometric constraint systems in order;

[0009] S5. Traverse the component primitive set, extract the remaining component primitives from the component primitive set, and then extract all 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;

[0010] S6, repeat S5 to obtain all unfixed geometric constraint systems;

[0011] S7, adding fixed constraints to the component elements in the unfixed geometric constraint system based on the design intent of the building model, and then sequentially generating a second set of all the unfixed geometric constraint systems;

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

[0013] According to a specific embodiment, in the geometric constraint solving method, adding fixed constraints to component elements in the unfixed geometric constraint system based on the design intent of the building model includes:

[0014] Filtering component elements in the unfixed geometric constraint system according to the design intention;

[0015] Add fixed constraints to the filtered component elements;

[0016] The design intent includes the relationship between component elements and coordinate systems.

[0017] According to a specific embodiment, in the above-mentioned geometric constraint solving method, the fixed relationship includes geometric constraints bound to a coordinate system, a fixed point or a related component primitive.

[0018] According to a specific implementation, in the above-mentioned geometric constraint solving method, S8 specifically includes:

[0019] S81, calculating the constrained degrees of freedom of component primitives corresponding to the geometric constraints in the first set or the second set in order; wherein the degrees of freedom of the remaining unbound component primitives remain consistent with the initial conditions;

[0020] S82. Find the next corresponding geometric constraint based on the component primitive calculated in S81, and calculate the constrained degrees of freedom of other component primitives corresponding to the next geometric constraint, until the calculation of the degrees of freedom of all component primitives is completed.

[0021] According to a specific implementation, in the above-mentioned 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 element, then these constraints correspond to redundant constraints.

[0022] According to a specific implementation, in the above-mentioned geometric constraint solving method, if there is a conflict between a geometric constraint and a corresponding constraint condition based on the calculations in S81 and S82, the calculation is stopped and a conflict prompt is issued.

[0023] According to a specific embodiment, in the above-mentioned geometric constraint solving method, the method further includes:

[0024] S9. Acquire internal information of component primitives in the building model; the internal information includes graphic elements of the component primitives and geometric constraints corresponding to the graphic elements;

[0025] S10. Repeat S1 to S8 to calculate the degrees of freedom of the graphic elements in the internal information, and complete the solution.

[0026] In a second aspect, the present invention provides a system for solving geometric constraints of architectural engineering projects based on design intent, the system comprising:

[0027] An information collection module is used to obtain all component primitives and geometric constraints in the constructed building model based on the constructed building model, and generate a component primitive set and a geometric constraint set respectively; wherein each geometric constraint records the component primitives that have a binding relationship with the geometric constraint;

[0028] a first constraint module configured to traverse the geometric constraint set, extract geometric constraints with fixed relationships from the geometric constraint set, and extract 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; and, when all the fixed geometric constraint systems are obtained, sequentially generate a first set from all the fixed geometric constraint systems;

[0029] 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 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, thereby obtaining an unfixed geometric constraint system; and, upon obtaining all the unfixed geometric constraint systems, add fixed constraints to the component primitives in each of the unfixed geometric constraint systems based on the design intent of the building model, thereby sequentially generating a second set of all the unfixed geometric constraint systems;

[0030] The calculation processing module is used to calculate the degrees of freedom of each component element in the first set and the second set in sequence to complete the solution.

[0031] According to a specific embodiment, in the geometric constraint solving system, the information collection module is further used to obtain internal information of component primitives in the building model; the internal information includes graphic elements of the component primitives and geometric constraints corresponding to the graphic elements;

[0032] The information collection module, the first constraint module, the second constraint module and the calculation processing module are further used to calculate the degrees of freedom of the graphic elements in the internal information based on the internal information to complete the solution.

[0033] According to a specific embodiment, in the above-mentioned geometric constraint solving system, the system further includes:

[0034] The reminder processing module is used to correspond to redundant constraints when the same degree of freedom of the same component element is constrained based on the existence of geometric constraints in the calculation processing module; and to stop calculation and issue a conflict prompt when the geometric constraints in the calculation processing module conflict with the corresponding constraint conditions.

[0035] Compared with the prior art, the present invention has the following beneficial effects:

[0036] This method decomposes all component elements and their corresponding geometric constraints in the building model, transforming a high-dimensional nonlinear system of equations into a cascade of multiple low-dimensional subsystems. The sequential calculation of individual geometric constraint systems significantly reduces computational complexity, solving for the corresponding degrees of freedom each time. Furthermore, for non-fixed geometric constraint systems, fixed geometric constraints that align with the architectural design intent are added. Furthermore, when solving for geometric constraints, only the degrees of freedom of the constrained component elements are calculated, ensuring that the solution is more consistent with the design intent. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 A schematic flow chart of a method for solving geometric constraints of architectural projects based on design intent provided by an embodiment of the present invention;

[0038] Figure 2 A schematic flow chart of a method for solving geometric constraints of architectural projects based on design intent, provided in another embodiment of the present invention;

[0039] Figure 3 A schematic diagram of a process for solving a single geometric constraint system provided by an embodiment of the present invention;

[0040] Figure 4 A schematic diagram of a fixed geometric constraint provided by an embodiment of the present invention;

[0041] Figure 5 A schematic diagram of redundancy constraints provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0042] The present invention will be further described in detail below with reference to specific embodiments. However, this should not be construed as limiting the scope of the present invention to the following embodiments, as all technologies implemented based on the present invention fall within the scope of the present invention.

[0043] Unless otherwise specified, in the description of the specific embodiments of the present invention, the expressions "first", "second", "third", etc. are merely 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.

[0044] In geometric constraint solving, the fragmented nature of industry needs has put general solutions in a dilemma. The mechanical field pursues micro-precision, while construction engineering requires macro-efficiency. A single algorithm framework is difficult to balance the performance of multiple contradictions. The limitations of these technical adaptations not only give rise to the demand for independent research and development of solvers in subdivided fields, but also point to new potential breakthrough directions. Furthermore, the present invention adopts a hierarchical constraint strategy by predicting the design intent, so that the algorithm actively reduces non-critical degrees of freedom during the analysis stage, and can simultaneously achieve the dual goals of efficiency improvement and intent restoration.

[0045] This invention is particularly suitable for solving complex constraint systems in the field of construction engineering. Its core technology decouples engineering logic from mathematical constraints, decomposes the global constraint system into multiple independent subproblems, and transforms high-dimensional nonlinear equations into multiple low-dimensional subsystems. This technology supports multi-level parallel solving, resolving the long computational time, low degree of intent restoration, and high cost of multi-solution conflict correction of existing geometric constraint solvers in the field of construction engineering. It can be widely used in rapid iteration of architectural plans, collaborative structural design, and automatic generation of construction drawings.

[0046] The technical solution provided by the present invention is introduced and explained in detail below.

[0047] Specifically, please refer to Figure 1 , which shows a flow chart of a method for solving geometric constraints of architectural projects based on design intent provided by an embodiment of the present invention, the method comprising:

[0048] S1. Based on the constructed building model, all component elements and geometric constraints in the building model are obtained, and a component element set and a geometric constraint set are generated respectively; wherein each geometric constraint records the component elements that have a binding relationship with the geometric constraint.

[0049] S2. Traverse the geometric constraint set, extract geometric constraints with fixed relationships from the geometric constraint set, and extract 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.

[0050] The fixed relationship includes geometric constraints bound to a coordinate system, a fixed point or a related component element.

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

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

[0053] S5. Traverse the component primitive set, extract the remaining component primitives from the component primitive set, and then extract all 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.

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

[0055] S7. Add fixed constraints to the component elements in the unfixed geometric constraint system based on the design intent of the building model, and then generate a second set of all the unfixed geometric constraint systems in sequence.

[0056] Adding fixed constraints to component elements in the unfixed geometric constraint system based on the design intent of the building model includes:

[0057] Filter component elements according to the design intent;

[0058] Attaches a fixed constraint to the filtered component elements.

[0059] Specifically, the design intent includes the relationship between component elements and the coordinate system.

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

[0061] Specifically, the S8 includes:

[0062] S81, calculating the constrained degrees of freedom of component primitives corresponding to the geometric constraints in the first set or the second set in order; wherein the degrees of freedom of the remaining unbound component primitives remain consistent with the initial conditions;

[0063] S82. Find the next corresponding geometric constraint based on the component primitive calculated in S81, and calculate the constrained degrees of freedom of other component primitives corresponding to the next geometric constraint, until the calculation of the degrees of freedom of all component primitives is completed.

[0064] In one possible implementation, if a geometric constraint constrains the same degree of freedom of the same component element based on the calculations of S81 and S82, it is considered a redundant constraint. Furthermore, if a geometric constraint conflicts with a corresponding constraint condition based on the calculations of S81 and S82, the calculation is stopped and a conflict prompt is issued.

[0065] On this basis, the present invention provides a method for solving geometric constraints of architectural engineering based on design intent, which further includes:

[0066] S9, obtaining internal information of component primitives in the building model; the internal information includes graphic elements of the component primitives and corresponding geometric constraints;

[0067] S10. Repeat S1 to S8 to calculate the degrees of freedom of the graphic elements in the internal information, and complete the solution.

[0068] Based on the above technical solution, the present invention decomposes all component elements and their corresponding geometric constraints in the building model, transforming the high-dimensional nonlinear equation system into a cascade of multiple low-dimensional subsystems for solution. The sequential calculation of individual geometric constraint systems significantly reduces computational complexity, solving for the corresponding degrees of freedom each time. For unfixed geometric constraint systems, fixed geometric constraints that align with the architectural design intent are added. Furthermore, when solving for geometric constraints, only the degrees of freedom of the constrained component elements are calculated, ensuring that the solution is more consistent with the design intent.

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

[0070] Please refer to Figure 2 , which shows a flow chart of a method for solving geometric constraints of architectural projects based on design intent provided by another embodiment of the present invention. Further, as described in S1 above, all component primitives and geometric constraints arranged in the software interface are collected.

[0071] Specifically, the component primitives are collected to form a component primitive list List <element>E, that is, the component element set. Collect all geometric constraints to form a list List <constraint>C, namely the geometric constraint set. Among them, each geometric constraint records the component element 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-to-line tangency, line-to-line perpendicularity, arc or circle diameter length, arc sagitta, entity-to-entity distance, etc. Each geometric constraint has two ends, and one end can be bound to a component element, point, line, surface, coordinate system, etc. For example, the dimensional constraint constrains the distance between the two bound endpoints. If the two endpoints are replaced by two parallel straight lines, the spacing between the straight lines is constrained. If they are replaced by two three-dimensional parallel planes, the distance between the faces is constrained.

[0072] Furthermore, as described in S2 above, the model information is sorted and grouped.

[0073] Specifically, the geometric constraint set C is traversed to determine whether a fixed relationship exists between the geometric constraints, that is, whether one end is fixed (a geometric constraint bound to a coordinate system, a fixed point, or a related component element). If not, the traversal continues. If so, the geometric constraint is extracted and recorded in a new constraint list Ci. Using the component element Id recorded in the geometric constraint, the component element list is traversed to find the corresponding component element with a binding relationship. This component element is extracted and added to the new component element list Ei. Based on this component element, the geometric constraint set C is then traversed to determine whether there is a geometric constraint with a binding relationship. If so, the above steps are repeated. In other words, based on the binding relationship, all component elements and geometric constraints corresponding to the fixed geometric constraint are extracted from the component element set and the geometric constraint set. Ultimately, the fixed geometric constraint system {Ei, Ci} is obtained.

[0074] Furthermore, as described in S3 above, S2 is repeated to obtain all the fixed geometric constraint systems.

[0075] Furthermore, as described in S4 above, after traversing all the geometric constraints associated with the fixed coordinate system, all the fixed geometric constraint systems are sequentially generated into a first set, 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 elements in each component element list Ei and several geometric constraints in the constraint list Ci.

[0076] Furthermore, as described in S5 above, after traversing S2 and S3, the remaining geometric constraints and component elements in the geometric constraint set C and component element set E cannot have a direct relationship with the coordinate system or fixed point, and the determination of whether one end of the geometric constraint is fixed is no longer required. At this point, traversal begins in the order in E, extracting the remaining component elements and recording them in a new component element list Ei0. Based on these component elements, the geometric constraints in the geometric constraint set C with binding relationships are then traversed and recorded in a new constraint list Ci0. The remaining steps are the same as in S2. Ultimately, the unfixed geometric constraint system {Ei0, Ci0} is obtained. This geometric constraint system is not associated with a fixed coordinate system, has a large degree of freedom in solution, and the solution is non-unique.

[0077] Furthermore, as described in S6 above, S5 is repeated to obtain all unfixed geometric constraint systems. At this point, as described in S7 above, component elements in the unfixed geometric constraint system are screened based on the architectural engineering design intent, and fixed constraints are added to these component elements. Specifically, the additional fixed constraint, i.e., a constraint with one end attached to the coordinate system and the other end attached to the remaining component elements in E, eliminates the need to calculate all degrees of freedom of the component element, maintaining the initial conditions, regardless of the constraint type.

[0078] After the additional constraints are completed, all the unfixed geometric constraint systems are sequentially generated into a second set to obtain the unfixed geometric constraint system with additional fixed constraints, including {E10, C10}, {E20, C20}…{En0, Cn0}.

[0079] Design intent screening is based on the closeness of the relationship between component elements and the coordinate system. For example, whether the component element is parallel or tangent to the coordinate system and whether the distance from the coordinate system origin to the component element is minimized are comprehensively determined. Selected component elements are used to attach fixed constraints, which then allow the calculation of the geometric constraint system. The degrees of freedom of this component element are used as initial conditions to determine the solution for other component elements within the constraint system.

[0080] Furthermore, as described in S8 above, a single geometric constraint system is solved, namely {Ei, Ci} or {Ei0, Ci0}.

[0081] Specifically, please refer to Figure 3 , which shows a schematic diagram of the process for solving a single geometric constraint system provided by an embodiment of the present invention. For a given geometric constraint system, the first fixed geometric constraint is found sequentially. The constrained degrees of freedom of the component element with the corresponding ID are solved according to the constraint rules. The remaining unbound degrees of freedom are kept consistent with the initial conditions (in line with the design intent). Based on the calculated component element, the next geometric constraint is found, and the calculation is repeated.

[0082] Specifically, please refer to Figure 4 , which shows a schematic diagram of a fixed geometric constraint provided by an embodiment of the present invention. Figure 4 As shown, spacing E is a geometric constraint, with its left end fixed on the Y axis of the coordinate system. Traversing the component element set, we find line 1, which is bound to the other end of spacing E. Based on line 1, we traverse the geometric constraint set and find that one end of spacing D is bound to line 1. Based on spacing D, we find that line 2 is bound to the other end of the geometric constraint. Traversing the geometric constraint set again, we find that no geometric constraint is bound to line 2. This forms a fixed geometric constraint system {E1, C1}, where E1 {contains line 1 and line 2}, and C1 contains two dimensional constraints, spacing E and spacing D. The internal characteristics of these two dimensional constraints, that is, the bound component elements are parallel, and the distance is controlled by parameters. The specific solution process is as follows:

[0083] According to the relationship between the Y-axis and line 1, find line 1:

[0084] Y axis: X=0;

[0085] Line 1: A1x+B1y+C1=0;

[0086] Constraints: Parallel B1=0; then simplified to X=-C1 / A1=E;

[0087] According to the constraint E value. If E=1000, then line 1: X=1000.

[0088] According to the constraint relationship between line 1 and line 2, find line 2: A2x+B2y+C2=0;

[0089] Line 1X=1000;

[0090] Constraints, parallel B2=0; simplified x=-C2 / A2=1000+D;

[0091] According to the constraint D value, if D=400, then line 2: X=1400.

[0092] If a geometric constraint is found to be constraining the same degree of freedom of the same component element during the calculation process, this is considered a redundant constraint. If calculating this geometric constraint causes a conflict with a previously specified constraint, the calculation is stopped and the user is alerted to the conflict. A panel appears to select "Delete Redundant Constraints," and the geometric constraint and constraint rule are highlighted in the software interface for easy modification.

[0093] Further, refer to Figure 5 , which shows a schematic diagram of redundant constraints provided by an embodiment of the present invention. Figure 5 As shown, if there is a spacing F in addition to spacings E and D, where spacing F makes the equation of line 2 X = F, there is a redundant constraint with the equation X = E + D obtained by spacings E and D. If F = E + D, no error is reported. However, if F ! = E + D, an error is reported.

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

[0095] Furthermore, as described in S9 above, the internal constraints of the component primitives are solved.

[0096] Specifically, the component elements calculated through internal information in construction projects generally include: shapes (stretched bodies, rotated bodies, lofted bodies, fused bodies, fused lofted bodies), blocks (two-dimensional and three-dimensional), family instances, fillings, etc.; the internal information of these component elements includes geometric constraints and constituent graphic elements.

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

[0098] Specifically, the independence of each geometric constraint system facilitates parallel computation: First, the geometric constraint systems within the component primitives are computed, with parallel computations performed between different geometric constraint systems and between different component primitives. Once the internal information within the component primitives is computed, the geometric constraint systems within the absolute coordinate system are then computed in parallel. Finally, all the computational results are assembled to complete the computation.

[0099] Based on the above technical solution, the present invention has the following advantages:

[0100] 1. Design intent-driven constraint completion mechanism:

[0101] When degrees of freedom are excessive, fixed constraints are automatically added or the initial values ​​of the original degrees of freedom are maintained based on the design intent. This solves the problem of missing design intent in traditional methods and ensures that the solution conforms to the original logic of the architectural design.

[0102] 2. Hierarchical decoupling constraint decomposition algorithm:

[0103] By decomposing the global constraint system into multiple independent subproblems ({E1, C1}, ..., {En, Cn}), the high-dimensional nonlinear equation system is converted into a cascade solution of multiple low-dimensional subsystems, significantly reducing the computational dimension;

[0104] 3. Parallel computing architecture:

[0105] Parallel calculation of internal constraint systems of component elements, parallel calculation between different component elements, and parallel solution of independent constraints between subsystems in absolute coordinate system, achieving orders of magnitude improvement in efficiency through multi-level parallelization strategy;

[0106] 4. Conflict detection reminder and redundant constraint selection deletion:

[0107] Individual geometric constraint systems are solved sequentially. If the degrees of freedom of a component element are fixed by multiple geometric constraints and the solution cannot be satisfied simultaneously, a panel pops up to select and delete redundant constraints. The geometric constraints and constraint rules are highlighted in the software interface for easy modification. This avoids solution failures caused by conflicts and reduces manual intervention costs.

[0108] On the other hand, an embodiment of the present invention further provides a system for solving geometric constraints of architectural projects based on design intent, the system comprising:

[0109] An information collection module is used to obtain all component primitives and geometric constraints in the constructed building model based on the constructed building model, and generate a component primitive set and a geometric constraint set respectively; wherein each geometric constraint records the component primitives that have a binding relationship with the geometric constraint;

[0110] a first constraint module configured to traverse the geometric constraint set, extract geometric constraints with fixed relationships from the geometric constraint set, and extract 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; and, when all the fixed geometric constraint systems are obtained, sequentially generate a first set from all the fixed geometric constraint systems;

[0111] 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 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, thereby obtaining an unfixed geometric constraint system; and, upon obtaining all the unfixed geometric constraint systems, add fixed constraints to the component primitives in each of the unfixed geometric constraint systems based on the design intent of the building model, thereby sequentially generating a second set of all the unfixed geometric constraint systems;

[0112] The calculation processing module is used to calculate the degrees of freedom of each component element in the first set and the second set in sequence to complete the solution.

[0113] According to a specific embodiment, in the geometric constraint solving system, the information collection module is further used to obtain internal information of component primitives in the building model; the internal information includes graphic elements of the component primitives and geometric constraints corresponding to the graphic elements;

[0114] The information collection module, the first constraint module, the second constraint module and the calculation processing module are further used to calculate the degrees of freedom of the graphic elements in the internal information based on the internal information to complete the solution.

[0115] According to a specific embodiment, in the above-mentioned geometric constraint solving system, the system further includes:

[0116] The reminder processing module is used to correspond to redundant constraints when the same degree of freedom of the same component element is constrained based on the existence of geometric constraints in the calculation processing module; and to stop calculation and issue a conflict prompt when the geometric constraints in the calculation processing module conflict with the corresponding constraint conditions.

[0117] It is understandable that the computing and processing module may be a central processing unit (CPU) or a microcontroller (MCU).

[0118] The computing and processing module may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof.

[0119] The computing and processing module may further include a memory for storing the aforementioned fault information, central controller programs, 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); or a combination of the aforementioned types of memory.

[0120] The methods, steps, and logic diagrams disclosed in the embodiments of the present invention can be implemented or executed. A general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of the present invention can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules within the decoding processor. The software modules can be located in a storage medium well-established in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, or registers. The processor reads the information from the storage medium and, in conjunction with its hardware, completes the steps of the aforementioned methods.

[0121] The storage medium may be a memory and may be, for example, a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memory.

[0122] Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory.

[0123] The volatile memory may be random access memory (RAM), which is used as an external cache memory. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), SyncLink DRAM (SLDRAM), and direct RAMbus RAM (DRRAM).

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

[0125] It should be understood that the systems disclosed in the embodiments of the present invention can be implemented in other ways. For example, the division of units described above is merely a logical functional division. In actual implementation, other division methods are possible, such as combining or integrating multiple units or components into another system, or omitting or disabling certain features. Furthermore, the communication connections between units can be through some interface, server, or indirect coupling or communication connection, which can be electrical or other.

[0126] In addition, the functional units in the various embodiments of the present invention may be integrated into a single processing unit, or each module may exist physically separately, or two or more modules may be integrated into a single processing unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0127] 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 computer-readable storage medium. Based on this understanding, the technical solution of the present invention, 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 enabling a computer device (which can be a personal computer, server or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk, etc. Various media that can store program codes.

[0128] Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present invention should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0129] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.< / constraint> < / element>

Claims

1. A method for solving geometric constraints of architectural engineering based on design intent, characterized in that: The method comprises: 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 component primitive set, extract the remaining component primitives from the component primitive set, and then extract all 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; S6, repeat S5 to obtain all the unfixed geometric constraint systems; S7, adding fixed constraints to the component elements in the unfixed geometric constraint system based on the design intent of the building model, and then sequentially generating a second set of all the unfixed geometric constraint systems; S8. Calculate the degrees of freedom of each component element in the first set and the second set in sequence to complete the solution.

2. A method for solving geometric constraints of architectural engineering based on design intent according to claim 1, characterized in that: Adding fixed constraints to component elements in the unfixed geometric constraint system based on the design intent of the building model includes: Filtering component elements in the unfixed geometric constraint system according to the design intention; Add fixed constraints to the filtered component elements; The design intent includes the relationship between component elements and coordinate systems.

3. The method for solving geometric constraints of architectural engineering based on design intent according to claim 1, characterized in that: The fixed relationship includes geometric constraints bound to a coordinate system, a fixed point or related component elements.

4. The method for solving geometric constraints of architectural engineering based on design intent according to claim 1, characterized in that: The S8 specifically includes: S81, calculating the constrained degrees of freedom of component primitives corresponding to the geometric constraints in the first set or the second set in order; wherein the degrees of freedom of the remaining unbound component primitives remain consistent with the initial conditions; S82. Find the next corresponding geometric constraint based on the component primitive calculated in S81, and calculate the constrained degrees of freedom of other component primitives corresponding to the next geometric constraint, until the calculation of the degrees of freedom of all component primitives is completed.

5. A method for solving geometric constraints of architectural 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 on the same degree of freedom of the same component element, they correspond to redundant constraints.

6. A method for solving geometric constraints of architectural engineering based on design intent according to claim 5, characterized in that: Based on the calculations of S81 and S82, if there is a conflict between the geometric constraints and the corresponding constraint conditions, the calculation is stopped and a conflict prompt is issued.

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

8. A geometric constraint solving system for architectural engineering based on design intent, characterized by: The system comprises: An information collection module is used to obtain all component primitives and geometric constraints in the constructed building model based on the constructed building model, and generate a component primitive set and a geometric constraint set respectively; wherein each geometric constraint records the component primitives that have a binding relationship with the geometric constraint; a first constraint module configured to traverse the geometric constraint set, extract geometric constraints with fixed relationships from the geometric constraint set, and extract 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; and, when all the fixed geometric constraint systems are obtained, sequentially generate a first set from 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 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, thereby obtaining an unfixed geometric constraint system; and, upon obtaining all the unfixed geometric constraint systems, add fixed constraints to the component primitives in each of the unfixed geometric constraint systems based on the design intent of the building model, thereby sequentially generating a second set of all the unfixed geometric constraint systems; The calculation processing module is used to calculate the degrees of freedom of each component element in the first set and the second set in sequence to complete the solution.

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

10. A construction engineering geometric constraint solving system based on design intent according to any one of claims 8 to 9, characterized in that: The system further comprises: The reminder processing module is used to correspond to redundant constraints when the same degree of freedom of the same component element is constrained based on the existence of geometric constraints in the calculation processing module; and to stop calculation and issue a conflict prompt when the geometric constraints in the calculation processing module conflict with the corresponding constraint conditions.

Images