CN112948930A

CN112948930A - Building base map optimization method, computer device and storage medium

Info

Publication number: CN112948930A
Application number: CN202110221967.2A
Authority: CN
Inventors: 权国福; 杨志辉
Original assignee: Suntown Technology Group Co Ltd
Current assignee: Suntown Technology Group Co Ltd
Priority date: 2021-02-28
Filing date: 2021-02-28
Publication date: 2021-06-11
Anticipated expiration: 2041-02-28
Also published as: CN112948930B

Abstract

The invention provides a building base map optimization method, which comprises the following steps: selecting a datum point from a building structure diagram, wherein the building structure diagram comprises a plurality of primitives; obtaining coordinates of all vertexes of each primitive in the plurality of primitives; and optimizing the building structure diagram based on the coordinates of all the vertexes of each primitive and the coordinates of the reference points. The invention also provides a computer device and a storage medium for realizing the building base map optimization method. The invention can solve the problem of modeling errors caused by the fact that the size and the precision of the building base map design do not accord with the actual situation.

Description

Building base map optimization method, computer device and storage medium

Technical Field

The invention relates to the technical field of building base map processing, in particular to a building base map optimization method, a computer device and a storage medium.

Background

The drawing of the building structure from the general building design institute, due to software calculation or other non-human reasons, has a significant difference between the actual size and the marked size, such as a wall length of 1000, which may be 999.99999 or 1000.00001, and a beam width of 200, which may be 199.9999 or 200.00001. This often causes a problem of modeling failure when building a three-dimensional building model map. Often, the base map optimizer takes a lot of time to modify the detail problems, and is time-consuming and labor-consuming. The above problem is referred to as problem 1.

In addition, in the building design drawing, due to human factors, structures such as some walls, beams, plates and the like have obvious sizes which are not in accordance with practical requirements, for example, the length of one section of wall is 1003 in the process of optimizing the auditing drawing, the precision of the last 3mm is obviously difficult to achieve according to the building construction conditions, the practical size is 1000, and the problem caused by human factors is solved. This problem is referred to as problem 2.

Furthermore, the number of vertices of a primitive is larger than it is actually for unknown reasons in the construction drawing. For example, if a beam is a quadrilateral, the beam is four vertices, but in the actual modeling process, it is found that the vertices may be more than four. This problem can also cause modeling failures, requiring manual adjustments. This problem is referred to as problem 3.

Disclosure of Invention

In view of the above, there is a need for a building floor map optimization method, a computer device and a storage medium, which can solve the problem of modeling errors caused by the fact that the size and the precision of the building floor map design are not in accordance with the actual situation.

The building base map optimization method comprises the following steps: selecting a datum point from a building structure diagram, wherein the building structure diagram comprises a plurality of primitives; obtaining coordinates of all vertexes of each primitive in the plurality of primitives; and optimizing the building structure diagram based on the coordinates of all the vertexes of each primitive and the coordinates of the reference points.

Optionally, the coordinates of the reference point are (X0, Y0), and the optimizing the architectural structure diagram based on the coordinates of all vertices of each primitive and the coordinates of the reference point includes: subtracting the coordinates (Xi, Yi) of any vertex of any one of the plurality of primitives from the coordinates (X0, Y0) of the reference point to obtain a first difference dx and a second difference dy, wherein dx is Xi-X0; dy-Yi-Y0; obtaining a first remainder obtained by dividing the first difference dx by a first preset value; obtaining a second remainder of the second difference dy divided by the first preset value; when the first remainder and the second remainder are both 0, not updating the coordinates of any vertex of any primitive; and updating the coordinates of the any vertex of the any primitive from (Xi, Yi) to (Xi ', Yi') when the first remainder and/or the second remainder is not 0.

Optionally, when the first remainder is 0, Xi' ═ Xi; when the first remainder is not 0 and the first remainder is smaller than a second preset value, Xi ═ Xi-first remainder; when the first remainder is not 0 and the first remainder is greater than the second preset value, Xi ═ Xi + a third preset value-the first remainder, wherein the second preset value is equal to the third preset value divided by 2; when the first remainder is not 0 and the first remainder is equal to the second preset value, Xi ═ Xi-the first remainder or Xi ═ Xi + a third preset value-the first remainder; and when said second remainder is 0, Yi' ═ Yi; when the second remainder is not 0 and the second remainder is smaller than the second preset value, Yi ═ Yi — (second remainder); when the second remainder is not 0 and the second remainder is greater than the second preset value, Yi ═ Yi + a third preset value-the second remainder; when the second remainder is not 0 and the second remainder is equal to the second preset value, Yi ═ second remainder or Yi ═ Yi + third preset value — second remainder.

Optionally, the first preset value is a multiple of 5; and the third preset value is determined according to the maximum precision of the aluminum template construction.

Optionally, the obtaining coordinates of all vertices of each primitive in the plurality of primitives includes: traversing each primitive in each layer of the plurality of layers of the building base map; traversing the coordinates of all vertices of each primitive, including: when traversing to the first vertex of any primitive, saving the coordinate of the first vertex of any primitive; starting from traversing the second vertex of any one primitive, when the vertex of any one primitive is traversed currently, judging whether the coordinate of the vertex of any one primitive traversed currently is stored; when the coordinates of the vertex of the any one of the graphic elements traversed currently are stored, determining that the any one of the graphic elements has repeated vertices, and discarding the coordinates of the vertex of the any one of the graphic elements traversed currently; and when the coordinates of the vertex of the any one of the graphic elements which are traversed currently are not stored, storing the coordinates of the vertex of the any one of the graphic elements which are traversed currently until the coordinates of all the vertices of the any one of the graphic elements are traversed.

Optionally, the method further comprises: when any primitive has repeated vertexes, deleting the primitive from the building base map; and redrawing the primitives on the building base map according to all the saved vertexes corresponding to the any primitive.

Optionally, the plurality of layers include a wall layer, a beam layer, and a plate layer.

Optionally, the abscissa and the ordinate of the reference point are both integers.

The storage medium stores at least one instruction, and the at least one instruction when executed by the processor implements the building floor map optimization method.

The computer apparatus includes a processor for executing at least one instruction stored in a memory to implement the building floor map optimization method.

Compared with the prior art, the building base map optimization method, the computer device and the storage medium can solve the problem of modeling errors caused by the fact that the size and the precision of the building base map design do not accord with actual conditions.

Drawings

FIG. 1 is a flow chart of a building floor map optimization method according to a preferred embodiment of the present invention.

Fig. 2A-2B illustrate the effects of using the building map optimization method provided by the present application.

Fig. 3A-3B illustrate the effects of using the building map optimization method provided by the present application.

FIG. 4 is a functional block diagram of a building floor optimization system in accordance with a preferred embodiment of the present invention.

FIG. 5 is a block diagram of a computer device according to a preferred embodiment of the present invention.

Description of the main elements

Computer device	3
		Memory device	31
Processor with a memory having a plurality of memory cells	32
		Building base map optimization system	311
Determining module	301
		Execution module	302

The following detailed description will further illustrate the invention in conjunction with the above-described figures.

Detailed Description

In order that the above objects, features and advantages of the present invention can be more clearly understood, a detailed description of the present invention will be given below with reference to the accompanying drawings and specific embodiments. It should be noted that the embodiments of the present invention and features of the embodiments may be combined with each other without conflict.

In the following description, numerous specific details are set forth to provide a thorough understanding of the present invention, and the described embodiments are merely a subset of the embodiments of the present invention, rather than a complete embodiment. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.

Fig. 1 is a flowchart of a building floor map optimization method according to a preferred embodiment of the present invention.

In this embodiment, the building base map optimization method can be applied to a computer device (e.g., the computer device 3 shown in fig. 3), and for a computer device that needs building base map optimization, the building base map optimization function provided by the method of the present invention can be directly integrated on the computer device, or run on the computer device in the form of a Software Development Kit (SDK).

As shown in fig. 1, the building base map optimization method specifically includes the following steps, and the order of the steps in the flowchart may be changed and some steps may be omitted according to different requirements.

Step S1, the computer device selects a reference point from the architectural diagram, wherein the architectural diagram includes a plurality of primitives.

In this embodiment, the computer device may be responsive to user input to select the reference point from the architectural drawings. The coordinates of the reference point are (X0, Y0).

Optionally, the abscissa X0 and the ordinate Y0 of the reference point are both integers. Preferably, both X0 and Y0 are 0.

It should be noted that the starting point, i.e. the coordinate (0, 0), is selected as the reference point because the reference point is not referred to any other point in the graph, and the starting point does not have the three problems mentioned in the background art. Furthermore, generally according to the user's drawing convention, this starting point must be at the far left, and in addition, the wall in the building floor plan generally has an axis which is more accurate in size than the slab and beam, so the far left point of the wall is generally selected as the reference point. In addition, in building map design, the optimization engineer also typically places this starting point at the origin of coordinates (0, 0). In addition, if another point is randomly selected as a reference point, it is likely that the reference point itself has a problem of dimensional accuracy, so that when the reference point is compared with points on other geometric figures, all points on the figure need to be moved, and the operation result is inaccurate due to too many movements.

In addition, as will be appreciated by those skilled in the art, a building map typically includes multiple layers. The plurality of layers include, but are not limited to, wall layers, beam layers, and panel layers. Each layer includes a plurality of primitives. For example, a wall layer includes a plurality of wall primitives, a beam layer includes a plurality of beam primitives, and a panel layer includes a plurality of panel primitives, that is, a building base map includes a plurality of wall primitives, beam primitives, and panel primitives.

Step S2, the computer device obtains coordinates of all vertices of each of the plurality of primitives.

In one embodiment, the obtaining coordinates of all vertices of each primitive of the plurality of primitives comprises (a1) - (a 2):

(a1) traversing each primitive in each layer of the plurality of layers of the building base map;

(a2) traversing the coordinates of all vertices of each primitive, including: when traversing to the first vertex of any primitive, saving the coordinate of the first vertex of any primitive; starting from traversing the second vertex of any one primitive, when the vertex of any one primitive is traversed currently, judging whether the coordinate of the vertex of any one primitive traversed currently is stored; when the coordinates of the vertex of the any one of the graphic elements traversed currently are stored, determining that the any one of the graphic elements has repeated vertices, and discarding the coordinates of the vertex of the any one of the graphic elements traversed currently; and when the coordinates of the vertex of the any one of the graphic elements which are traversed currently are not stored, storing the coordinates of the vertex of the any one of the graphic elements which are traversed currently until the coordinates of all the vertices of the any one of the graphic elements are traversed.

In an embodiment, the computer device may store the information of the layer corresponding to each primitive while storing the coordinates of each vertex of each primitive.

In one embodiment, the computer device further deletes any primitive from the building base map when the any primitive has duplicate vertices; and redrawing the primitives on the building base map according to all the saved vertexes corresponding to the any primitive.

The above can solve the problem 3 mentioned in the background art.

It should be noted that, in other embodiments, if the problem 3 does not need to be solved, the computer device may not store the coordinates of the vertex of each primitive, and the computer device may directly perform step S3 after obtaining the coordinates of each vertex of each primitive.

Step S3, the computer device optimizes the architectural structure diagram based on the coordinates of all vertices of each primitive and the coordinates of the reference points.

In one embodiment, said optimizing said architectural structure map based on coordinates of all vertices of said each primitive and coordinates of said reference point comprises:

subtracting the coordinates (Xi, Yi) of any vertex of any one of the plurality of primitives from the coordinates (X0, Y0) of the reference point to obtain a first difference dx and a second difference dy, wherein dx is Xi-X0; dy-Yi-Y0;

obtaining a first remainder obtained by dividing the first difference dx by a first preset value; obtaining a second remainder of the second difference dy divided by the first preset value;

when the first remainder and the second remainder are both 0, not updating the coordinates of any vertex of any primitive; and

updating the coordinates of the any vertex of the any primitive from (Xi, Yi) to (Xi ', Yi') when the first remainder and/or the second remainder is not 0.

In this embodiment, when the first remainder is 0, Xi ═ Xi; when the first remainder is not 0 and the first remainder is smaller than a second preset value, Xi ═ Xi-first remainder; when the first remainder is not 0 and the first remainder is greater than the second preset value, Xi ═ Xi + a third preset value-the first remainder, wherein the second preset value is equal to the third preset value divided by 2; when the first remainder is not 0 and the first remainder is equal to the second preset value, Xi ═ Xi-the first remainder or Xi ═ Xi + a third preset value-the first remainder; and

in this embodiment, when the second remainder is 0, Yi' ═ Yi; when the second remainder is not 0 and the second remainder is smaller than the second preset value, Yi ═ Yi — (second remainder); when the second remainder is not 0 and the second remainder is greater than the second preset value, Yi ═ Yi + a third preset value-the second remainder; when the second remainder is not 0 and the second remainder is equal to the second preset value, Yi ═ second remainder or Yi ═ Yi + third preset value — second remainder.

In one embodiment, the first preset value is a multiple of 5. Preferably, the first preset value is 10. In one embodiment, the third preset value is determined according to the maximum precision of the aluminum formwork construction. Taking the maximum accuracy of the aluminum formwork construction as 5mm as an example, the third preset value is 5.

For clarity of the present invention, for example, assume that the first preset value is 10; the maximum precision of the aluminum formwork construction is 5mm, namely the third preset value is 5; the first difference dx between vertex a and reference point (0, 0) of a certain primitive is 5602. Since the remainder of dividing 5602 by the first preset value, i.e., 10, is 2 and the remainder 2 is smaller than the third preset value, i.e., 5 by 2, the computer device shifts the abscissa of the vertex a by 2mm to the left. For another example, assume that the first difference dx between the vertex a and the reference point (0, 0) is 5603, and the remainder 3 is greater than the third predetermined value 5 divided by 2, because the remainder of 5603 divided by the first predetermined value, i.e., 10, is 3, and the computer device moves the abscissa of the vertex a to the right (third predetermined value — first remainder), i.e., 2 mm. For another example, assuming that the first difference dx between the vertex a and the reference point (0, 0) is 5602.5, since the remainder of dividing 5602.5 by the first predetermined value, i.e., 10, is 2.5, and the remainder 2.5 is equal to the value of dividing the third predetermined value, i.e., 5 by 2, the computer device can shift the abscissa of the vertex a to the left (first remainder) by 2.5mm or to the right (third predetermined value — first remainder) by 2.5 mm. Thereby solving problems 1 and 2 in the background art.

The following describes the effect of applying the building floor map optimization method provided in the present application.

Fig. 2A shows the shear wall in the floor plan of the building design, and it is clear that this wall length is problematic, as described in problem 1, where the actual dimension should be 2100. The building base map optimization method provided by the application can be optimized as shown in fig. 2B.

Fig. 3A shows a shear wall in a base map of a building design, which obviously has a design error, and when the wall length mantissa is 3mm, accuracy cannot be guaranteed in manufacturing, and belongs to the problem 2 mentioned in the background art. If the building design precision is 5mm, the building base map optimization method provided by the application can be optimized as shown in FIG. 3B.

It should be noted that the method for optimizing the building base map is not limited to the above method.

It is to be understood that the described embodiments are for purposes of illustration only and that the scope of the appended claims is not limited to such structures.

Fig. 4 is a block diagram of a building floor plan optimization system according to a preferred embodiment of the present invention. In some embodiments, the building floor map optimization system 311 operates in the computer device 3 shown in fig. 3. The building floor optimization system 311 may include a plurality of functional modules composed of program code segments. The program codes of the various program segments in the building map optimization system 311 may be stored in the memory 31 of the computer device 3 and executed by the at least one processor 32 to implement the building map optimization function (described in detail in fig. 1).

In this embodiment, the building map optimization system 311 may be divided into a plurality of functional modules according to the functions performed by the building map optimization system. The functional module may include: a determination module 301 and an execution module 302. The module referred to herein is a series of computer program segments capable of being executed by at least one processor and capable of performing a fixed function and is stored in memory. In the present embodiment, the functions of the modules will be described in detail in the following embodiments.

The determining module 301 selects a reference point from a building structure diagram, wherein the building structure diagram includes a plurality of primitives. The execution module 302 obtains coordinates of all vertices of each primitive of the plurality of primitives; and optimizing the building structure diagram based on the coordinates of all the vertexes of each primitive and the coordinates of the reference points.

Fig. 5 is a schematic structural diagram of a computer device according to a preferred embodiment of the invention. In the preferred embodiment of the present invention, the computer device 3 comprises a memory 31, at least one processor 32, and a display 33. It will be appreciated by those skilled in the art that the configuration of the computer apparatus shown in fig. 3 does not constitute a limitation of the embodiments of the present invention, and may be a bus-type configuration or a star-type configuration, and that the computer apparatus 3 may include more or less hardware or software than those shown, or a different arrangement of components. The computer device 3 may be a computer, a mobile phone, a tablet computer, a server, or the like.

In some embodiments, the computer device 3 includes a terminal capable of automatically performing numerical calculation and/or information processing according to preset or stored instructions, and the hardware includes but is not limited to a microprocessor, an application specific integrated circuit, a programmable gate array, a digital processor, an embedded device, and the like.

It should be noted that the computer device 3 is only an example, and other electronic products that are currently available or may come into existence in the future, such as electronic products that can be adapted to the present invention, should also be included in the scope of the present invention, and are included herein by reference.

In some embodiments, the memory 31 is used for storing program codes and various data, such as the building map optimization system 311 installed in the computer device 3, and realizes high-speed and automatic access to programs or data during the operation of the computer device 3. The Memory 31 includes a Read-Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), a One-time Programmable Read-Only Memory (OTPROM), an Electrically Erasable rewritable Read-Only Memory (EEPROM), an EEPROM), a Compact Disc Read-Only Memory (CD-ROM) or other optical Disc Memory, a magnetic disk Memory, a tape Memory, or any other computer-readable storage medium capable of carrying or storing data.

In some embodiments, the at least one processor 32 may be composed of an integrated circuit, for example, a single packaged integrated circuit, or may be composed of a plurality of integrated circuits packaged with the same or different functions, including one or more Central Processing Units (CPUs), microprocessors, digital Processing chips, graphics processors, and combinations of various control chips. The at least one processor 32 is a Control Unit (Control Unit) of the computer apparatus 3, connects various components of the entire computer apparatus 3 by using various interfaces and lines, and executes various functions of the computer apparatus 3 and processes data, such as performing a building map optimization function, by running or executing programs or modules stored in the memory 31 and calling data stored in the memory 31.

Although not shown, the computer device 3 may further include a power supply (such as a battery) for supplying power to each component, and preferably, the power supply may be logically connected to the at least one processor 32 through a power management device, so as to implement functions of managing charging, discharging, and power consumption through the power management device. The power supply may also include any component of one or more dc or ac power sources, recharging devices, power failure detection circuitry, power converters or inverters, power status indicators, and the like. The computer device 3 may further include various sensors, a bluetooth module, a Wi-Fi module, and the like, which are not described herein again.

The integrated unit implemented in the form of a software functional module may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes instructions for causing a computer device (which may be a server, a personal computer, etc.) or a processor (processor) to perform parts of the methods according to the embodiments of the present invention.

In a further embodiment, in conjunction with fig. 2, the at least one processor 32 may execute the operating device of the computer device 3 and various installed application programs (such as the building floor plan optimization system 311), program code, and the like, such as the modules described above.

The memory 31 has program code stored therein, and the at least one processor 32 can call the program code stored in the memory 31 to perform related functions. For example, the modules illustrated in fig. 3 are program codes stored in the memory 31 and executed by the at least one processor 32, so as to realize the functions of the modules for the purpose of optimizing the building floor plan.

In one embodiment of the invention, the memory 31 stores one or more instructions (i.e., at least one instruction) that are executed by the at least one processor 32 for building floor map optimization purposes as shown in FIG. 1.

In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.

The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.

In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.

It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or that the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.

Finally, it should be noted that the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims

1. A building base map optimization method is characterized by comprising the following steps:

selecting a datum point from a building structure diagram, wherein the building structure diagram comprises a plurality of primitives;

obtaining coordinates of all vertexes of each primitive in the plurality of primitives; and

optimizing the architectural structure map based on the coordinates of all vertices of each primitive and the coordinates of the reference points.

2. The building map optimization method of claim 1, wherein the coordinates of the reference point are (X0, Y0), and the optimizing the building structure map based on the coordinates of all vertices of each primitive and the coordinates of the reference point comprises:

3. The building floor map optimization method according to claim 2, wherein when the first remainder is 0, Xi' ═ Xi; when the first remainder is not 0 and the first remainder is smaller than a second preset value, Xi ═ Xi-first remainder; when the first remainder is not 0 and the first remainder is greater than the second preset value, Xi ═ Xi + a third preset value-the first remainder, wherein the second preset value is equal to the third preset value divided by 2; when the first remainder is not 0 and the first remainder is equal to the second preset value, Xi ═ Xi-the first remainder or Xi ═ Xi + a third preset value-the first remainder; and

when the second remainder is 0, Yi' ═ Yi; when the second remainder is not 0 and the second remainder is smaller than the second preset value, Yi ═ Yi — (second remainder); when the second remainder is not 0 and the second remainder is greater than the second preset value, Yi ═ Yi + a third preset value-the second remainder; when the second remainder is not 0 and the second remainder is equal to the second preset value, Yi ═ second remainder or Yi ═ Yi + third preset value — second remainder.

4. The building map optimization method of claim 3, wherein the first preset value is a multiple of 5; and the third preset value is determined according to the maximum precision of the aluminum template construction.

5. The building map optimization method of claim 1, wherein said obtaining coordinates for all vertices of each of said plurality of primitives comprises:

traversing each primitive in each layer of the plurality of layers of the building base map;

traversing the coordinates of all vertices of each primitive, including: when traversing to the first vertex of any primitive, saving the coordinate of the first vertex of any primitive; starting from traversing the second vertex of any one primitive, when the vertex of any one primitive is traversed currently, judging whether the coordinate of the vertex of any one primitive traversed currently is stored; when the coordinates of the vertex of the any one of the graphic elements traversed currently are stored, determining that the any one of the graphic elements has repeated vertices, and discarding the coordinates of the vertex of the any one of the graphic elements traversed currently; and when the coordinates of the vertex of the any one of the graphic elements which are traversed currently are not stored, storing the coordinates of the vertex of the any one of the graphic elements which are traversed currently until the coordinates of all the vertices of the any one of the graphic elements are traversed.

6. The building map optimization method of claim 5, further comprising:

when any primitive has repeated vertexes, deleting the primitive from the building base map; and

and redrawing the primitives on the building base map according to all the saved vertexes corresponding to the any primitive.

7. The building map optimization method of claim 5, wherein said plurality of layers comprise wall layers, beam layers, and slab layers.

8. The building map optimization method of claim 1, wherein the abscissa and the ordinate of the reference point are integers.

9. A computer-readable storage medium, characterized in that the computer-readable storage medium stores at least one instruction which, when executed by a processor, implements the building floor map optimization method according to any one of claims 1 to 8.

10. A computer arrangement, characterized in that the computer arrangement comprises a processor for executing at least one instruction stored in a memory for implementing a method of building floor optimization according to any one of claims 1 to 8.