Parking space arrangement method and device and computer equipment

Abstract

The application relates to a parking space arrangement method, device and computer equipment. The method comprises the following steps: acquiring a parking space arrangement instruction, drawing a parking area according to the parking space arrangement instruction, arranging a first parking space inwards along a boundary line of the parking area according to parking space information, determining a remaining area in the parking area according to the first parking space and lane width information, and arranging a second parking space according to a parking space arrangement mode corresponding to a boundary type of the remaining area, the parking space information and the lane width information. The method can automatically arrange parking spaces in the parking area through various combined parking space arrangement modes, thereby obtaining various selectable parking space arrangement results, so that a user can select a parking space arrangement model required by engineering according to actual requirements, and the situation that the parking space arrangement result is relatively single due to the fact that parking spaces are arranged in the parking area through only one parking space arrangement mode is avoided.

Description

Technical Field

[0001] This application relates to the field of computer-aided architectural design technology, and in particular to a parking space layout method, apparatus and computer equipment. Background Technology

[0002] With the continuous development of computer technology, the use of various computer-aided design software has become an essential skill for professionals. Computer-aided design software is one of the tools that professionals strive to use to improve the efficiency of engineering design. As a crucial process in the engineering design phase, improving the efficiency of parking space layout has always been a hot research topic for researchers in the related architectural field.

[0003] In traditional techniques, computer-aided design software can use orthogonal layout methods to automatically arrange parking spaces in the area to be arranged, thus obtaining the parking space layout results. However, the parking space layout results obtained using traditional methods are relatively limited. Summary of the Invention

[0004] Therefore, it is necessary to provide a parking space layout method, device, and computer equipment to address the aforementioned technical problems.

[0005] A method for arranging parking spaces, the method comprising:

[0006] Obtain parking space layout instructions, and draw parking areas according to the parking space layout instructions, wherein the parking space layout instructions carry parking space information and lane width information;

[0007] Based on the parking space information, the first parking space is arranged inward along the boundary line of the parking area;

[0008] The remaining area in the parking area is determined based on the first parking space and the lane width information;

[0009] The second parking space is arranged according to the parking space layout method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information.

[0010] In one embodiment, the parking space information includes the parking space width and parking space length; the step of arranging the first parking space inward along the boundary line of the parking area according to the parking space information includes:

[0011] The two ends of each first boundary line of the parking area are respectively indented by a preset distance to obtain the layout path corresponding to each first boundary line of the parking area. The boundary lines of the parking area include each first boundary line of the parking area.

[0012] Based on the width and length of the parking space, a single row of parking spaces is arranged from the endpoints of each of the arrangement paths along the inner side of each arrangement path to obtain the first parking space.

[0013] In one embodiment, the parking space information further includes boundary information of the parking garage entrance and exit, and the method further includes:

[0014] Based on the boundary information of the parking garage entrance and exit, determine the overlapping area between the parking garage entrance / exit and the parking area;

[0015] Delete the first parking space in the overlapping area.

[0016] In one embodiment, determining the remaining area in the parking area based on the first parking space and the lane width information includes:

[0017] The first distance is obtained by summing the length of the first parking space and the lane width information;

[0018] The first boundary lines are moved inward by the first distance along the vertical direction of each first boundary line to obtain a first closed region formed by the moved first boundary lines, which is the remaining region.

[0019] In one embodiment, if the parking area includes a non-parking area, the method further includes:

[0020] Based on the parking space information, a third parking space is arranged outward along the second boundary line of the non-parking area;

[0021] Determining the remaining area in the parking area based on the first parking space and the lane width information includes:

[0022] The remaining area in the parking area is determined based on the first parking space, the third parking space, and the lane width information.

[0023] In one embodiment, determining the remaining area in the parking area based on the first parking space, the third parking space, and the lane width information includes:

[0024] The first distance is obtained by summing the length of the first parking space and the lane width information;

[0025] Move each of the first boundary lines inward by the first distance along the vertical direction of each of the first boundary lines to obtain a first closed region composed of the moved first boundary lines.

[0026] The second distance is obtained by summing the length of the third parking space and the lane width information;

[0027] Move each of the second boundary lines outward by the second distance along the vertical direction of each of the second boundary lines, and extend the moved second boundary lines to intersect to obtain a second closed region;

[0028] The area outside the second closed region within the first closed region is defined as the remaining region.

[0029] In one embodiment, arranging the second parking space according to the parking space layout method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information includes:

[0030] If the boundary type is the boundary endpoint of the remaining area, then double-row parking spaces are arranged according to the parking space information and the lane width information to obtain the second parking space;

[0031] The step of arranging double-row parking spaces according to the parking space information and the lane width information to obtain the second parking space includes:

[0032] Determine the extreme endpoints from each boundary endpoint of the remaining region;

[0033] Starting from the extreme endpoint, double rows of parking spaces are sequentially arranged in the remaining area along the first direction according to the parking space information and the lane width information to obtain the second parking space.

[0034] In one embodiment, the step of arranging the second parking space according to the parking space layout method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information further includes:

[0035] If the boundary type is the first boundary line of the remaining area, then double-row parking spaces are arranged according to the parking space information and the lane width information to obtain the second parking space;

[0036] The step of arranging double-row parking spaces according to the parking space information and the lane width information to obtain the second parking space includes:

[0037] Using two adjacent first boundary lines in the remaining area as reference layout paths, starting from the intersection of the reference layout paths, double rows of parking spaces are sequentially arranged in the remaining area along the second direction according to the parking space information and the lane width information to obtain the second parking space.

[0038] In one embodiment, if the parking area includes a non-parking area, the method further includes:

[0039] Delete the second parking space in the second closed area.

[0040] A parking space arrangement device, the device comprising:

[0041] The parking area drawing module is used to obtain parking space layout instructions and draw parking areas according to the parking space layout instructions. The parking space layout instructions carry parking space information and lane width information.

[0042] The first parking space arrangement module is used to arrange the first parking space inward along the boundary line of the parking area according to the parking space information;

[0043] The remaining area determination module is used to determine the remaining area in the parking area based on the first parking space and the lane width information;

[0044] The second parking space arrangement module is used to arrange the second parking space according to the parking space arrangement method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information.

[0045] A computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program performing the following steps:

[0046] Obtain parking space layout instructions, and draw parking areas according to the parking space layout instructions, wherein the parking space layout instructions carry parking space information and lane width information;

[0047] Based on the parking space information, the first parking space is arranged inward along the boundary line of the parking area;

[0048] The remaining area in the parking area is determined based on the first parking space and the lane width information;

[0049] The second parking space is arranged according to the parking space layout method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information.

[0050] The aforementioned parking space layout method, device, and computer equipment allow the computer equipment to acquire parking space layout instructions, draw a parking area based on these instructions, and arrange the first parking space inward along the boundary line of the parking area based on the parking space information. It then determines the remaining area within the parking area based on the first parking space and lane width information, and arranges the second parking space based on the parking space layout method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information. This method can automatically arrange parking spaces within a parking area using multiple combined parking space layout methods, thereby obtaining a variety of selectable parking space layout results. Users can choose the parking space layout model that best suits their engineering needs based on actual requirements, avoiding the situation where parking spaces are arranged using only one parking space layout method, resulting in a relatively monotonous parking space layout. Attached Figure Description

[0051] Figure 1 This is an internal structural diagram of a computer device in one embodiment;

[0052] Figure 2 This is a flowchart illustrating a parking space arrangement method in one embodiment;

[0053] Figure 3 This is a schematic diagram of the parking space parameter setting interface in one embodiment;

[0054] Figure 4 This is a schematic diagram of the layout model of four parking spaces obtained in another embodiment;

[0055] Figure 5 This is a flowchart illustrating a method for arranging a first parking space within a parking area in another embodiment.

[0056] Figure 6 This is a flowchart illustrating a method for deleting the first parking space inside the parking garage entrance / exit in another embodiment.

[0057] Figure 7 This is a flowchart illustrating a method for determining the remaining area in a parking area in another embodiment;

[0058] Figure 8 This is a model diagram of another embodiment, including a parking area, a non-parking area, and parking garage entrances and exits;

[0059] Figure 9 A model diagram of another embodiment including a parking area, a non-parking area, a parking garage entrance and exit, and a first parking space arranged therein, and the first parking space in the overlapping area is deleted;

[0060] Figure 10 This is a flowchart illustrating a method for determining the remaining area in a parking area in another embodiment;

[0061] Figure 11 This is a schematic flowchart illustrating a method for arranging a second parking space in the remaining area in another embodiment;

[0062] Figure 12 A model diagram of the parking space layout in another embodiment;

[0063] Figure 13 A model diagram of the parking space layout in another embodiment;

[0064] Figure 14 This is a schematic diagram showing the result of arranging parking spaces in a parking area in another embodiment;

[0065] Figure 15 This is a structural block diagram of a parking space arrangement device in one embodiment. Detailed Implementation

[0066] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0067] The parking space arrangement method provided in this application can be applied to Figure 1 The computer equipment shown. (For example...) Figure 1 As shown, the computer device includes a processor, memory, network interface, display screen, and input devices connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The computer device's database stores parking space information. The network interface allows communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a parking space arrangement method.

[0068] Those skilled in the art will understand that Figure 1 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0069] It should be noted that the parking space arrangement method provided in this application can be implemented by a parking space arrangement device, which can be implemented as part or all of a computer device through software, hardware, or a combination of software and hardware. The following method embodiments will use a computer device as an example to illustrate the implementation subject.

[0070] This embodiment describes the process of automatically arranging parking spaces in a parking area using computer equipment. The parking area can be located in an underground parking garage, a ground-level parking garage, an open-air parking garage, an indoor parking garage, or other similar environments. This embodiment does not limit the scope of the parking area.

[0071] In one embodiment, such as Figure 2 As shown, a parking space arrangement method is provided, which can be applied to... Figure 1 Taking a computer device as an example, the explanation includes the following steps:

[0072] S100. Obtain parking space layout instructions, and draw parking areas according to the parking space layout instructions. The parking space layout instructions carry parking space information and lane width information.

[0073] Specifically, the computer device can open a blank drawing interface through drawing software or a drawing webpage, then receive a command to open the parking space parameter setting interface and display it. The user sets the parking space layout parameters on this interface, and after confirmation, the computer device receives the user's parking space layout instructions. Finally, it draws the parking area based on the received instructions. The parking space parameter setting interface may include a parking space parameter setting area, parking area drawing controls, and parking space start layout controls, and may also include other functional controls and parameter setting areas.

[0074] In this embodiment, users can set parking space information and lane width information according to actual parking space layout needs on the parking space parameter setting interface. After setting, the computer device can automatically save the settings. Simultaneously, the computer device can also receive parking area drawing controls triggered by the user via mouse, touch, or voice input, and respond to the triggered parking area drawing controls by popping up a blank drawing interface. At this time, the blank drawing interface displays drawing tools; these drawing tools can be displayed at any position on the blank drawing interface, allowing users to trigger them via mouse, touch, or voice input. The computer device can receive the drawing tool trigger command and draw line segments or curves on the blank drawing interface, thereby generating the parking area. The parking space information set in this embodiment can include parking space length and parking space width, but when arranging double-layer parking spaces in the parking area, the parking space information can also include parking space height. The aforementioned lane width information can be understood as the aisle spacing distance reserved between two rows of adjacent parking spaces arranged in the parking area. The aforementioned parking area can be a closed area of ​​any shape, and the specific size of the parking area is not limited in this embodiment.

[0075] In this embodiment, the parking space parameter setting interface may include a parking space parameter setting area, a parking space preview area, parking area drawing controls, non-parking area drawing controls, parking garage entrance / exit drawing controls, and parking space start placement controls. The specific parking space parameter setting interface is as follows: Figure 3 As shown in the figure. The computer device can receive a parking space start arrangement control triggered by the user through input methods such as mouse, touch or voice, and respond to the triggered parking space start arrangement control by popping up a drawing interface with the parking area, and then automatically arranging parking spaces within the parking area.

[0076] S200. Based on the parking space information, arrange the first parking space inward along the boundary line of the parking area.

[0077] Specifically, if the parking area is rectangular, its boundary line can be a closed edge line composed of the line segments corresponding to the sides of the rectangle; if the parking area is circular, its boundary line can be a closed edge line composed of the curve segments corresponding to the circumference of the circle; other shapes are similar, and the boundary line of the parking area can be determined according to its shape.

[0078] Understandably, computer equipment can arrange single-row, double-row, multi-row, double-layer, or multi-layer parking spaces inwards along the boundary lines of the parking area based on the length and width of the parking space, or based on the length, width, and height of the parking space, to obtain the first parking space. The number of first parking spaces can be greater than or equal to one. The boundary lines of the parking area can extend inwards from the boundary lines towards the center of the parking area.

[0079] S300: Determine the remaining area in the parking area based on the first parking space and lane width information.

[0080] Specifically, the computer equipment can subtract the area occupied by the first parking space and the area occupied by the lane when the first parking space was placed from the parking area to obtain the remaining area in the parking area. Optionally, the area occupied by the lane can be determined based on the lane width information. The area of ​​the remaining area can be smaller or larger than the area occupied by the first parking space.

[0081] S400. Arrange the second parking space according to the parking space layout method, parking space information and lane width information corresponding to the boundary type of the remaining area.

[0082] Specifically, the boundary type of the remaining area can be a line segment, a curved segment, or an endpoint. The parking space layout can be a single-row parking space layout, a double-row parking space layout, a multi-row parking space layout, a double-layer parking space layout, a multi-layer parking space layout, or a layout based on a path, an endpoint, etc. In this case, the boundary type of the remaining area can correspond to multiple parking space layout methods, meaning there are multiple ways to arrange the second parking space.

[0083] Understandably, computer equipment can arrange single-row parking spaces, double-row parking spaces, multi-row parking spaces, double-layer parking spaces, or multi-layer parking spaces based on any parking space layout method corresponding to the boundary type of the remaining area, parking space information, and lane width information, to obtain the first parking space.

[0084] Furthermore, the parking space layout method can be different from or the same as the first parking space layout method. However, in this embodiment, the parking space layout method is different from the first parking space layout method. This embodiment can further obtain multiple parking space layout results, which can be represented by parking space layout models. Multiple parking space layout results can be displayed simultaneously on the drawing interface, allowing users to select the parking space layout model that best suits their engineering needs as the target parking space layout model. Any area around each parking space layout model in the drawing interface can display information such as the total number of parking spaces, the total area of ​​the parking area, and parking efficiency when different parking space layout methods are used within the parking area. The parking efficiency represents the area occupied by the parking spaces.

[0085] For example, Figure 4 The image shows four parking space layout models obtained in this embodiment. Below each model are the total number of parking spaces arranged within the parking area, the total area of ​​the parking area, and the parking efficiency. Typically, when different parking space layout methods are used, the parking information and lane width information are set the same; therefore, only the total number of parking spaces differs.

[0086] In the above parking space layout method, the computer equipment can obtain parking space layout instructions, draw a parking area according to the instructions, and arrange the first parking space inward along the boundary line of the parking area based on the parking space information. The remaining area within the parking area is determined based on the first parking space and lane width information. The second parking space is then arranged according to the parking space layout method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information. This method can first arrange the first parking space within the parking area, and then arrange the second parking space in the remaining area according to other parking space layout methods corresponding to the boundary type of the remaining area. This allows the method to automatically arrange parking spaces within the parking area through multiple combinations of parking space layout methods, thereby obtaining multiple selectable parking space layout results. This allows users to choose the parking space layout model that meets the engineering requirements based on actual needs, avoiding the situation where parking spaces are arranged in a parking area using only one parking space layout method, resulting in a relatively monotonous parking space layout. Simultaneously, this method can obtain multiple selectable parking space layout results. To improve the utilization rate of the parking area, users can choose the parking space layout model with the highest utilization rate from the multiple parking space layout results.

[0087] Figure 5A flowchart illustrating a specific method for arranging a first parking space inward along the boundary line of a parking area based on parking space information, provided in another embodiment. In this embodiment, the parking space information includes the width and length of the parking space; the step in S200 of arranging the first parking space inward along the boundary line of the parking area based on the parking space information can be implemented through the following steps:

[0088] S210. Shrink both ends of each first boundary line of the parking area by a preset distance to obtain the layout path corresponding to each first boundary line of the parking area. The boundary lines of the parking area include each first boundary line of the parking area.

[0089] Specifically, the boundary lines of a parking area can include all the first boundary lines of the parking area, and the number of first boundary lines of the parking area can be greater than or equal to 1. If the parking area is rectangular, the first boundary lines of the parking area can be the line segments corresponding to the sides of the rectangle; if the parking area is circular, the first boundary lines of the parking area can be the curve segments corresponding to the circumference of the circle. In this case, the boundary lines of the parking area are the same as the first boundary lines; other shapes are similar, and the number of first boundary lines of the parking area can be determined according to the number of intersections contained in the boundary lines of the parking area. The number of intersections contained in the boundary lines can be equal to the number of first boundary lines of the parking area.

[0090] To avoid overlapping parking spaces near the intersection of adjacent layout paths when arranging parking spaces along the first boundary lines, the computer device can indent both ends of each first boundary line of the parking area by a preset distance, and then obtain the layout path corresponding to each indented first boundary line. The preset distance can be set to any value greater than 0; in this embodiment, the preset distance can be 100cm. The number of first boundary lines can be equal to the number of layout paths; that is, the number of layout paths can be equal to or unequal to the number of boundary lines of the parking area.

[0091] For example, if a first boundary line is located on the x-axis in a two-dimensional coordinate system xoy, assuming that the line segment between x = 100cm and x = 600cm is the first boundary line, then by indenting each end of the first boundary line by 100cm, the line segment between x = 200cm and x = 500cm is obtained as the arrangement path corresponding to the first boundary line.

[0092] S220. Based on the width and length of the parking space, arrange a single row of parking spaces along the inner side of each arrangement path, starting from the endpoint of each arrangement path, to obtain the first parking space.

[0093] Specifically, the size of the parking space's footprint, or area, can be determined based on its width and length. The shape of this footprint can be either a right-angled rectangle or a slanted rectangle. In this embodiment, the specific steps are explained using a right-angled rectangle as the shape of the parking space's footprint.

[0094] It is understood that the computer equipment can arrange a single row of parking spaces along the inner side of each arrangement path, starting from any one end of the path and moving towards the other, based on the width and length of the parking space, to obtain the first parking space. Here, the inner side of the arrangement path can be understood as the side of the arrangement path that is biased towards the center of the parking area. A single row of parking spaces can be understood as a scenario where multiple adjacent parking spaces are arranged in a row. In this embodiment, the number of parking spaces included in the first parking space arrangement can be greater than or equal to one, and the specific number can be determined based on the length of the arrangement path and the width of the parking space.

[0095] The above-mentioned parking space layout method can arrange single-row parking spaces along the inner side of each boundary line of the parking area, and then determine the remaining area based on the layout result of the single-row parking spaces. Parking spaces can then be arranged in the remaining area according to different parking space layout methods. This method can obtain a variety of parking space layout results to choose from, allowing users to select the parking space layout model that meets the engineering requirements according to actual needs. This avoids the situation where parking spaces are arranged in the parking area using only one parking space layout method, resulting in a relatively monotonous parking space layout result.

[0096] As one embodiment, the parking space information also includes boundary information of the parking garage entrance and exit; such as Figure 6 As shown, the above parking space arrangement method may also include the following steps:

[0097] S500. Based on the boundary information of the parking garage entrance and exit, determine the overlapping area between the parking garage entrance / exit and the parking area.

[0098] Specifically, the boundary information of the parking garage entrance and exit can include the endpoint coordinates and shape of each endpoint of the entrance and exit, or the length, shape, and location information of each boundary line of the entrance and exit. This location information can be the specific intersection points of each boundary line with the boundary line of the parking area. Based on the boundary information of the parking garage entrance and exit, the corresponding parking garage entry / exit area can be determined. The entire area of ​​the parking garage entry / exit area may overlap with the parking area, or a portion of the entry / exit area may overlap with the parking area, while another portion may not overlap. The overlapping area can be rectangular, horizontally curved, or sloping.

[0099] S600, Delete the first parking space in the overlapping area.

[0100] In this embodiment, the first parking spaces are arranged sequentially along the boundary lines of the parking area, without avoiding the parking garage entrance and exit. Therefore, after arranging the first parking spaces, the computer device can delete the first parking spaces in the overlapping area between the parking garage entrance / exit and the parking area. If a portion of the first parking spaces intersects with the boundary of the overlapping area, these first parking spaces intersecting with the boundary of the overlapping area can also be deleted.

[0101] The above parking space layout method can obtain parking space layout results by taking into account the entrances and exits of the parking garage, making the obtained parking space layout results more accurate and improving the usability of the parking space layout method.

[0102] As one example, such as Figure 7 As shown, the step in S300 above, which determines the remaining area in the parking area based on the first parking space and lane width information, may specifically include the following steps:

[0103] S310. Sum the parking space length and lane width information of the first parking space to obtain the first distance.

[0104] Specifically, both the width and length of the parking space can be set to any value, as long as the length is greater than the width. The lane width information can be greater than or less than the parking space length; in this embodiment, the lane width information can be reasonably set to any value.

[0105] S320. Move each first boundary line inward by a first distance along the perpendicular direction of each first boundary line to obtain the first closed region formed by the moved first boundary lines as the remaining region.

[0106] Specifically, "inward" for the first boundary line can be understood as the direction from the first boundary line towards the center of the parking area. The computer device can move each first boundary line inward a first distance along its perpendicular direction, and the moved first boundary lines can form a closed region, i.e., a first closed region, which is then used as the remaining region. The area of ​​the first closed region can be smaller than the area of ​​the parking area. In this embodiment, the moved first boundary line is spaced a first distance from the original first boundary line.

[0107] The computer device can calculate the coordinates of the intersection points of the two first boundary lines after the movement, that is, the endpoint coordinates of the first closed region, and further determine the first closed region through the endpoint coordinates of the first closed region.

[0108] The above parking space arrangement method can sum the parking space length and lane width information of the first parking space to obtain the first distance, and move each first boundary line inward by the first distance along the perpendicular direction of each first boundary line to obtain the first closed area formed by the moved first boundary lines as the remaining area. Then, parking spaces are arranged in the remaining area so that the parking spaces arranged in the parking area can achieve the maximum area utilization rate.

[0109] In some scenarios, the parking area includes a non-parking area. In such scenarios, the above parking space arrangement method may also include: arranging a third parking space outward along the second boundary line of the non-parking area based on the parking space information.

[0110] For example, such as Figure 8 The image shown is a model of the parking area, non-parking area, and parking garage entrance / exit drawn in a blank drawing interface. Figure 9 The image shown is a model of the parking area, non-parking area, parking garage entrance and exit, and the first parking space in the overlapping area, drawn in a blank drawing interface.

[0111] Specifically, the boundary line of the non-parking area, i.e., the second boundary line, can be determined based on its shape. There can be one or more second boundary lines. If the non-parking area is rectangular, its boundary line can be the sides of the rectangle; if it is circular, its boundary line can be the edge of the circle; similarly, for other shapes, the number of boundary lines can be obtained based on the number of intersections of the boundary lines within the non-parking area.

[0112] It is understood that the computer equipment can arrange single-row, double-row, multi-row, double-layer, or multi-layer parking spaces outwards along the second boundary lines of the non-parking area based on the length and width of the parking space, or based on the length, width, and height of the parking space, to obtain a third parking space. The number of third parking spaces can be greater than or equal to one. The second boundary line of the non-parking area can be in the opposite direction from the second boundary line of the non-parking area to the center of the non-parking area. In this embodiment, the computer equipment can arrange single-row parking spaces outwards along the second boundary lines of the non-parking area based on the length and width of the parking space, or based on the length, width, and height of the parking space, to obtain a third parking space.

[0113] The above parking space layout method can avoid non-parking areas and arrange parking spaces within the parking area when considering the existence of non-parking areas within the parking area. This makes the obtained parking space layout results more accurate, improves the versatility of the parking space layout method, and can be applied to the layout of parking spaces in different scenarios.

[0114] In some scenarios, the parking area includes a non-parking area. In such scenarios, the step of determining the remaining area in the parking area based on the first parking space and lane width information can include: determining the remaining area in the parking area based on the first parking space, the third parking space, and lane width information.

[0115] Specifically, the aforementioned non-parking area can be a fault area, a no-parking area within a parking area, or a combination of both. When a non-parking area is included within a parking area, the computer device can arrange a single row of parking spaces both outside the non-parking area and within the parking area. Then, it calculates the remaining area within the parking area after deducting the area occupied by the single row of parking spaces and lane width information. In this embodiment, the computer device can subtract the area occupied by the first parking space, the third parking space, and lane width information from the parking area to obtain the remaining area within the parking area, so that parking spaces can be further arranged within the remaining area.

[0116] In this embodiment, the execution order of the steps can be interchanged with that of the steps in S310-S320 above, and this embodiment does not limit this.

[0117] Furthermore, the steps described above for determining the remaining area within the parking area based on the first parking space, the third parking space, and the lane width information are as follows: Figure 10 As shown, it can specifically include:

[0118] S330. Sum the parking space length and lane width information of the first parking space to obtain the first distance.

[0119] Specifically, both the width and length of the parking space can be set to any value, as long as the length is greater than the width. The lane width information can be greater than or less than the parking space length; in this embodiment, the lane width information can be reasonably set to any value. In this embodiment, the calculation method in S330 is the same as the calculation method in S310. Since the parking space length and lane width information are set the same in this embodiment, the obtained first distance will be the same even with different parking space layouts.

[0120] S340. Move each first boundary line inward by a first distance along the perpendicular direction of each first boundary line to obtain a first closed region composed of the moved first boundary lines.

[0121] Specifically, "inward" for the first boundary line can be understood as the direction from the first boundary line towards the center of the parking area. The computer device can move each first boundary line inward a first distance along its perpendicular direction, and the moved first boundary lines can form a closed region, i.e., a first closed region. The area of ​​the first closed region can be smaller than the area of ​​the parking area. In this embodiment, the moved first boundary line is spaced a first distance from the original first boundary line. In this embodiment, the processing method in S320 is the same as the processing method in S310.

[0122] S350. Sum the parking space length and lane width information of the third parking space to obtain the second distance.

[0123] In this embodiment, the parking space length and lane width information are the same. Therefore, the parking space length of the first parking space and the parking space length of the third parking space are the same. The calculation methods in S330 and S310 are the same as the calculation methods in S350. After calculation, the first distance is also equal to the second distance.

[0124] S360. Move each second boundary line outward by a second distance along the perpendicular direction of each second boundary line, and extend each moved second boundary line until they intersect to obtain a second closed region.

[0125] It is understandable that "outward" of the second boundary line can be interpreted as the direction from the second boundary line towards the corresponding first boundary line. The computer device can move each second boundary line outward a second distance along its perpendicular direction. After moving each second boundary line outward, since the length of the second boundary line is relatively short, the computer device can extend both ends of each moved second boundary line to intersect with each pair of moved second boundary lines, resulting in a closed area after intersection, i.e., the second closed area. The area of ​​the second closed area can be smaller than the area of ​​the parking area, but can be larger than the area of ​​the non-parking area. In this embodiment, the area of ​​the first closed area can be larger than the area of ​​the second closed area.

[0126] The computer device can calculate the coordinates of the intersection points of the two pairs of second boundary lines after the movement and extension, that is, the endpoint coordinates of the second closed region, and further determine the second closed region through the endpoint coordinates of the second closed region.

[0127] S370. The area in the first closed region other than the second closed region is determined as the remaining region.

[0128] Specifically, the computer device can determine a closed annular area, that is, the area between the boundary lines of the first closed area and the second closed area, by using the boundary lines of the first closed area and the second closed area, and define this annular area as the remaining area in the parking area.

[0129] This embodiment can determine the remaining area in the parking area when considering the existence of non-parking areas within the parking area, and further arrange parking spaces in the remaining area through different parking space layout methods so that the parking spaces arranged in the parking area can achieve the maximum area utilization rate.

[0130] The above parking space arrangement method can determine the remaining area in the parking area after the first parking space is arranged in the parking area, based on the actual scene of the parking area, and then arrange the second parking space in the remaining area through different parking space arrangement methods. This can avoid overlapping arrangements and maximize the area utilization of the parking spaces arranged in the parking area.

[0131] As one embodiment, the step of arranging the second parking space according to the parking space arrangement method, parking space information and lane width information corresponding to the boundary type of the remaining area in the above S400 can be achieved by the following steps: if the boundary type is the boundary endpoint of the remaining area, then arrange double-row parking spaces according to the parking space information and lane width information to obtain the second parking space.

[0132] Specifically, if the remaining area is a right-angled rectangle or a slanted rectangle, the computer equipment can use the boundary type of the remaining area as the boundary endpoint and any one of the boundary endpoints as a reference endpoint for parking space arrangement. Using the first parking space arrangement method, double-row parking spaces are arranged according to the parking space information and lane width information to obtain the second parking space. If the remaining area is circular or elliptical, the computer equipment can use any point on the boundary line of the remaining area as the boundary endpoint. The number of second parking spaces can be greater than or equal to one.

[0133] Among them, such as Figure 11 As shown, the steps described above for arranging double-row parking spaces based on parking space information and lane width information to obtain a second parking space may specifically include the following steps:

[0134] S410. Determine the extreme endpoints from the boundary endpoints of the remaining region.

[0135] Specifically, in this embodiment, the boundary endpoints of the remaining region can be represented by two-dimensional coordinates, i.e., (x, y), where x represents the coordinate value of the boundary endpoint mapped onto the X-axis, and y represents the coordinate value of the boundary endpoint mapped onto the Y-axis. The computer device can compare all the coordinate values ​​of all boundary endpoints of the remaining region mapped onto the X-axis to determine the maximum value x. max Or the minimum value x min and the maximum value x max The corresponding boundary endpoints are determined as the maximum endpoints, or the minimum value x is determined as the minimum value x. minThe corresponding boundary endpoints are determined as minimum endpoints. Additionally, the computer can compare all coordinate values ​​mapped to the Y-axis for all boundary endpoints of the remaining region to determine the maximum value y. max Or the minimum value y min and the maximum value y max The corresponding boundary endpoints are determined as the maximum endpoints, or the minimum value y is determined as the minimum value y. min The corresponding boundary endpoints are determined as minimum endpoints.

[0136] That is, the number of extreme endpoints that can be determined in this embodiment can be equal to 4, two maximum endpoints and two minimum endpoints.

[0137] S420. Starting from the extreme endpoint, arrange double-row parking spaces sequentially in the remaining area along the first direction according to the parking space information and lane width information to obtain the second parking space.

[0138] It is understood that the computer device can arbitrarily select one of the four extreme endpoints in the remaining area as a reference endpoint for parking space arrangement, and starting from the selected reference endpoint, arrange double-row parking spaces sequentially along the first direction in the remaining area according to the parking space information and lane width information to obtain the second parking space. In this embodiment, the number of parking space arrangement results obtained by sequentially arranging double-row parking spaces along the first direction in the remaining area can be equal to 4. It is also understood that the steps in S410 and S420 above can be understood as the specific process of the first parking space arrangement method.

[0139] The arrangement of four types of double-row parking spaces along the first direction within the remaining area can be described by the following example. For instance, if the selected extreme endpoint is a maximum value x mapped onto the X-axis... max The corresponding boundary endpoint of the remaining region, with coordinates (1, 2), can be the direction along the line segment y = 2 from a larger x value to a smaller x value; if the selected extreme endpoint is the minimum x value mapped onto the X-axis... min The corresponding boundary endpoint of the remaining region, with coordinates (1, 2), can be the direction along the line segment y = 2 from a smaller x value to a larger x value; if the selected extreme endpoint is the maximum value y mapped onto the Y-axis... max The corresponding boundary endpoint of the remaining region, with coordinates (1, 2), can be the direction along the line segment from a larger y value to a smaller y value at x = 1; if the selected extreme endpoint is the minimum y value mapped onto the y-axis... min Given the boundary endpoints of the corresponding remaining region, and the coordinates of the boundary endpoints are (1, 2), then the first direction mentioned above can be the direction from the smaller value of y to the larger value of y on the line segment where x = 1.

[0140] For example, in Figure 9 Based on the model, continue to arrange second parking spaces in the remaining area. Figure 12 The image shown is a model diagram of the parking space layout. Figure 13 The diagram shows the result of arranging parking spaces in a parking area. The remaining area in the parking area is a quadrilateral area. This result is the result of arranging a second parking space in the remaining area using the first parking space arrangement method.

[0141] This embodiment can arrange a second parking space in the remaining area of ​​the parking area according to the parking space layout method corresponding to the boundary type of the remaining area. This allows the method to automatically arrange parking spaces in the parking area through multiple combinations of parking space layout methods, thereby obtaining a variety of parking space layout results to choose from. This allows users to select the parking space layout model that meets the engineering requirements according to actual needs, avoiding the situation where parking spaces are arranged in the parking area using only one parking space layout method, resulting in a relatively monotonous parking space layout. At the same time, this method can obtain a variety of parking space layout results to choose from. In order to improve the utilization rate of the parking area, users can select the parking space layout model with the highest utilization rate from the various parking space layout results.

[0142] The aforementioned parking space arrangement method can arrange a second parking space in the remaining area of ​​the parking area according to the parking space arrangement method corresponding to the boundary type of the remaining area. This allows the method to automatically arrange parking spaces in the parking area through multiple combinations of parking space arrangement methods, thereby obtaining a variety of parking space arrangement results to choose from. This allows users to select the parking space arrangement model that meets the engineering requirements based on actual needs, avoiding the situation where parking spaces are arranged in the parking area using only one parking space arrangement method, resulting in a relatively monotonous parking space arrangement. At the same time, since this method can obtain a variety of parking space arrangement results to choose from, in order to improve the utilization rate of the parking area, users can select the parking space arrangement model with the highest parking area utilization rate from the various parking space arrangement results.

[0143] As one embodiment, the step of arranging the second parking space according to the parking space layout method, parking space information and lane width information corresponding to the boundary type of the remaining area in the above S400 can also be implemented by the following steps: if the boundary type is the first boundary line of the remaining area, then arrange double-row parking spaces according to the parking space information and lane width information to obtain the second parking space.

[0144] Understandably, if the shape of the remaining area is a right-angled rectangle or an oblique rectangle, the computer device can use the boundary type of the remaining area as the first boundary line of the remaining area, and use any one of the first boundary lines of the remaining area as a reference path for parking space arrangement. The second parking space arrangement method is adopted, and double-row parking spaces are arranged according to the parking space information and lane width information to obtain the second parking space.

[0145] In this embodiment, the arrangement of the first parking space and the arrangement of the second parking space can be different, and both can be collectively referred to as non-orthogonal arrangement, while the arrangement of the first parking space can be referred to as orthogonal arrangement. In this embodiment, the execution order of the step of arranging double-row parking spaces to obtain the second parking space based on parking space information and lane width information if the boundary type is the first boundary line of the remaining area can be interchanged with the step of arranging double-row parking spaces to obtain the second parking space based on parking space information and lane width information if the boundary type is the boundary endpoint of the remaining area.

[0146] The step of arranging double-row parking spaces according to parking space information and lane width information to obtain a second parking space may include: taking two adjacent first boundary lines in the remaining area as reference arrangement paths, starting from the intersection of the reference arrangement paths, arranging double-row parking spaces sequentially in the remaining area along the second direction according to the parking space information and lane width information to obtain a second parking space.

[0147] Specifically, two adjacent first boundary lines in the remaining region can be understood as L-shaped boundary lines among the various types of first boundary lines in the remaining region. The aforementioned second direction can be the inward perpendicular direction of any of the L-shaped first boundary lines. For example, see below. Figure 13 Parking area in the middle, Figure 14 The diagram shows the parking area layout, using the two adjacent first boundary lines above the remaining area as L-shaped first boundary lines and taking them as reference layout paths. Starting from the intersection of these reference layout paths, double rows of parking spaces are sequentially arranged within the remaining area along a second direction based on parking space information and lane width information. The outermost first boundary line in the diagram represents the first boundary line of the parking area. In this example, the second direction is the vertical direction inward from the upper right first boundary line of the L-shaped first boundary lines above the remaining area. Alternatively, the second direction in this example can also be set to the vertical direction inward from the upper left first boundary line of the L-shaped first boundary lines above the remaining area.

[0148] In this embodiment, a double-row parking space can be understood as an arrangement of two adjacent single-row parking spaces. That is, there is no lane width information between the two rows of parking spaces, but there is lane width information between the two double-row parking spaces. An L-shaped first boundary line in the remaining area can correspond to a second parking space arrangement method, i.e., double-row parking spaces are arranged along two first boundary lines of the L-shaped first boundary line. Therefore, by using two adjacent first boundary lines in the remaining area as reference arrangement paths to arrange double-row parking spaces, the number of parking space arrangements obtained can be equal to the number of L-shaped first boundary lines among the various types of first boundary lines in the remaining area multiplied by 2.

[0149] Furthermore, if the parking area includes a non-parking area, then after all the above steps, the above parking space arrangement method further includes: deleting the second parking space in the second closed area.

[0150] It is understandable that when non-parking areas exist within a parking area, meaning that after the second parking space is placed, there may be overlap between the second parking space and the non-parking area. Therefore, after placing the second parking space, the computer equipment can delete the second parking space within the second closed area. If a portion of the second parking space intersects with the boundary of the second closed area, those second parking spaces intersecting with the boundary of the second closed area can also be deleted.

[0151] This embodiment can obtain parking space layout results by taking into account whether the parking area includes non-parking areas, making the obtained parking space layout results more accurate and improving the usability of the parking space layout method.

[0152] The aforementioned parking space arrangement method can arrange a second parking space in the remaining area of ​​the parking area according to the parking space arrangement method corresponding to the boundary type of the remaining area. This allows the method to automatically arrange parking spaces in the parking area through multiple combinations of parking space arrangement methods, thereby obtaining a variety of parking space arrangement results to choose from. This allows users to select the parking space arrangement model that meets the engineering requirements based on actual needs, avoiding the situation where parking spaces are arranged in the parking area using only one parking space arrangement method, resulting in a relatively monotonous parking space arrangement. At the same time, since this method can obtain a variety of parking space arrangement results to choose from, in order to improve the utilization rate of the parking area, users can select the parking space arrangement model with the highest parking area utilization rate from the various parking space arrangement results.

[0153] To facilitate understanding by those skilled in the art, the parking space arrangement method provided in this application is described using a computer device as the execution subject as an example. Specifically, the method includes:

[0154] (1) Based on the parking space parameter setting interface, draw the parking area according to the received parking space layout instructions. The parking space layout instructions carry parking space information and lane width information.

[0155] (2) Shrink the two ends of each first boundary line of the parking area by a preset distance to obtain the layout path corresponding to each first boundary line of the parking area.

[0156] (3) Based on the width and length of the parking space, a single row of parking spaces is arranged from the end of each arrangement path along the inner side of each arrangement path to obtain the first parking space. The parking space information includes the width and length of the parking space.

[0157] (4) Determine the overlapping area between the parking garage entrance / exit and the parking area based on the boundary information of the parking garage entrance / exit; the parking space information also includes the boundary information of the parking garage entrance / exit.

[0158] (5) Delete the first parking space in the overlapping area.

[0159] (6) Sum the parking space length and lane width information of the first parking space to obtain the first distance.

[0160] (7) Move each first boundary line inward by a first distance along the vertical direction of each first boundary line to obtain the first closed region formed by the moved first boundary lines as the remaining region.

[0161] (8) If the parking area includes a non-parking area, a third parking space shall be arranged outward along the second boundary line of the non-parking area according to the parking space information.

[0162] (9) Sum the parking space length and lane width information of the first parking space to obtain the first distance.

[0163] (10) Move each first boundary line inward by a first distance along the vertical direction of each first boundary line to obtain the first closed region composed of the moved first boundary lines.

[0164] (11) Sum the parking space length and lane width information of the third parking space to obtain the second distance.

[0165] (12) Move each second boundary line outward by a second distance along the vertical direction of each second boundary line, and extend each second boundary line after the movement to intersect to obtain a second closed area.

[0166] (13) The area outside the second closed region in the first closed region is determined as the remaining region.

[0167] (14) If the boundary type is the boundary endpoint of the remaining region, then the extreme endpoint is determined from each boundary endpoint of the remaining region.

[0168] (15) Starting from the extreme endpoint, double-row parking spaces are arranged sequentially in the remaining area along the first direction according to the parking space information and lane width information to obtain the second parking space.

[0169] (16) If the boundary type is the first boundary line of the remaining area, then the two adjacent first boundary lines in the remaining area are used as reference layout paths. Starting from the intersection of the reference layout paths, double-row parking spaces are arranged in the remaining area in sequence along the second direction according to the parking space information and lane width information to obtain the second parking space.

[0170] (17) Delete the second parking space in the second closed area.

[0171] The specific execution process of (1) to (17) above can be found in the description of the above embodiments. The implementation principle and technical effect are similar, and will not be repeated here.

[0172] It should be understood that, although Figure 2 , Figures 5-7 and Figures 10-11 The steps in the flowchart are shown sequentially as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order in which these steps are executed, and they can be performed in other orders. Figure 2 , Figures 5-7 and Figures 10-11 At least some of the steps in the process may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but may be executed at different times. The execution order of these steps or stages is not necessarily sequential, but may be executed in turn or alternately with other steps or at least some of the steps or stages in other steps.

[0173] In one embodiment, such as Figure 15 As shown, a parking space arrangement device is provided, including: a parking area drawing module 11, a first parking space arrangement module 12, a remaining area determination module 13, and a second parking space arrangement module 14, wherein:

[0174] The parking area drawing module 11 is used to obtain parking space layout instructions and draw parking areas according to the parking space layout instructions. The parking space layout instructions carry parking space information and lane width information.

[0175] The first parking space arrangement module 12 is used to arrange the first parking space inward along the boundary line of the parking area according to the parking space information;

[0176] The remaining area determination module 13 is used to determine the remaining area in the parking area based on the first parking space and lane width information.

[0177] The second parking space arrangement module 14 is used to arrange the second parking space according to the parking space arrangement method, parking space information and lane width information corresponding to the boundary type of the remaining area.

[0178] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0179] In one embodiment, the parking space information includes the parking space width and parking space length; the first parking space arrangement module 12 includes: an arrangement path acquisition unit and a first parking space arrangement unit, wherein:

[0180] The layout path acquisition unit is used to indent the two ends of each first boundary line of the parking area by a preset distance to acquire the layout path corresponding to each first boundary line of the parking area.

[0181] The first parking space arrangement unit is used to arrange a single row of parking spaces along the inner side of each arrangement path, starting from the end of each arrangement path, according to the width and length of the parking space, to obtain the first parking space.

[0182] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0183] In one embodiment, the parking space information also includes boundary information of the parking garage entrance and exit. The parking space arrangement device further includes: an overlapping area determination module and a parking space deletion module, wherein:

[0184] The overlapping area determination module is used to determine the overlapping area between the parking garage entrance / exit and the parking area based on the boundary information of the parking garage entrance / exit.

[0185] The parking space deletion module is used to delete the first parking space in an overlapping area.

[0186] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0187] In one embodiment, the remaining region determination module 13 includes: a summation unit and a boundary line moving unit, wherein:

[0188] The summation unit is used to sum the parking space length and lane width information of the first parking space to obtain the first distance;

[0189] The boundary line moving unit is used to move each first boundary line inward by a first distance along the vertical direction of each first boundary line, so as to obtain a first closed region composed of the moved first boundary lines as the remaining region.

[0190] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0191] In one embodiment, if the parking area includes a non-parking area, the parking space arrangement device further includes: a third parking space arrangement module; wherein:

[0192] The third parking space layout module is used to arrange the third parking space outward along the second boundary line of the non-parking area based on the parking space information.

[0193] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0194] In one embodiment, the remaining region determination module 13 includes: a remaining region determination unit, wherein:

[0195] The remaining area determination unit is used to determine the remaining area in the parking area based on the first parking space, the third parking space, and the lane width information.

[0196] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0197] In one embodiment, the remaining region determination unit includes: a first summation subunit, a first boundary line movement subunit, a second summation subunit, a second boundary line movement subunit, and a remaining region determination subunit, wherein:

[0198] The first summation subunit is used to sum the parking space length and lane width information of the first parking space to obtain the first distance;

[0199] The first boundary line moving sub-unit is used to move each first boundary line inward by a first distance along the vertical direction of each first boundary line to obtain a first closed region composed of the moved first boundary lines.

[0200] The second summation subunit is used to sum the parking space length and lane width information of the third parking space to obtain the second distance;

[0201] The second boundary line moving sub-unit is used to move each second boundary line outward a second distance along the vertical direction of each second boundary line, and extend each moved second boundary line to intersect to obtain a second closed region.

[0202] The remaining region determination sub-unit is used to determine the region outside the second closed region in the first closed region as the remaining region.

[0203] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0204] In one embodiment, the second parking space arrangement module 14 includes: a second parking space arrangement unit, wherein:

[0205] The second parking space arrangement unit is used to arrange double-row parking spaces according to parking space information and lane width information when the boundary type is the boundary endpoint of the remaining area, so as to obtain the second parking space.

[0206] The aforementioned second parking space arrangement unit includes: an extreme point determination subunit and a first parking space arrangement subunit, wherein:

[0207] The extreme point determination sub-unit is used to determine the extreme endpoints from the boundary endpoints of the remaining region;

[0208] The first parking space arrangement subunit is used to arrange double rows of parking spaces sequentially in the remaining area along the first direction, starting from the extreme endpoint, based on parking space information and lane width information, to obtain the second parking space.

[0209] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0210] In one embodiment, the second parking space arrangement module 14 further includes: a third parking space arrangement unit, wherein:

[0211] The third parking space arrangement unit is used to arrange double-row parking spaces according to parking space information and lane width information when the boundary type is the first boundary line of the remaining area, so as to obtain the second parking space.

[0212] The third parking space arrangement unit is specifically used to take two adjacent boundary lines in the remaining area as reference arrangement paths, and starting from the intersection of the reference arrangement paths, arrange double rows of parking spaces in the remaining area in sequence along the second direction according to the parking space information and lane width information to obtain the second parking space.

[0213] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0214] In one embodiment, if the parking area includes a non-parking area, the second parking space arrangement module 14 further includes a parking space deletion unit, wherein:

[0215] The parking space deletion unit is used to delete the second parking space in the second closed area.

[0216] The parking space arrangement device provided in this embodiment can perform the above method embodiment, and its implementation principle and technical effect are similar, so it will not be described again here.

[0217] Specific limitations regarding the parking space arrangement device can be found in the limitations on parking space arrangement methods described above, and will not be repeated here. Each module in the aforementioned parking space arrangement device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device in hardware form, or stored in the memory of a computer device in software form, so that the processor can call and execute the corresponding operations of each module.

[0218] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

[0219] Obtain parking space layout instructions, and draw parking areas according to the parking space layout instructions. The parking space layout instructions carry parking space information and lane width information.

[0220] Based on the parking space information, the first parking space is arranged inwards along the boundary line of the parking area;

[0221] The remaining area in the parking zone is determined based on the first parking space and lane width information;

[0222] The second parking space is arranged according to the parking space layout method, parking space information, and lane width information corresponding to the boundary type of the remaining area.

[0223] In one embodiment, a readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, performs the following steps:

[0224] Obtain parking space layout instructions, and draw parking areas according to the parking space layout instructions. The parking space layout instructions carry parking space information and lane width information.

[0225] Based on the parking space information, the first parking space is arranged inwards along the boundary line of the parking area;

[0226] The remaining area in the parking zone is determined based on the first parking space and lane width information;

[0227] The second parking space is arranged according to the parking space layout method, parking space information, and lane width information corresponding to the boundary type of the remaining area.

[0228] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical storage, etc. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0229] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0230] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this patent application should be determined by the appended claims.

Claims

1. A method for arranging parking spaces, characterized in that, The method includes: Obtain parking space layout instructions, and draw parking areas according to the parking space layout instructions, wherein the parking space layout instructions carry parking space information and lane width information; Based on the parking space information, first parking spaces are arranged inward along the boundary line of the parking area; the boundary line of the parking area includes each of the first boundary lines of the parking area. The first distance is obtained by summing the length of the first parking space and the lane width information; Move each of the first boundary lines inward by the first distance along the vertical direction of each of the first boundary lines to obtain a first closed area formed by the moved first boundary lines, which is the remaining area in the parking area. The boundary type of the remaining area is determined based on the shape of the remaining area, and the second parking space is arranged according to the parking space layout method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information.

2. The method according to claim 1, characterized in that, The parking space information includes the width and length of the parking space; The step of arranging the first parking space inward along the boundary line of the parking area based on the parking space information includes: By indenting the two ends of each first boundary line of the parking area by a preset distance, the layout path corresponding to each first boundary line of the parking area is obtained. Based on the width and length of the parking space, a single row of parking spaces is arranged from the endpoints of each of the arrangement paths along the inner side of each arrangement path to obtain the first parking space.

3. The method according to claim 2, characterized in that, The parking space information also includes boundary information of the parking garage entrance and exit; the method further includes: Based on the boundary information of the parking garage entrance and exit, determine the overlapping area between the parking garage entrance / exit and the parking area; Delete the first parking space in the overlapping area.

4. The method according to claim 1 or 2, characterized in that, If the parking area includes a non-parking area, the method further includes: Based on the parking space information, a third parking space is arranged outward along the second boundary line of the non-parking area; The remaining area in the parking area is determined based on the first parking space, the third parking space, and the lane width information.

5. The method according to claim 4, characterized in that, The step of determining the remaining area in the parking area based on the first parking space, the third parking space, and the lane width information includes: The first distance is obtained by summing the length of the first parking space and the lane width information; Move each of the first boundary lines inward by the first distance along the vertical direction of each of the first boundary lines to obtain a first closed region composed of the moved first boundary lines. The second distance is obtained by summing the length of the third parking space and the lane width information; Move each of the second boundary lines outward by the second distance along the vertical direction of each of the second boundary lines, and extend the moved second boundary lines to intersect to obtain a second closed region; The area outside the second closed region within the first closed region is defined as the remaining region.

6. A parking space arrangement device, characterized in that, The device includes: The parking area drawing module is used to obtain parking space layout instructions and draw parking areas according to the parking space layout instructions. The parking space layout instructions carry parking space information and lane width information. The first parking space arrangement module is used to arrange the first parking space inward along the boundary line of the parking area according to the parking space information; the boundary line of the parking area includes each first boundary line of the parking area. The remaining area determination module is used to sum the parking space length of the first parking space and the lane width information to obtain a first distance; and to move each of the first boundary lines inward by the first distance along the vertical direction of each of the first boundary lines to obtain a first closed area composed of the moved first boundary lines as the remaining area in the parking area. The second parking space arrangement module is used to determine the boundary type of the remaining area based on the shape of the remaining area, and to arrange the second parking space according to the parking space arrangement method corresponding to the boundary type of the remaining area, the parking space information, and the lane width information.

7. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 5.

8. A readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 5.

Images