Method of generating framing plan of building and system for generating precut data

Abstract

To obtain framing data for generating precut data so as to satisfy various input users.SOLUTION: A method includes: generating panel data to be generated, and piece data consisting of lengths and material specifications of horizontal members arranged (overlaid) on the panel, from positions of the horizontal members and foundations or columns on a framing plan of a building prepared in advance; generating a binary matrix for solving a set covering problem from the panel data and the piece data; enumerating multiple solutions to the set covering problem; presenting a new framing plan candidate from the obtained multiple solutions; and allowing a user to select one of them. The number of solutions to be obtained from the set covering problem is limited to an allowable amount by determining, in advance, hierarchies (dominance relationship) at intersections of the horizontal members covering the panel data, determining, in advance, lengths or positions of the horizontal members to be arranged, or applying required structural constraints.SELECTED DRAWING: Figure 1

Description

Technical Field

[0001] The present invention relates to a method for generating a floor plan of a building, a pre-cut data generation system, data used in this system, a data generation device, and a floor plan generation device.

Background Art

[0002] Horizontal members for fixing and supporting superstructures are arranged in a grid pattern above the foundation of a building or under the floor of an upper floor. Various techniques for automatically generating a floor plan showing the arrangement of the horizontal members have been introduced (Patent Document 1) (Patent Document 2).

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Patent Document 2

Patent Document 3

Non-Patent Documents

[0004]

Non-Patent Document 1

Non-Patent Document 2

Summary of the Invention

Problems to be Solved by the Invention

[0005] In the elevation view, there are many cross members intersecting in a cross shape, or in a T shape, an L shape, or an I shape, and there are many intersection points (intersection points or contact points) where they meet. At these intersection points, a state occurs where one cross member passes through the intersection point and the other cross member terminates immediately before the intersection point. The state of each cross member at the intersection point is determined by the shape of the superstructure assembled on the cross member, the columns supporting it, and the required design strength.

[0006] Various patterns can be considered for the arrangement of the cross members and the state of the intersection points. The input person creates an elevation view while selecting the arrangement of the cross members that is considered to be optimal. Using this elevation view, precut data for the cross members is generated. However, there is a problem that this elevation view creation work requires skill, has a large individual difference, and imposes a high human load. Also, even when using known elevation view automatic creation devices as described in Patent Documents 1 and 2, an elevation view that satisfies the input person cannot be easily created.

[0007] An object of the present invention is to provide a method for generating an elevation view of a building, a precut data generation system, data used therefor, a data generation device, an elevation view generation device, etc., which can speed up the elevation view creation work as described above and easily obtain the elevation view required by the input person.

Means for Solving the Problems

[0008] The following configurations are means for solving the above problems respectively.

[0009] <Configuration 1> From the positions of the cross members arranged on the previously created elevation view of the building, A data ((sx1, sy1, ex1, ey1, z1) to (sxn, syn, exn, eyn, zn)) consisting of the start point coordinates, end point coordinates, and material composition of the line segments representing the locations of the cross members, and D data ((v1, w1) to (vl, wl)) consisting of the fulcrum coordinates representing the locations where the cross members are supported from below are generated from the positions of the foundations or columns arranged on the elevation view, A piece to be arranged (coated) on the above line segment is represented by C data ((L1, z1) to (Lk, zk)) consisting of the length and material composition of the horizontal member, From the above A data, D data, and C data, a binary matrix for performing the covering problem calculation is generated. In the covering problem calculation, using the D data, solutions that satisfy the forbidden conditions are excluded, and solutions with higher-order beams are excluded based on the result of the beam order calculation. A method for generating a floor plan of a building as described above, characterized by generating a plurality of new floor plan data from the solutions of the plurality of covering problems obtained.

[0010] <Configuration 2> From the positions of the horizontal members arranged on the floor plan of the building created in advance, A data ((sx1, sy1, ex1, ey1, z1) to (sxn, syn, exn, eyn, zn)) consisting of the start point coordinates, end point coordinates, and material composition of the line segment representing the location of the horizontal member, and From the positions of the foundations or columns arranged on the floor plan, D data ((v1, w1) to (vl, wl)) consisting of the fulcrum coordinates representing the places where the horizontal members are supported from below are generated, A piece to be arranged (coated) on the above line segment is represented by C data ((L1, z1) to (Lk, zk)) consisting of the length and material composition of the horizontal member, B data ((s1, t1, u1) to (sm.tm, um)) consisting of the intersection point coordinates (contact point coordinates or intersection coordinates) of the joints of the horizontal members on the above line segment and the flag specifying the piece that wins at the intersection point is generated, From the above A data, D data, C data, and B data, a binary matrix for performing the covering problem calculation is generated. In the covering problem calculation, using the D data, solutions that satisfy the forbidden conditions are excluded, and solutions with higher-order beams are excluded based on the result of the beam order calculation. The method for generating a floor plan of a building as described in Configuration 1, characterized by generating a plurality of new floor plan data from the solutions of the plurality of covering problems obtained.

[0011] <Configuration 3> The above binary matrix is a binary matrix generated according to the following rules (1) to (6), Each column corresponds to a certain line segment or a certain intersection point represented by the above A data, and each row represents one possible arrangement of a certain piece represented by the C data that covers the above line segment or intersection point. In the arrangement of the pieces in the i-th row, when the line segment or intersection point represented by the A data in the j-th column is covered with the piece represented by the C data, the (i, j) element is set to 1, and when it is not covered, the (i, j) element is set to 0. A method for generating a floor plan of a building according to Configuration 1 or Configuration 2, characterized in that. (Rule) (1) A line segment is covered with pieces of the same material. (2) A line segment is not covered with pieces of different materials. (3) One line segment is not covered with a plurality of pieces. (4) One piece can cover a plurality of line segments arranged in a straight line. (5) At an intersection point, any one piece wins (exists on the intersection point), and the other pieces lose (do not exist on the intersection point). (6) At an intersection point, a piece with a larger material composition cannot be covered so as to lose to a piece with a smaller material composition.

[0012] <Configuration 4> An apparatus for inputting a binary matrix generated by the method according to Configuration 3, a forbidden condition, and a condition for excluding beam orders into a covering problem calculation device, an apparatus for generating and outputting a plurality of floor plans from solutions of the obtained plurality of covering problems, and an apparatus for generating precut data of horizontal members using a floor plan selected from those floor plans. A precut data generation system, characterized in that it comprises.

[0013] <Configuration 5> For use in calculation for executing covering problem calculation to generate a plurality of new floor plan data, Floor plan generation calculation data for a building, comprising the start point coordinates, end point coordinates, and material composition of the line segment representing the location of the horizontal member, and the fulcrum coordinates representing the location where the horizontal member is supported below, from the positions of the horizontal members arranged on a previously created floor plan of the building and the positions of the foundations or columns arranged on the floor plan.

[0014] <Configuration 6> A data generation device for building floor plan generation calculation data, which is characterized by generating binary matrix data using the following A data, D data, and C data. (A data) Data ((sx1, sy1, ex1, ey1, z1) to (sxn, syn, exn, eyn, zn)) consisting of the starting point coordinates, ending point coordinates, and material type of the line segment representing the location of the horizontal members arranged on the pre-created building floor plan. (D data) Data ((v1, w1) to (vl, wl)) consisting of the fulcrum coordinates representing the locations where the horizontal members are supported from below, based on the locations of the foundations or columns arranged on the floor plan. (C data) Data ((L1, z1) to (Lk, zk)) consisting of the length and material type of the pieces to be arranged (covered) on the above line segments.

Advantages of the Invention

[0015] Calculations are performed based on a single pre-created floor plan, and a plurality of new floor plan candidates that meet the necessary conditions are automatically generated. Therefore, a floor plan that meets the requirements of the input person can be selected and used from among them. The location of the horizontal members arranged in the floor plan is represented by line segments, and the locations of the foundations or columns are represented by points. Floor plan data for the calculation of arranging (covering) the horizontal members is generated. Horizontal members of various shapes are used as pieces to cover this floor plan data, and a binary matrix is generated from the floor plan data and the pieces. By using a covering problem calculation device capable of high-speed calculation, a plurality of new floor plan candidate data can be obtained through calculations in a short time. The number of solutions obtained from the covering problem calculation device can be limited to an acceptable number by methods such as pre-determining the state (win or loss) of the intersection points of the horizontal members covering the floor plan data, pre-determining the length and arrangement position of the horizontal members to be arranged, or applying the required structural prohibition conditions.

Brief Explanation of the Drawings

[0016]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Mode for Carrying Out the Invention

[0017] Even if a hidden figure is created by giving a certain type of parameter to the hidden figure automatic generation device described in Patent Documents 1 and 2, a hidden figure with the content required by the input person cannot be obtained immediately. It is technically possible to select all the parameters to be given according to the structure of the building to be required, create a corresponding hidden figure, and then select the good ones. However, since the number of types of parameters is enormous, the calculation time and the capacity of the output hidden figure data are enormous and not realistic.

[0018] On the other hand, although the covering problem calculation device introduced in Patent Document 3 and Non - Patent Documents 1 and 2 introduces technologies in completely different fields from the present invention, it has been considered whether the algorithm of arranging pieces of various shapes without gaps in determined grids can be used for creating hidden figures.

[0019] This covering problem calculator or covering problem calculation algorithm is characterized by extremely fast solution finding and extremely small data capacity for holding the output solutions.

[0020] However, in order to use this device for creating a wiring diagram, an appropriate binary matrix to be input must be created. Further, it is necessary to convert the retrieved solutions (combinations of rows) into a wiring diagram. Also, if the number of those solutions is extremely large, it cannot be put into practical use as it is.

[0021] Therefore, we considered creating a binary matrix such that solutions that can be used for a wiring diagram can be obtained by the covering problem calculator. For that purpose, first, a previously created wiring diagram was regarded as the board surface of the covering problem, and the horizontal girders were regarded as pieces. And it was decided to generate a binary matrix from the board surface and the pieces.

[0022] Next, in order to reduce the number of solutions, the board surface data was contrived. That is, since a building is not a puzzle where pieces can be freely arranged, it is a waste to find all covering methods. Therefore, for example, at specific connection points of the horizontal girders, it was decided to create a binary matrix including conditions such as a specific horizontal girder winning (being on that connection point), or specifying the length and material type of the horizontal girder to be arranged at this position.

[0023] Furthermore, a taboo condition 25 was set so that conventionally prohibited arrangement structures as described later can be automatically excluded, and it was decided to input it to the covering problem calculator. Hereinafter, embodiments of the present invention will be described in detail for each example.

Example

[0024] FIG. 1 is a schematic diagram of a system for generating a hidden diagram of a building according to the present invention. In this system, a plurality of new hidden diagrams (hidden diagram candidate list 32) are generated from one hidden diagram (hidden diagram data 16) by a hidden diagram automatic creation device 14, a board surface generation device 17, a binary matrix generation device 22, a rule condition setting device 48, a covering problem calculation device 26, and a data conversion device 30. From the hidden diagram candidate list 32, precut data 38 is generated using a precut data generation device 36 from the selected hidden diagram that is acceptable. The functions of these devices will be described in order below.

[0025] (Hidden diagram automatic creation device) The hidden diagram automatic creation device 14 (FIG. 1) is an existing automatic device as exemplified in Patent Documents 1 and 2. The hidden diagram data 16 is created in advance by this device. An example thereof is shown in FIG. 2. By inputting the floor plan data 12 of the building and the necessary parameters (FIG. 1), one hidden diagram is automatically created.

[0026] Normally, a hidden diagram that satisfies the input person cannot be generated by one process of the hidden diagram automatic creation device 14, but based on this, a plurality of new hidden diagrams for the building are created by the covering problem calculation device 26. Note that the hidden diagram data 16 may be created manually by the input person. This system can be used to confirm whether there are parts that can be further improved.

[0027] (Board surface generation device) FIG. 3 is an explanatory diagram of the structure of the board surface data 18, and FIG. 4 is the board surface data 18 created based on the hidden diagram data 16 (FIG. 2). The board surface generation device 17 (FIG. 1) automatically generates the board surface data 18 consisting of the start point coordinates, end point coordinates, and material type of the line segment representing the location of the horizontal members, and the fulcrum coordinates representing the location where the horizontal members are supported from below, based on the horizontal members and the positions of the foundation or columns arranged on the hidden diagram of the previously created hidden diagram data 16.

[0028] From the position of the horizontal members arranged on the plan view, the start point coordinates, end point coordinates, and material composition of the line segment representing the location of the horizontal members are called A data ((sx1, sy1, ex1, ey1, z1) to (sxn, syn, exn, eyn, zn)), and the fulcrum coordinates representing the location where the horizontal members are supported from below by the foundation or columns are called D data ((v1, w1) to (vl, wl)).

[0029] (Panel data) A part of the panel data 18 illustrated in FIG. 4 is shown in FIG. 3(a), and its structure will be described. In FIG. 3(a), the location of the horizontal members arranged in the plan view data 16 is represented by a line segment 40, the joints of the plurality of horizontal members are set as the intersection points 42 of the above line segment 40, and the positions of the columns are indicated by X marks. The panel data is generated from the above A data and D data.

[0030] Due to the structure of the building, almost all of the line segments 40 intersect at right angles. On these line segments 40, one of the horizontal members is necessarily arranged, and no horizontal members are arranged in other parts.

[0031] The material composition of the line segment 40 in FIG. 3(a) is the length of the surface that becomes the side when arranging the horizontal members. For example, there is a line segment 40 on which the long A horizontal member 44 (FIG. 3(b)) with a long material composition is arranged upward, and a line segment 40 on which the short B horizontal member 46 (FIG. 3(b)) with a short material composition is arranged upward. Arranging any horizontal member on the line segment 40 is expressed as "covering". In this figure, the line segment 40 on which the long A horizontal member 44 with a long material composition is arranged upward is shown by a thicker line than other lines.

[0032] Among the horizontal members, there are long ones that span multiple intersection points 42 and short ones that terminate at one or both of the intersection points 42. All line segments 40 are represented by the position coordinates at both ends, and from those position coordinates, it can be determined whether the line segment 40 passes through and is continuous with the intersection point 42 or terminates at the intersection point 42.

[0033] Figure 3(c) shows an example in which the line segment 40 indicated by the thick line in Figure 3(a) is covered with the A horizontal member 44, and the non-thick line segment 40 is covered with the B horizontal member. As in this example, when the A horizontal member and the B horizontal member are in contact at the intersection point 42 and there is an A horizontal member 44 on the intersection point 42, it is expressed that the A horizontal member 44 is in a "winning" state with respect to the B horizontal member 46.

[0034] (Piece data) The piece covers the board surface and is a horizontal member in a building. The horizontal member is processed to the dimensions specified at the prefabrication factory. Referring to the board surface data, the pieces are aligned so as to include the types of material composition and length necessary to cover this without gaps. The data representing the pieces is called C data ((L1, z1) to (Lk, zk)).

[0035] Note that it may be possible to select from among the types of (material composition, length) of all the horizontal members stocked in the prefabrication factory those that are determined to be suitable for generating the binary matrix. This will also be explained later in Figure 5(b).

[0036] (Binary matrix generator) Using the covering problem calculator 26, the binary matrix generator 22 automatically generates a binary matrix 24 from the board surface data 18 and the piece data 20 in order to calculate the arrangement of the horizontal members for generating a plurality of new floor plan data of the building. Also, the forbidden condition 25, which will be described later, is set as necessary.

[0037] Figure 5 is an explanatory diagram of this binary matrix generation processing operation. Figure 5(a) is a part of the board surface data 18 (Figure 4) whose structure was explained in Figure 3. The data in Figure 5 has a shape in which two squares with a side length of 1 unit are stacked, and has a structure in which 7 pieces with a length of 1 unit can be arranged. Two pieces with a length of 2 units can be arranged. Signs a1 to a13 are attached to indicate all the locations of the line segments and intersection points.

[0038] Here, the line segments at the positions of a5 and a10 are shown thicker than other line segments. These line segments must be covered with long horizontal members of the material composition. Since any horizontal member is arranged at all intersection points, considering the case of covering the intersection points, as shown in Fig. 5(b), long pieces for intersection points such as "+", "++" are prepared for the types of pieces used for covering.

[0039] Therefore, there are six types of long horizontal members of the material composition, namely B2L, B2L+, B2L++, B1L, B1L+, B1L++, and six types of short horizontal members of the material composition, namely S2L, S2L+, S2L++, S1L, S1L+, S1L++.

[0040] Fig. 6 shows one possible arrangement of covering each column corresponding to a certain line segment or a certain intersection point among a1 to a13, and each row corresponding to a piece (B2L, B2L+, B2L++, B1L, B1L+, B1L++, S2L, S2L+, S2L++, S1L, S1L+, S1L++) that covers a1 to a13. That is, it is a binary matrix created by setting the (i, j) element to 1 when covering the line segment or intersection point in the j-th column with the piece arrangement in the i-th row, and setting the (i, j) element to 0 when not covering.

[0041] Whether it can be covered follows the following rules (1) to (6). (1) The line segment is covered with pieces of the same material composition. (2) The line segment is not covered with pieces of different material compositions. (3) One line segment is not covered with multiple pieces. (4) One piece can cover a plurality of line segments arranged in a straight line. (5) At the intersection point, any one piece wins (exists on the intersection point), and the other pieces lose (do not exist on the intersection point). (6) At the intersection point, the piece with a larger material composition cannot be covered so as to lose to the piece with a smaller material composition.

Example

[0042] (Prohibited condition) In addition to the above, generally or by the inputter's own determination, a structural prohibition condition 25 is provided and automatically excluded. For example, Fig. 7 shows a part surrounded by nine squares with a side length of 1 unit, where horizontal members with a length of 2 units are combined in a swastika shape. In this state, the building method sequence is not determined.

[0043] To exclude this, it is determined to prohibit the swastika shape, and it is included in the prohibition condition 25 and given to the covering problem calculation device 26. When the covering problem calculation device that has received this prohibition condition has a binary matrix including rows such as S, T, U, and V in Fig. 8, it automatically excludes solutions including the S, T, U, and V rows.

Example

[0044] (Exclusion of higher-order beams) Also, as shown in Fig. 9, at joints without columns supporting below, relationships such as primary beam 60, secondary beam 62, and tertiary beam 64 occur between the horizontal members. If there are higher-order beams, problems such as the floor tilting occur. The covering problem calculation device 26 excludes solutions with higher-order beams based on the result of beam order calculation. Similar to the prohibition of the swastika shape, for example, it may be determined to prohibit beams of the fourth order or higher and include them in the prohibition condition. Also, the covering problem inspection device 26 may be provided with a function to preferentially output solutions with lower beam orders to the calculation result data 28.

Example

[0045] (Win-loss limitation at joints) When setting the above prohibition condition, the number of solutions output as calculation results from the covering problem calculation device 26 can be narrowed down. For the same purpose in this example, B data ((s1, t1, u1) to (sm, tm, um)) consisting of the joint coordinates (contact point coordinates or intersection point coordinates) of the above line segments at the joints of the horizontal members and a flag specifying the piece that wins at that joint is generated.

[0046] That is, at a specific intersection point, one of the horizontal members is preset to win or lose. For example, in the case where it is desired to fix the construction order due to architectural circumstances. It may also be due to reasons of strength or the preference of the inputter. Then, a binary matrix for performing the covering problem calculation may be generated from the above A data, D data, C data, and B data.

Embodiment

[0047] (Specification of the length of the line segment) In order to reduce the number of solutions to the covering problem, the number of line segments in the board data can also be reduced. That is, make the longer line segments more numerous. This may also be specified for reasons of strength or the preference of the inputter.

[0048] (Data conversion device) From the covering problem calculation device 26, the solution to the covering problem is output as a combination of rows of the binary matrix (listing the row numbers), which is the calculation result data 28. By comparing this with the input binary matrix, the hidden figure data can be obtained. The data conversion device 30 performs such processing. As a result, for example, new hidden figures as shown in FIG. 10 or FIG. 11 can be obtained. In FIG. 10, compared with the hidden figure of FIG. 2, the areas within the two dashed circles have changed. Also, in FIG. 11, compared with FIG. 10, the area within one dashed circle has changed. Since several partially changed hidden figures are obtained as solutions in this way, any one of them can be used.

[0049] (Selection process and generation of precut data) As shown in FIG. 1, after generating a plurality of new hidden figures (hidden figure candidate list 32) from the plurality of solutions (calculation result data 28) obtained by the covering problem calculation device 26, the inputter uses the hidden figure selected by the selection processing device 34 from the hidden figure candidate list 32 to generate the precut data 38 of the horizontal member by the precut data generation device 36. The selection processing device 34 sequentially displays the listed hidden figures and selects any one of them. Since this selection process and the process of the precut data generation device 36 are known, detailed description is omitted.

[0050] As described above, when using the covering problem calculator, a plurality of new perspective views can be obtained from the arrangement of a certain horizontal member, and a perspective view that matches the concept of the input person can be selected from them. If necessary, the input person can further modify it and then complete the required perspective view, and proceed to the pre-cut data generation process.

Explanation of symbols

[0051] 12 Plan view data, parameters 14 Perspective view automatic creation device 16 Perspective view data 17 Board surface generation device 18 Board surface data 20 Piece data 22 Binary matrix generation device 24 Binary matrix 25 Forbidden condition 26 Covering problem calculator 28 Calculation result data 30 Data conversion device 32 Perspective view candidate list 34 Selection processing device 36 Pre-cut data generation device 38 Pre-cut data 40 Line segment 42 Intersection point 44 A horizontal member 46 B horizontal member 48 Forbidden condition setting device 60 Primary beam 62 Secondary beam 64 Tertiary beam

Claims

1. From the positions of the horizontal members arranged on a pre-drawn floor plan of a building, A data ((sx1, sy1, ex1, ey1, z1) to (sxn, syn, exn, eyn, zn)) consisting of the starting point coordinates, ending point coordinates, and material composition of the line segments representing the locations of the horizontal members, and generate D data ((v1, w1) to (vl, wl)) consisting of the fulcrum coordinates representing the locations where the horizontal members are supported from below, from the positions of the foundations or columns arranged on the floor plan, represent the pieces to be arranged (covered) on the above line segments with C data ((L1, z1) to (Lk, zk)) consisting of the lengths and material compositions of the horizontal members, generate a binary matrix for performing covering problem calculations from the above A data, D data, and C data, and in the covering problem calculation, use the D data to exclude solutions that satisfy the taboo conditions and exclude solutions with higher-order beams based on the results of beam order calculations, generating a plurality of new floor plan data from the obtained solutions of the plurality of covering problems, wherein the method for generating the floor plan of the building is characterized in that.

2. From the positions of the horizontal members arranged on a pre-drawn floor plan of a building, A data ((sx1, sy1, ex1, ey1, z1) to (sxn, syn, exn, eyn, zn)) consisting of the starting point coordinates, ending point coordinates, and material composition of the line segments representing the locations of the horizontal members, and generate D data ((v1, w1) to (vl, wl)) consisting of the fulcrum coordinates representing the locations where the horizontal members are supported from below, from the positions of the foundations or columns arranged on the floor plan, represent the pieces to be arranged (covered) on the above line segments with C data ((L1, z1) to (Lk, zk)) consisting of the lengths and material compositions of the horizontal members, generate B data ((s1, t1, u1) to (sm.tm, um)) consisting of the intersection point coordinates (contact point coordinates or intersection point coordinates) of the joints of the horizontal members on the above line segments and the flags specifying the pieces that win at the intersection points, generate a binary matrix for performing covering problem calculations from the above A data, D data, C data, and B data, and in the covering problem calculation, use the D data to exclude solutions that satisfy the taboo conditions and exclude solutions with higher-order beams based on the results of beam order calculations, generating a plurality of new floor plan data from the obtained solutions of the plurality of covering problems, wherein the method for generating the floor plan of the building according to claim 1 is characterized in that.

3. The binary matrix is a binary matrix generated according to the following rules (1) to (6), Each column corresponds to a certain line segment or a certain intersection point represented by the above A data, and each row represents one possible arrangement of a certain piece represented by the C data that covers the above line segment or intersection point. When, in the arrangement of the pieces in the i-th row, the line segment or intersection point represented by the A data in the j-th column is covered by the piece represented by the C data, the (i, j) element is set to 1, and when it is not covered, the (i, j) element is set to 0. A method for generating a floor plan of a building according to claim 1 or claim 2, characterized in that. (Rule) (1) A line segment is covered by pieces of the same material composition. (2) A line segment is not covered by pieces of different material compositions. (3) One line segment is not covered by a plurality of pieces. (4) One piece can cover a plurality of line segments arranged in a straight line. (5) At an intersection point, any one piece wins (exists on the intersection point), and the other pieces lose (do not exist on the intersection point). (6) At an intersection point, a piece with a larger material composition cannot be covered so as to lose to a piece with a smaller material composition.

4. An apparatus for inputting a binary matrix generated by the method according to claim 3, a forbidden condition, and a condition for excluding the number of beams to a covering problem calculation apparatus, an apparatus for generating and outputting a plurality of floor plans from solutions of the obtained plurality of covering problems, and an apparatus for generating precut data of horizontal members using a floor plan selected from those floor plans. A precut data generation system characterized by comprising.

5. For use in calculations for executing covering problem calculations and generating a new plurality of floor plan data, Floor plan generation calculation data for a building, comprising starting point coordinates, end point coordinates, and material composition of a line segment representing the location of a horizontal member, and fulcrum coordinates representing the location where the horizontal member is supported below, from the location of the horizontal members arranged on a previously created floor plan of the building and the location of the foundation or columns arranged on the floor plan.

6. An apparatus for generating floor plan generation calculation data for a building, characterized by generating binary matrix data using the following A data, D data, and C data. (A data) Data ((sx1, sy1, ex1, ey1, z1) to (sxn, syn, exn, eyn, zn)) comprising starting point coordinates, end point coordinates, and material composition of a line segment representing the location of a horizontal member from the location of the horizontal members arranged on a previously created floor plan of the building (D data) Data ((v1, w1) to (vl, wl)) comprising fulcrum coordinates representing the location where a horizontal member is supported below from the location of the foundation or columns arranged on the floor plan (C data) A piece to be arranged (coated) on the above line segment, data consisting of the length and material composition of the horizontal member ((L1, z1) to (Lk, zk))

Images