A wall polygon drawing method and device, a terminal device, and a storage medium

Abstract

The application relates to the technical field of wall drawing, and discloses a wall polygon drawing method, a wall polygon drawing device, terminal equipment and a storage medium, the method comprises the following steps: acquiring point sequence data and a wall thickness parameter; drawing the point sequence data to obtain center axis data; and performing wall parallel expansion on the center axis data according to the wall thickness parameter to obtain a wall polygon. The method can draw a wall polygon according to a center axis, so that the drawing efficiency and accuracy are improved.

Description

Technical Field

[0001] This invention relates to the field of wall drawing technology, and in particular to a method, apparatus, terminal device and storage medium for drawing polygonal walls. Background Technology

[0002] Currently, room modeling technology requires drawing wall polygons first to generate a room model. When drawing 2D wall polygons, it's often necessary to determine the vertices based on actual wall model standards in the real world. However, in existing technologies, multiple vertices are drawn manually, which is not only difficult but also inaccurate, making it difficult to meet requirements. Summary of the Invention

[0003] This invention provides a method, apparatus, terminal device, and storage medium for drawing polygonal walls, thereby improving drawing efficiency and accuracy by drawing polygonal walls based on the central axis.

[0004] Firstly, in order to solve the above-mentioned technical problems, the present invention provides a method for drawing polygonal walls, comprising:

[0005] Obtain point sequence data and wall thickness parameters;

[0006] The point sequence data is plotted to obtain the central axis data;

[0007] Based on the wall thickness parameters, the central axis data is expanded in parallel to obtain a wall polygon.

[0008] Preferably, the step of performing parallel expansion of the central axis data based on the wall thickness parameter to obtain a wall polygon further includes:

[0009] Based on the wall thickness parameters, the central axis data is expanded in parallel to obtain multiple expanded polygons.

[0010] When the central axis data includes a turning point, the angle corresponding to the turning point is determined.

[0011] When the angle is less than a preset angle threshold, calculate the two perpendicular points of the turning point and the outermost edges of the two corresponding expanded polygons.

[0012] The wall polygon is obtained from the two expanded polygons and the closed loop polygon formed by the two perpendicular points.

[0013] Preferably, when the angle is less than a preset angle threshold, the method further includes:

[0014] Perform an intersection determination on the innermost edges of the two expanded polygons;

[0015] When the innermost edges of the two expanded polygons cannot intersect directly, the corresponding centerline data is determined to be unreasonable data, and commission information is generated.

[0016] Preferably, the method further includes:

[0017] When the angle is greater than or equal to a preset angle threshold, the intersection of the outermost and innermost sides of the two expanded polygons corresponding to the turning point is calculated respectively to obtain the outer turning point and the inner turning point.

[0018] The wall polygon is obtained from the closed-loop polygon formed by the two expanded polygons, the outer turning point, and the inner turning point.

[0019] Preferably, the method further includes:

[0020] When the distance between the vertex of any central axis in the central axis data and other central axes is less than or equal to half of the wall thickness parameter, or when any two central axes in the central axis data intersect, it is determined that the wall polygon has self-intersection; wherein, self-intersection means that the generated wall polygon has line self-intersection or area self-intersection.

[0021] The wall polygons are split and merged to validate the self-intersecting polygon data.

[0022] Preferably, after obtaining the central axis data, the method further includes:

[0023] When the length of any central axis in the central axis data is less than or equal to half of the wall thickness parameter, the central axis is determined to be unreasonable data;

[0024] Based on the unreasonable data, a redraw prompt can be generated or the unreasonable data can be discarded.

[0025] In a second aspect, the present invention provides a wall polygon drawing device, comprising:

[0026] The data acquisition module is used to acquire point sequence data and wall thickness parameters;

[0027] The centerline drawing module is used to draw the point sequence data to obtain the centerline data;

[0028] The wall generation module is used to perform parallel expansion of the central axis data based on the wall thickness parameters to obtain a wall polygon.

[0029] Preferably, the wall generation module further includes:

[0030] A polygon generation unit is used to perform parallel expansion of the central axis data based on the wall thickness parameters to obtain multiple expanded polygons.

[0031] The turning point determination unit is used to determine the angle corresponding to the turning point when the central axis data contains a turning point.

[0032] The perpendicular point calculation unit is used to calculate the two perpendicular points between the turning point and the two outermost edges of the corresponding two expanded polygons when the angle is less than a preset angle threshold.

[0033] The wall generation unit is used to obtain the wall polygon based on the two expanded polygons and the closed loop polygon formed by the two perpendicular points.

[0034] Thirdly, the present invention also provides a terminal device, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor executes the computer program to implement the wall polygon drawing method described in any one of the above.

[0035] Fourthly, the present invention also provides a computer-readable storage medium comprising a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform the wall polygon drawing method described in any one of the above.

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

[0037] This invention provides a method for drawing polygonal walls. The method involves acquiring point sequence data and wall thickness parameters; drawing the point sequence data to obtain central axis data; and then performing parallel expansion of the central axis data based on the wall thickness parameters to obtain a wall polygon. This invention generates wall polygons by drawing the left and right sides of the central axis, reducing manual drawing costs, improving drawing efficiency, and enhancing accuracy and precision. Attached Figure Description

[0038] Figure 1 This is a schematic flowchart of a method for drawing polygonal walls according to the first embodiment of the present invention;

[0039] Figure 2 It is a traditional schematic diagram of a wall;

[0040] Figure 3 This is a schematic diagram of a wall drawing provided in an embodiment of the present invention;

[0041] Figure 4 This is another schematic diagram of wall drawing provided in an embodiment of the present invention;

[0042] Figure 5 This is another schematic diagram of wall drawing provided in an embodiment of the present invention;

[0043] Figure 6 This is another schematic diagram of wall drawing provided in an embodiment of the present invention;

[0044] Figure 7 This is another schematic diagram of wall drawing provided in an embodiment of the present invention;

[0045] Figure 8 This is another schematic diagram of wall drawing provided in an embodiment of the present invention;

[0046] Figure 9 This is another schematic diagram of wall drawing provided in an embodiment of the present invention;

[0047] Figure 10 This is a schematic diagram of a wall polygon drawing device provided in the second embodiment of the present invention. Detailed Implementation

[0048] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0049] Reference Figure 1 The first embodiment of the present invention provides a method for drawing polygonal walls, including the following steps:

[0050] S11, obtain point sequence data and wall thickness parameters;

[0051] S12, plot the point sequence data to obtain the central axis data;

[0052] S13, Based on the wall thickness parameters, perform parallel expansion of the central axis data to obtain a wall polygon.

[0053] It should be noted that, referring to Figure 2 Traditional wall drawing requires drafters to point 'af' point by point to form polygons, and then point 'gj' point to construct the openings within the polygons. This process involves many steps and makes accurate drawing difficult. This embodiment will... Figure 2 The wall shown is abstracted as an expansion of the central axis, ultimately resulting in a wall polygon.

[0054] In step S11, point sequence data and wall thickness parameters are obtained. The point sequence data is the initial data, which can be obtained from the building vector diagram. Before drawing, the wall thickness parameters need to be preset, for example, 0.2-10 meters.

[0055] In step S12, the point sequence data is plotted to obtain the central axis data. The central axis data is obtained by connecting multiple points, and the wall polygon is reconstructed using the central axis during plotting.

[0056] After obtaining the central axis data, the method further includes:

[0057] When the length of any central axis in the central axis data is less than or equal to half of the wall thickness parameter, the central axis is determined to be unreasonable data;

[0058] Based on the unreasonable data, a redraw prompt can be generated or the unreasonable data can be discarded.

[0059] It should be noted that reasonable wall data cannot be generated when vertices are too close together. Generally, the distance between the central axis vertices of wall data needs to be greater than 1 / 2 the wall thickness. When an unreasonable wall central axis data structure exists (the distance from the previous vertex is less than or equal to 1 / 2 the thickness), drawing operations on that vertex should not be allowed. For example, refer to... Figure 3 If a drafter draws a wall along the abd central axis, assuming the wall thickness is a distance of fg, and the distance db at point d is less than half the thickness, it will result in strange wall data generation if this data is used. Neither the drafter nor the computer will know what kind of data this operation is trying to generate. Therefore, this operation should be avoided, and the user should be prompted to redraw the wall, or simply discard point d and generate a wall with the central axis ab.

[0060] In step S13, the central axis data is expanded in parallel according to the wall thickness parameter to obtain a wall polygon.

[0061] In one implementation, for a typical centerline, the wall polygon can be directly obtained by performing parallel wall expansion on the centerline data. For example... Figure 4 As shown, the direction vector ab is perpendicular to ab (the normal vector) at the starting point a, and points c and d are obtained by taking distances of plus or minus 1 / 2 the width of the wall. Here, the positive direction (c to the left of the ab vector) is denoted as left, and the negative direction (d to the right of the ab vector) is denoted as right. The initial result [(initial left)c, (initial right)d] is cached. Similarly, by drawing a perpendicular line from point b to point ab, the positive direction (f to the left of the ab vector) is denoted as left, and the negative direction (e to the right of the ab vector) is denoted as right. The wall polygon generated by vector ab is the initial result with the positive direction point f added to the left and the negative direction point e added to the right, i.e., [f,c,d,e]. By generating a closed loop at the starting and ending points (copying the starting point at the ending point), the polygon closed loop [f,c,d,e,f] is obtained, which is the wall polygon.

[0062] Generally, when drawing a wall with lines, if there are more than two vertices, the unclosed vertex set is used for the next extension. The true coordinates of the outermost vertex depend on the next line segment drawing. Therefore, currently only the coordinates of cd are determined on the target polygon. The coordinates of the outermost and closed vertices are supplemented based on the vertex perpendiculars of the last input vector when the drawing is completed. For the convenience of later calculations, let's denote the temporary left vector cf and the temporary right vector de.

[0063] To facilitate understanding of the present invention, some preferred embodiments of the present invention will be described in further detail below.

[0064] In one implementation, the step of performing parallel expansion of the central axis data based on the wall thickness parameter to obtain a wall polygon further includes:

[0065] Based on the wall thickness parameters, the central axis data is expanded in parallel to obtain multiple expanded polygons.

[0066] When the central axis data includes a turning point, the angle corresponding to the turning point is determined.

[0067] When the angle is less than a preset angle threshold, calculate the two perpendicular points of the turning point and the outermost edges of the two corresponding expanded polygons.

[0068] The wall polygon is obtained from the two expanded polygons and the closed loop polygon formed by the two perpendicular points.

[0069] Reference Figure 5 Since c is the intersection of the extensions of ab and dl, when the angle of the central axis is small (e.g., within 20 degrees), the distance of cj will be too large (depending on the actual situation, such as more than twice the wall thickness), resulting in an unsightly wall. In this case, the two points (b, l) of the perpendicular lines of the central axis point j and the parallel lines on both sides can be used to replace the intersection point c of the extension lines, thereby forming the wall polygon [dlbahgfd].

[0070] In another implementation, when the angle is less than a preset angle threshold, the method further includes:

[0071] Perform an intersection determination on the innermost edges of the two expanded polygons;

[0072] When the innermost edges of the two expanded polygons cannot intersect directly, the corresponding centerline data is determined to be unreasonable data, and commission information is generated.

[0073] Specifically, when the centerline angle is too small and the wall thickness is large, the left and right vectors will be occluded by newly added left and right vectors. For example... Figure 6As shown, ije is drawn sequentially. After drawing j, the temporary left vector is ab, and the temporary right vector is hk. When drawing e, the newly added left vector ld intersects with the temporary left vector ab, requiring the extension of both line segments. Similarly, the newly added right vector hk intersects with the temporary right vector mf, also requiring the extension of both line segments. In this case, the wall drawn along this central axis is unreasonable and should be avoided. When the drafter is drawing ije, this behavior should be prevented when drawing e, and the user should be notified.

[0074] In another implementation, the method further includes:

[0075] When the angle is greater than or equal to a preset angle threshold, the intersection of the outermost and innermost sides of the two expanded polygons corresponding to the turning point is calculated respectively to obtain the outer turning point and the inner turning point.

[0076] The wall polygon is obtained from the closed-loop polygon formed by the two expanded polygons, the outer turning point, and the inner turning point.

[0077] For example, when there is a turn on the central axis, the coordinates of the current vertex are determined when the next vertex is identified. That is, when the central axis determines two vertices, the coordinates of the two vertices surrounding the first vertex are determined; when the central axis determines three vertices, the coordinates of the two vertices surrounding the second vertex are determined, and so on. Figure 5 As shown, the central axis determines three points, which in turn determines the coordinates of the two points surrounding the second vertex.

[0078] Specifically, the wall polygon is obtained through the central axis ije. First, a simple parallel expansion of the wall is performed, resulting in polygons abkha and dlmfd. The intersection point of the left vector ld (positive perpendicular direction) and the extension of the previous left side ab is c, and the intersection point of the right vector fm (negative perpendicular direction) and the extension of the previous right side hk is g. The resulting polygon is now [a, h]. Adding the left coordinate c and the right coordinate g, the current resulting polygon is [c, a, h, g]. It can be confirmed that the newly added left parallel line focus is c, and the right parallel line intersection point is g, which are the newly added vertex data within the target polygon. Additionally, for convenient subsequent calculations, the temporary left vector is cd, and the temporary right vector is gf.

[0079] When the drawing is confirmed to be complete, add temporary left-side ending vertex d, right-side ending vertex f, and a closed loop. The generated wall polygon is [dcahgfd]. If there are line segments with more than 3 points, subsequent calculations will recalculate new turning points based on the current left vector cd and right vector gf.

[0080] In yet another implementation, the method further includes:

[0081] When the distance between the vertex of any central axis in the central axis data and other central axes is less than or equal to half of the wall thickness parameter, or when any two central axes in the central axis data intersect, it is determined that the wall polygon has self-intersection; wherein, self-intersection means that the generated wall polygon has line self-intersection or area self-intersection.

[0082] The wall polygons are split and merged to validate the self-intersecting polygon data.

[0083] like Figure 7 As shown, when the distance between the vertex of any central axis in the central axis data and other central axes is less than or equal to half of the wall thickness parameter, the two central axes are close, and the generated wall polygon data is determined to be self-intersecting. It is necessary to split the existing polygon data into two independent and valid polygon data for merging. Self-intersection occurs when the generated wall polygons exhibit line self-intersection or area self-intersection. When drawing point d, the distance between d and the existing central axis ab is less than or equal to 1 / 2 the wall thickness. If the corner method is still used at this time (… Figure 5 The process of determining the vertices of a polygon will generate a self-intersecting polygon [hgfeijlkh] where edges kh and ij intersect, resulting in an invalid wall polygon. This requires splitting and merging to generate valid wall polygon data.

[0084] When drawing d, first determine if splitting is needed at point c. Using the expanded polygon constructed from point d and the previous vertex c, along with temporary left and right vectors, the wall vertices gl surrounding c can be determined. These, along with the polygon data already generated when drawing abc, form the wall polygon [gfeijlg]. The second wall polygon is constructed using gl as the left and right vertices, and lk and gh as new temporary left and right vectors (temporary vectors of the expanded polygons of c and d), resulting in the wall polygon data [hglkh]. The two wall polygons are then merged to obtain the final result.

[0085] like Figure 8 As shown, when any two central axes in the central axis data intersect, the wall is drawn through the central axis segment abce. When drawing e, it is found that ab and ce intersect. Because the generated polygon data cannot self-intersect, the existing polygon data needs to be split into two independent and valid polygon data for merging. When drawing e, it is first determined that it needs to be split at point c. Using the expanded polygon constructed from point d and the previous vertex c, and the temporary left and right vectors, the wall vertices ph around c can be determined, forming the wall polygon [hgfmqph] with the polygon data already generated when drawing abc. The second wall polygon is constructed with gl as the left and right vertices, and pj and hi as new temporary left and right vectors (temporary vectors of the expanded polygon of c and e), resulting in the wall polygon data [ihpji]. The two wall polygons are merged to obtain the final result.

[0086] like Figure 9 As shown, when drawing the wall's central axis acbm, if a new vertex is added on the first two constituent line segments, the already generated polygon data needs to be sealed. A new polygon is then drawn at the new vertex and merged. When drawing b, it is found that b is on the central axis ac. Therefore, the polygon [fdgif] formed by the central axis ac is directly sealed to form the first wall polygon. New wall data is then constructed again with point b as the initial point. The newly formed wall polygon [ljknl] is then merged with the existing [fdgif] to form the polygon [dolnpfigd].

[0087] This invention provides a method for drawing polygonal walls. The method involves acquiring point sequence data and wall thickness parameters; drawing the point sequence data to obtain central axis data; and then performing parallel expansion of the central axis data based on the wall thickness parameters to obtain a wall polygon. This invention generates wall polygons by drawing the left and right sides of the central axis, reducing manual drawing costs, improving drawing efficiency, and enhancing accuracy. Furthermore, this invention also provides methods for handling various special central axis cases.

[0088] Reference Figure 10 The second embodiment of the present invention provides a wall polygon drawing device, comprising:

[0089] The data acquisition module is used to acquire point sequence data and wall thickness parameters;

[0090] The centerline drawing module is used to draw the point sequence data to obtain the centerline data;

[0091] The wall generation module is used to perform parallel expansion of the central axis data based on the wall thickness parameters to obtain a wall polygon.

[0092] Preferably, the wall generation module further includes:

[0093] A polygon generation unit is used to perform parallel expansion of the central axis data based on the wall thickness parameters to obtain multiple expanded polygons.

[0094] The turning point determination unit is used to determine the angle corresponding to the turning point when the central axis data contains a turning point.

[0095] The perpendicular point calculation unit is used to calculate the two perpendicular points between the turning point and the two outermost edges of the corresponding two expanded polygons when the angle is less than a preset angle threshold.

[0096] The wall generation unit is used to obtain the wall polygon based on the two expanded polygons and the closed loop polygon formed by the two perpendicular points.

[0097] It should be noted that the wall polygon drawing device provided in this embodiment of the invention is used to execute all the process steps of the wall polygon drawing method in the above embodiment. The working principle and beneficial effects of the two are one-to-one, so they will not be described again.

[0098] This invention also provides a terminal device. The terminal device includes a processor, a memory, and a computer program stored in the memory and executable on the processor, such as a wall polygon drawing program. When the processor executes the computer program, it implements the steps described in the various wall polygon drawing method embodiments above, for example... Figure 1 The step S11 shown. Alternatively, when the processor executes the computer program, it implements the functions of each module / unit in the above-described device embodiments, such as the wall generation module.

[0099] For example, the computer program may be divided into one or more modules / units, which are stored in the memory and executed by the processor to complete the present invention. The one or more modules / units may be a series of computer program instruction segments capable of performing a specific function, which describe the execution process of the computer program in the terminal device.

[0100] The terminal device may be a desktop computer, laptop, handheld computer, or smart tablet, etc. The terminal device may include, but is not limited to, a processor and memory. Those skilled in the art will understand that the above components are merely examples of terminal devices and do not constitute a limitation on the terminal device. It may include more or fewer components than described above, or a combination of certain components, or different components. For example, the terminal device may also include input / output devices, network access devices, buses, etc.

[0101] The processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor. The processor is the control center of the terminal device, connecting all parts of the terminal device via various interfaces and lines.

[0102] The memory can be used to store the computer programs and / or modules. The processor implements various functions of the terminal device by running or executing the computer programs and / or modules stored in the memory and by calling data stored in the memory. The memory may mainly include a program storage area and a data storage area. The program storage area may store the operating system, at least one application program required for a function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the mobile phone (such as audio data, phonebook, etc.). In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, memory, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0103] Wherein, if the modules / units integrated in the terminal device are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, all or part of the processes in the methods of the above embodiments of the present invention can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed by a processor, it can implement the steps of the various method embodiments described above. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or certain intermediate forms. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording media, USB flash drives, portable hard drives, magnetic disks, optical disks, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium can be appropriately added or removed according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electrical carrier signals and telecommunication signals.

[0104] It should be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, in the accompanying drawings of the device embodiments provided by this invention, the connection relationships between modules indicate that they have communication connections, which can be specifically implemented as one or more communication buses or signal lines. Those skilled in the art can understand and implement this without any creative effort.

[0105] The specific embodiments described above further illustrate the purpose, technical solution, and beneficial effects of the present invention. It should be understood that the above descriptions are merely specific embodiments of the present invention and are not intended to limit the scope of protection of the present invention. In particular, it should be noted that any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention for those skilled in the art.

Claims

1. A method of wall polygon rendering, characterized by, The method comprises: acquiring point sequence data and wall thickness parameters; rendering the point sequence data to obtain center axis data; performing wall parallel expansion on the center axis data according to the wall thickness parameters to obtain wall polygons; the performing wall parallel expansion on the center axis data according to the wall thickness parameters to obtain wall polygons further comprises: performing wall parallel expansion on the center axis data according to the wall thickness parameters to obtain a plurality of expanded polygons; when the center axis data contains a turning point, judging an angle corresponding to the turning point; when the angle is less than a preset angle threshold, calculating two vertical points of the turning point and two outermost sides of the expanded polygons corresponding to the turning point; obtaining a wall polygon according to a closed-loop polygon formed by the two expanded polygons and the two vertical points; when the angle is less than the preset angle threshold, the method further comprises: judging intersection of the innermost sides of the two expanded polygons; when the innermost sides of the two expanded polygons cannot directly intersect, determining that the corresponding center axis data is unreasonable data, and generating a prompt message; the method further comprises: when the angle is greater than or equal to the preset angle threshold, calculating intersection points of the outermost sides and the innermost sides of the two expanded polygons corresponding to the turning point to obtain outer turning points and inner turning points; obtaining a wall polygon according to a closed-loop polygon formed by the two expanded polygons, the outer turning points and the inner turning points; the method further comprises: when a distance between a vertex of any center axis in the center axis data and a vertex of another center axis is less than or equal to one half of the wall thickness parameters, or when any two center axes in the center axis data intersect, determining that the wall polygon has self-intersection; wherein the self-intersection is a line self-intersection or an area self-intersection; splitting and merging the wall polygon to make the self-intersection polygon data legal.

2. The wall polygon drawing method according to any one of claim 1, wherein, after obtaining the center axis data, the method further comprises: when a length of any center axis in the center axis data is less than or equal to one half of the wall thickness parameters, determining that the center axis is unreasonable data; generating a re-rendering prompt according to the unreasonable data or discarding the unreasonable data.

3. A wall polygon drawing apparatus characterized by comprising: A device for performing the wall polygon rendering method according to any one of claims 1 to 2, comprising: a data acquisition module configured to acquire point sequence data and wall thickness parameters; a center axis rendering module configured to render the point sequence data to obtain center axis data; a wall generating module configured to perform wall parallel expansion on the center axis data according to the wall thickness parameters to obtain wall polygons.

4. The wall polygon drawing apparatus according to claim 3, wherein the wall generating module further comprises: a polygon generating unit configured to perform wall parallel expansion on the center axis data according to the wall thickness parameters to obtain a plurality of expanded polygons; a turning point judging unit configured to, when the center axis data contains a turning point, judge an angle corresponding to the turning point; a vertical point calculation unit, configured to calculate two vertical points of the turning point and two outer sides of the two corresponding expansion polygons when the angle is less than a preset angle threshold; a wall body generation unit, configured to obtain a wall body polygon according to a closed loop polygon formed by the two expansion polygons and the two vertical points.

5. A terminal device, characterized by, A computer readable storage medium, including a stored computer program, wherein the computer program, when executed by a processor, implements the wall body polygon drawing method according to any one of claims 1 to 2.

6. A computer-readable storage medium, characterized in that, The computer readable storage medium includes a stored computer program, wherein the computer program, when executed, controls a device in which the computer readable storage medium is located to implement the wall body polygon drawing method according to any one of claims 1 to 2.

Images