CN115906224A

CN115906224A - Parking space arrangement method and device and computer equipment

Info

Publication number: CN115906224A
Application number: CN202111166396.3A
Authority: CN
Inventors: 尤勇敏; 请求不公布姓名
Original assignee: Jiangsu Lvling Digital City And Intelligent Construction Research Institute Co ltd
Current assignee: Jiangsu Lvling Digital City And Intelligent Construction Research Institute Co ltd
Priority date: 2021-09-30
Filing date: 2021-09-30
Publication date: 2023-04-04

Abstract

The application relates to a parking space arrangement method and device and computer equipment. The method comprises the following steps: the method comprises the steps of obtaining a parking space arrangement instruction, drawing a parking area according to the parking space arrangement instruction, arranging a first parking space inwards along the boundary line of the parking area according to parking space information, determining a residual 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, parking space information and lane width information corresponding to the boundary type of the residual area. By adopting the method, the parking spaces can be automatically arranged in the parking area through various combined parking space arrangement modes, so that various optional parking space arrangement results are obtained, a user can select a parking space arrangement model according to actual requirements, and the situation that the parking spaces are arranged in the parking area only through one parking space arrangement mode and the parking space arrangement result is single is avoided.

Description

Parking space arrangement method and device and computer equipment

Technical Field

The application relates to the technical field of computer-aided building design, in particular to a parking space arrangement method and device and computer equipment.

Background

With the continuous development of computer technology, the use of various auxiliary design software becomes necessary skills for practitioners. Computer aided design software is one of the tools that practitioners seek to improve engineering efficiency. Parking space arrangement is one of important processes in an engineering design stage, and improvement of design efficiency of the parking space arrangement is always a hot problem for research of researchers in related building fields.

In the conventional technology, computer aided design software can automatically perform parking space arrangement on an area to be arranged by adopting an orthogonal arrangement method so as to obtain a parking space arrangement result. However, the parking space arrangement result obtained by the conventional method is relatively single.

Disclosure of Invention

Therefore, it is necessary to provide a parking space arrangement method, a parking space arrangement device and a computer device for solving the above technical problems

A parking space arrangement method, the method comprising:

acquiring a parking space arrangement instruction, and drawing a parking area according to the parking space arrangement instruction, wherein the parking space arrangement instruction carries parking space information and lane width information;

arranging a first parking space inwards along a boundary line of the parking area according to the parking space information;

determining the remaining area in the parking area according to the first parking space and the lane width information;

and arranging a second parking space according to the parking space arrangement mode, the parking space information and the lane width information corresponding to the boundary type of the residual area.

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

respectively retracting two ends of each first boundary line of the parking area by preset distances to obtain an arrangement path corresponding to each first boundary line of the parking area, wherein the boundary line of the parking area comprises each first boundary line of the parking area;

and arranging single-row parking spaces along the inner sides of the arrangement paths from the end points of the arrangement paths according to the width and the length of the parking spaces to obtain the first parking spaces.

In one embodiment, the parking space information further includes boundary information of an entrance and an exit of a parking garage, and the method further includes:

determining an overlapping area between the entrance and the exit of the parking garage and the parking area according to the boundary information of the entrance and the exit of the parking garage;

deleting the first parking space in the overlapping region.

In one embodiment, the determining the remaining area in the parking area according to the first parking space and the lane width information includes:

summing the parking space length of the first parking space and the lane width information to obtain a first distance;

and moving each first boundary line inwards by the first distance along the vertical direction of each first boundary line to obtain a first closed area formed by each moved first boundary line as the residual area.

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

arranging a third parking space outwards along a second boundary line of the non-parking area according to the parking space information;

the determining a remaining area in the parking area according to the first parking space and the lane width information includes:

determining a remaining area in the parking area according to the first parking space, the third parking space, and the lane width information.

In one embodiment, the determining a remaining area in the parking area according to the first parking space, the third parking space, and the lane width information includes:

moving each first boundary line inwards by the first distance along the vertical direction of each first boundary line to obtain a first closed area formed by the moved first boundary lines;

summing the parking space length of the third parking space and the lane width information to obtain a second distance;

moving the second boundary lines outwards by the second distance along the vertical direction of the second boundary lines, and extending the moved second boundary lines to intersect to obtain a second closed area;

determining an area of the first closed area other than the second closed area as the remaining area.

In one embodiment, the arranging the second parking space according to the parking space arrangement manner, the parking space information, and the lane width information corresponding to the boundary type of the remaining area includes:

if the boundary type is the boundary endpoint of the residual area, arranging double rows of parking spaces according to the parking space information and the lane width information to obtain a second parking space;

wherein, the arranging double-row parking spaces according to the parking space information and the lane width information to obtain the second parking space comprises:

determining extreme end points from all boundary end points of the residual region;

and sequentially arranging double rows of parking spaces in the residual area along a first direction according to the parking space information and the lane width information from the extreme value endpoint to obtain the second parking space.

In one embodiment, the arranging a second parking space according to the parking space arrangement manner, the parking space information, and the lane width information corresponding to the boundary type of the remaining area further includes:

if the boundary type is the first boundary line of the residual area, arranging double rows of parking spaces according to the parking space information and the lane width information to obtain a second parking space;

and taking two adjacent first boundary lines in the residual area as reference arrangement paths, and sequentially arranging double rows of parking spaces in the residual area from the intersection point of the reference arrangement paths along a second direction according to the parking space information and the lane width information to obtain the second parking space.

deleting the second parking space in the second closed area.

A parking space arrangement apparatus, the apparatus comprising:

the parking area drawing module is used for acquiring a parking space arrangement instruction and drawing a parking area according to the parking space arrangement instruction, wherein the parking space arrangement instruction carries parking space information and lane width information;

the first parking space arrangement module is used for inwards arranging first parking spaces along the boundary line of the parking area according to the parking space information;

a remaining area determining module, configured to determine a remaining area in the parking area according to the first parking space and the lane width information;

and the second parking space arrangement module is used for arranging a second parking space according to the parking space arrangement mode corresponding to the boundary type of the residual area, the parking space information and the lane width information.

A computer device comprising a memory and a processor, the memory storing a computer program, the processor implementing the following steps when executing the computer program:

arranging a first parking space inwards along the boundary line of the parking area according to the parking space information;

According to the parking space arrangement method, the parking space arrangement device and the computer equipment, the computer equipment can obtain a parking space arrangement instruction, a parking area is drawn according to the parking space arrangement instruction, a first parking space is inwards arranged along the boundary line of the parking area according to the parking space information, the remaining area in the parking area is determined according to the first parking space and the lane width information, and a second parking space is arranged according to the parking space arrangement mode, the parking space information and the lane width information corresponding to the boundary type of the remaining area.

Drawings

FIG. 1 is a diagram illustrating an internal structure of a computer device according to an embodiment;

FIG. 2 is a schematic flow chart illustrating a parking space arrangement method according to an embodiment;

FIG. 3 is a schematic diagram of a parking space parameter setting interface in one embodiment;

fig. 4 is a schematic diagram of four parking space arrangement models acquired in another embodiment;

FIG. 5 is a schematic flow chart illustrating a method for arranging a first parking space in a parking area according to another embodiment;

FIG. 6 is a flowchart illustrating a method for removing a first parking space from an entrance of a parking garage according to another embodiment;

FIG. 7 is a flowchart illustrating a method for determining remaining areas in a parking area according to another embodiment;

FIG. 8 is a diagram of a model comprising a parking area, a non-parking area and a doorway of a parking garage in another embodiment;

FIG. 9 is a model diagram of another embodiment comprising a parking area, a non-parking area and a parking garage entrance and exit with a first parking space deployed, with the first parking space in the overlap area removed;

FIG. 10 is a flowchart illustrating a method for determining remaining areas in a parking area according to another embodiment;

fig. 11 is a schematic flow chart of a method for arranging a second parking space in the remaining area according to another embodiment;

FIG. 12 is a model diagram of a parking space arrangement result in another embodiment;

FIG. 13 is a model diagram showing a result of the arrangement of parking spaces in another embodiment;

FIG. 14 is a diagram illustrating the result of arranging parking spaces in a parking area according to another embodiment;

fig. 15 is a block diagram showing a structure of a parking space arrangement apparatus according to an embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

The parking space arrangement method provided by the application can be applied to the computer equipment shown in fig. 1. As shown in fig. 1, the computer apparatus includes a processor, a memory, a network interface, a display screen, and an input device, which are connected through a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing parking space information. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a parking space arrangement method.

Those skilled in the art will appreciate that the architecture shown in fig. 1 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.

It should be noted that, in the parking space arrangement method provided in the embodiment of the present application, an execution main body of the parking space arrangement method may be a parking space arrangement apparatus, and the apparatus may be implemented as part or all of a computer device by software, hardware, or a combination of software and hardware. The execution subjects of the method embodiments described below are described taking a computer device as an example.

The present embodiment is a process for implementing automatic arrangement of parking spaces in a parking area by a computer device, where the parking area may be located in an underground parking garage, or may be located in a ground parking garage, an open parking garage, an indoor parking garage, or other environments, and this embodiment is not limited thereto.

In one embodiment, as shown in fig. 2, a parking space arrangement method is provided, which is exemplified by the method applied to the computer device in fig. 1, and includes the following steps:

s100, acquiring a parking space arrangement instruction, and drawing a parking area according to the parking space arrangement instruction, wherein the parking space arrangement instruction carries parking space information and lane width information.

Specifically, the computer device can open a blank drawing interface through drawing software or a drawing webpage, then receive a parking space parameter setting interface opening instruction, display a parking space parameter setting interface, set a parking space arrangement parameter on the parking space parameter setting interface by a user, and finally draw a parking area according to the received parking space arrangement instruction after the parking space arrangement parameter is determined so that the computer device receives the parking space arrangement instruction set by the user. The parking space parameter setting interface can comprise a parking space parameter setting area, a parking space area drawing control and a parking space starting arrangement control, and can also comprise other function controls and a parameter setting area.

The parking space parameter setting interface is used for setting parking space information and lane width information according to actual parking space arrangement requirements, and after the setting is completed, the computer equipment can automatically save the setting result. Meanwhile, the computer equipment can also receive a parking area drawing control triggered by a user through input modes such as a mouse, touch or voice and the like, and responds to the triggered parking area drawing control to pop up a blank drawing interface, wherein at the moment, a drawing tool is displayed on the blank drawing interface; the drawing tool can be displayed at any position in the blank drawing interface so that a user can trigger the drawing tool through input modes such as a mouse, touch or voice, and the like. The parking space information set by the embodiment may include a parking space length and a parking space width, but when a double-layer parking space is arranged in the parking area, the parking space information may further include a parking space height. The lane width information may be understood as a reserved aisle separation distance between two rows of adjacent parking spaces arranged in the parking area. The parking area may be a closed area with any shape, and the specific size of the parking area is not limited in this embodiment.

In this embodiment, the parking space parameter setting interface may include a parking space parameter setting area, a parking space preview area, a parking area drawing control, a non-parking area drawing control, a parking garage entrance/exit drawing control, and a parking space arrangement starting control, and the specific parking space parameter setting interface is as shown in fig. 3. The computer equipment can receive a parking space arrangement starting control triggered by a user through a mouse, touch or voice input mode and the like, pop up a drawing interface with a parking area in response to the triggered parking space arrangement starting control, and then automatically arrange the parking space in the parking area.

And S200, arranging a first parking space inwards along the boundary line of the parking area according to the parking space information.

Specifically, if the parking area is rectangular, the boundary line of the parking area may be a closed edge line formed by line segments corresponding to each side of the rectangle; if the parking area is circular, the boundary line of the parking area can be a closed edge line formed by curve segments corresponding to the circumference of the circle; other shapes are similar, and the boundary line of the parking area may be determined according to the shape of the parking area.

It can be understood that the computer device may obtain the first parking space by arranging a single-row parking space, a double-row parking space, a multi-row parking space, a double-layer parking space, or a multi-layer parking space inwards along each boundary line of the parking area according to the parking space length and the parking space width, or according to the parking space length, the parking space width, and the parking space height. The number of first parking spaces may be 1 or more. The boundary line of the parking region may be inward in a direction from the boundary line of the parking region toward the center of the parking region.

And S300, determining the remaining area in the parking area according to the first parking space and the lane width information.

Specifically, the computer device may remove the area occupied by the first parking space and the area occupied by the lane when the first parking space is arranged from the parking area, to obtain the remaining area in the parking area. Alternatively, the area occupied by the lane may be determined based on the lane width information. The area of the remaining area may be smaller than the area occupied by the first parking space, or may be larger than the area occupied by the first parking space.

And S400, arranging a second parking space according to the parking space arrangement mode, the parking space information and the lane width information corresponding to the boundary type of the remaining area.

Specifically, the boundary type of the remaining region may be a line segment, a curve segment, or an end point. The parking space arrangement mode can be a single-row parking space arrangement mode, a double-row parking space arrangement mode, a multi-row parking space arrangement mode, a double-layer parking space arrangement mode, a multi-layer parking space arrangement mode, a route arrangement mode, an endpoint arrangement mode and the like. The boundary type of the remaining area may correspond to a plurality of parking space arrangement modes, that is, a plurality of parking space arrangement modes for arranging the second parking space are provided.

It can be understood that the computer device may arrange a single-row parking space, a double-row parking space, a multi-row parking space, a double-layer parking space, or a multi-layer parking space according to any parking space arrangement manner, parking space information, and lane width information corresponding to the boundary type of the remaining area, to obtain the first parking space.

In addition, the arrangement mode of the parking spaces and the arrangement mode of the first parking spaces may be different or the same. However, in the present embodiment, the arrangement of the parking spaces is different from that of the first parking spaces. The parking space layout model can be displayed on a drawing interface, so that a user can select a parking space layout model with engineering requirements as a target parking space layout model according to actual requirements. Any area around each parking space arrangement model in the drawing interface can display information such as the total number of correspondingly arranged parking spaces, the total area of the parking area, the parking efficiency and the like when the parking spaces are arranged in the parking area in different parking space arrangement modes, and the parking efficiency can represent the occupied area of the parking spaces.

For example, fig. 4 shows four parking space arrangement models obtained in this embodiment, and the total number of parking spaces correspondingly arranged in the parking area, the total area of the parking area, and the parking efficiency are displayed below each parking space arrangement model. Generally, when different parking space arrangement modes are adopted to arrange parking spaces, the set parking information and the set lane width information are the same, and therefore, only the total number of the corresponding arranged parking spaces is different.

In the parking space arrangement method, the computer device can obtain a parking space arrangement instruction, draw a parking area according to the parking space arrangement instruction, inwards arrange a first parking space along a boundary line of the parking area according to parking space information, determine a remaining area in the parking area according to the first parking space and lane width information, and arrange a second parking space according to a parking space arrangement mode, parking space information and lane width information corresponding to the boundary type of the remaining area; according to the method, the first parking spaces can be arranged in the parking area, and then the second parking spaces are arranged in the remaining area of the parking area according to other parking space arrangement modes corresponding to the boundary types of the remaining area, so that the method can automatically arrange the parking spaces in the parking area through various combined parking space arrangement modes, and therefore various optional parking space arrangement results are obtained, a user can select a parking space arrangement model according to actual requirements, and the situation that the parking spaces are arranged in the parking area only through one parking space arrangement mode, and the parking space arrangement results are relatively single is avoided; meanwhile, the method can obtain various optional parking space arrangement results, and in order to improve the utilization rate of the parking area, a user can select a parking space arrangement model with the maximum utilization rate of the parking area from the various parking space arrangement results.

Fig. 5 is a flowchart of another embodiment of a specific method for arranging a first parking space inward along a boundary line of a parking area according to parking space information. In this embodiment, the parking space information includes a parking space width and a parking space length; the step of arranging the first parking spaces inward along the boundary line of the parking area according to the parking space information in S200 above may be implemented by:

s210, respectively retracting two ends of each first boundary line of the parking area by a preset distance, and acquiring an arrangement path corresponding to each first boundary line of the parking area, wherein the boundary line of the parking area comprises each first boundary line of the parking area.

Specifically, the boundary lines of the parking areas may include first boundary lines of the parking areas, and the number of the first boundary lines of the parking areas may be 1 or more. If the parking area is rectangular, the first boundary line of the parking area may be a line segment corresponding to each side of the rectangle; if the parking area is circular, the first boundary line of the parking area may be a curved line segment corresponding to the circumference of the circle, in which case the boundary line of the parking area is the same as the first boundary line; other shapes are also similar, and the number of the first boundary lines of the parking area may be determined according to the number of intersections included in the boundary lines of the parking area, and the number of intersections included in the boundary lines may be equal to the number of the first boundary lines of the parking area.

In order to avoid overlapping of parking spaces near the intersection positions of adjacent arrangement paths when the parking spaces are arranged along the first boundary lines for the arrangement paths, the computer device may respectively retract both ends of each first boundary line of the parking area by a preset distance, and then acquire the arrangement paths corresponding to the retracted first boundary lines. The preset distance may be set to any value greater than 0, and in the present embodiment, the preset distance may be 100cm. The number of the first borderlines may be equal to the number of the arrangement paths, that is, the number of the arrangement paths may be equal to or different from the number of the borderlines of the parking area.

Illustratively, if a first boundary line is located on the x-axis of the two-dimensional coordinate system xoy, and a line segment from x =100cm to x =600cm is assumed as the first boundary line, both ends of the first boundary line are respectively retracted by 100cm, and a line segment from x =200cm to x =500cm is obtained as the arrangement path corresponding to the first boundary line.

And S220, arranging single-row parking spaces along the inner sides of the arrangement paths from the end points of the arrangement paths according to the width and length of the parking spaces to obtain first parking spaces.

Specifically, the size of the occupied area of the parking space, that is, the occupied area of the parking space can be determined according to the width and the length of the parking space. The shape of the occupied area of the parking space can be a right-angle rectangle or an oblique rectangle. In this embodiment, the specific steps will be explained with the shape of the floor area of the parking space as a right-angled rectangle.

It is understood that the computer device may arrange the parking spaces in a single row from any one end point to the other end point of each arrangement path along the inner side of each arrangement path according to the parking space width and the parking space length, resulting in the first parking space. Here, the inner side of the arrangement path may be understood as a side of the arrangement path biased toward the center of the parking area. A single row of parking spaces may be understood as a scene in which a plurality of adjacent parking spaces are arranged in a row. In this embodiment, the number of parking spaces included in the first parking space in the specific arrangement may be greater than or equal to 1, and the specific number may be determined according to the length of the arrangement path and the width of the parking space.

According to the parking space arrangement method, the single-row parking spaces can be arranged along the inner sides of the boundary lines of the parking area, the residual area is determined according to the arrangement result of the single-row parking spaces, and the parking spaces are continuously arranged in the residual area according to different parking space arrangement modes, so that various optional parking space arrangement results can be obtained through the method, a user can select a parking space arrangement model with engineering requirements according to actual requirements, and the situation that the parking spaces are arranged in the parking area only through one parking space arrangement mode and the arrangement result of the parking spaces is single is avoided.

As one of the embodiments, the parking space information further includes boundary information of an entrance and an exit of the parking garage; as shown in fig. 6, the parking space arrangement method may further include the steps of:

s500, determining an overlapping area between the entrance and the exit of the parking garage and the parking area according to the boundary information of the entrance and the exit of the parking garage.

Specifically, the boundary information of the entrance and exit of the parking garage may include end point coordinates of each end point of the entrance and exit of the parking garage and a shape of the entrance and exit of the parking garage, or include length, shape and position information of each boundary line of the entrance and exit of the parking garage, and the position information may be a specific intersection position of each boundary line and a boundary line of a parking area. And determining the parking garage entrance and exit area corresponding to the parking garage entrance and exit according to the boundary information of the parking garage entrance and exit. The parking garage comprises a parking garage, a parking garage access area, a parking garage parking area and a parking area, wherein the parking garage access area is arranged in the parking garage, the parking area is arranged in the parking garage, and the parking garage access area is arranged in the parking garage. The overlap area may be rectangular, flat curved or sloped curved.

S600, deleting the first parking space in the overlapping area.

In this embodiment, when the first parking spaces are arranged, the first parking spaces are sequentially arranged inward along each boundary line of the parking area, and the first parking spaces are not arranged after avoiding the entrance and exit of the parking garage, so that the computer device can delete the first parking spaces in the overlapping area between the entrance and exit of the parking garage and the parking area after the first parking spaces are arranged. If the partial area of the first parking space intersects with the boundary of the overlap area, the first parking spaces intersecting with the boundary of the overlap area can be deleted at the same time.

According to the parking space arrangement method, the parking space arrangement result can be obtained under the condition that the entrance and the exit of the parking garage are considered, so that the obtained parking space arrangement result is more accurate, and the usability of the parking space arrangement method is improved.

As an embodiment, as shown in fig. 7, the step of determining the remaining area in the parking area according to the first parking space and the lane width information in S300 may specifically include the following steps:

and S310, summing the parking space length and the lane width information of the first parking space to obtain a first distance.

Specifically, parking stall width and parking stall length all can set up to arbitrary numerical value, as long as the length on parking stall is greater than the width on parking stall can. The lane width information may be larger than the parking space length or smaller than the parking space length, and in this embodiment, the lane width information may be set to any value.

S320, moving each first boundary line inwards by a first distance along the vertical direction of each first boundary line to obtain a first closed area formed by each moved first boundary line as a residual area.

In particular, the first borderline inwards may be understood as a direction from the first borderline towards the center of the parking area. The computer device may move each first borderline inward by a first distance in a direction perpendicular to the first borderline, and may form one closed area, i.e. a first closed area, by the moved first borderlines, further take the first closed area as a remaining area. The area of the first closed region may be smaller than the area of the parking region. In this embodiment, the first boundary line after the movement is separated from the first boundary line before the movement by a first distance.

The computer device may calculate intersection coordinates of the two moved first boundary lines, that is, end point coordinates of the first closed region, and further determine the first closed region by the end point coordinates of the first closed region.

The parking space arrangement method can sum the parking space length and the lane width information of the first parking space to obtain a first distance, move each first boundary line inwards by the first distance along the vertical direction of each first boundary line to obtain a first closed area formed by each moved first boundary line as a residual area, and then arrange the parking spaces in the residual area so as to enable the parking spaces arranged in the parking area to achieve the maximum area utilization rate.

In some scenarios, the parking space arrangement method may further include: and arranging a third parking space outwardly along a second boundary line of the non-parking area according to the parking space information.

For example, fig. 8 is a diagram of a model of parking area, non-parking area and parking garage entrance/exit plotted in a blank plot interface. Fig. 9 is a model diagram of a parking area, a non-parking area and a parking garage entrance and exit as well as a first parking space arranged and a first parking space in an overlap area removed as drawn in a blank drawing interface.

Specifically, the boundary line of the non-parking area, that is, the second boundary line, may be determined according to the shape of the non-parking area, and the number of the second boundary lines may be one or more. If the shape of the non-parking area is a rectangle, the boundary line of the non-parking area can be each side of the rectangle; if the shape of the non-parking area is circular, the boundary line of the non-parking area can be a circular edge line; other shapes are similar, and the boundary lines of the non-parking areas with corresponding number can be obtained according to the number of intersection points of the boundary lines in the non-parking areas.

It can be understood that the computer device may arrange a single-row parking space, a double-row parking space, a multi-row parking space, a double-layer parking space, or a multi-layer parking space along each second boundary line of the non-parking area outwards according to the parking space length and the parking space width, or according to the parking space length, the parking space width, and the parking space height, to obtain a third parking space. The number of the third parking spaces may be 1 or more. The second boundary line of the non-parking region may be inward in a direction opposite to the center of the non-parking region from the second boundary line of the non-parking region. In this embodiment, the computer device may arrange the single-row parking spaces outward along the respective second boundary lines of the non-parking area according to the parking space length and the parking space width, or according to the parking space length, the parking space width, and the parking space height, to obtain the third parking spaces.

According to the parking space arrangement method, under the condition that the situation that the non-parking area exists in the parking area is considered, the situation that the non-parking area arranges the parking spaces in the parking area is avoided, the obtained parking space arrangement result is more accurate, the universality of the parking space arrangement method is improved, and the parking space arrangement method can be suitable for arranging the parking spaces in different situations.

In some scenarios, the parking area includes a non-parking area, and the determining the remaining area in the parking area according to the first parking space and the lane width information may include: determining a remaining area in the parking area according to the first parking space, the third parking space and the lane width information.

Specifically, the non-parking area may be a failure area, an area where parking is prohibited in the parking area, or a combination of both areas. When the non-parking area is included in the parking area, the computer apparatus may arrange single-row parking spaces outside the non-parking area and inside the parking area, and thereafter, calculate a remaining area in the parking area excluding the single-row parking spaces and the area occupied by the lane width information. In this embodiment, the computer device may subtract the area occupied by the first parking space, the third parking space, and the lane width information from the parking area to obtain a remaining area in the parking area, so as to further arrange the parking spaces in the remaining area.

The steps in this embodiment and the execution sequence of the steps in S310 to S320 may be interchanged, which is not limited in this embodiment.

Further, the step of determining the remaining area in the parking area according to the first parking space, the third parking space and the lane width information may specifically include, as shown in fig. 10:

s330, summing the parking space length and the lane width information of the first parking space to obtain a first distance.

Specifically, parking stall width and parking stall length all can set up to arbitrary numerical value, as long as the length on parking stall is greater than the width on parking stall can. The lane width information may be larger than the parking space length or smaller than the parking space length, and in this embodiment, the lane width information may be set to any value. In the present embodiment, the calculation method in S330 is the same as the calculation method in S310. The parking space length and the lane width information set by the embodiment are the same, and even if different parking space arrangement modes are adopted, the acquired first distance is also the same.

S340, moving each first boundary line inwards by a first distance along the vertical direction of each first boundary line to obtain a first closed area formed by each moved first boundary line.

Specifically, the first boundary line inward may be understood as a direction from the first boundary line toward the center of the parking area. The computer device may move the first borderlines inward by a first distance in a direction perpendicular to the first borderlines, and may form a closed area, i.e. a first closed area, by the moved first borderlines. The area of the first closed region may be smaller than the area of the parking region. In this embodiment, the first boundary line after the movement is separated from the first boundary line before the movement by a first distance. In the present embodiment, the processing method in S320 described above is the same as the processing method in S310 described above.

And S350, summing the parking space length and the lane width information of the third parking space to obtain a second distance.

The parking space length and the lane width information set in this embodiment are the same, so the parking space length of the first parking space is the same as the parking space length of the third parking space, the calculation methods in S330 and S310 are the same as the calculation method in S350, and the calculated first distance is also equal to the second distance.

And S360, moving the second boundary lines outwards for a second distance along the vertical direction of the second boundary lines, and extending the moved second boundary lines to intersect to obtain a second closed area.

It is understood that the second borderline outwards may be understood as a direction from the second borderline towards the corresponding first borderline. The computer device may move each second boundary line outward by a second distance in a direction perpendicular to the second boundary line, and after moving each second boundary line outward, because the length of the second boundary line is short, the computer device may extend both ends of each moved second boundary line to each two second boundary lines after moving and intersect each other, so as to obtain an intersected closed region, that is, a second closed region. The area of the second closed region may be smaller than the area of the parking region, but may be larger than the area of the non-parking region. In this embodiment, the area of the first closed region may be greater than the area of the second closed region.

The computer device may calculate coordinates of an intersection point where each two of the second boundary lines after moving and extending intersect, that is, coordinates of an end point of the second closed region, and further determine the second closed region by the coordinates of the end point of the second closed region.

And S370, determining the areas except the second closed area in the first closed area as the remaining areas.

Specifically, the computer device may determine a closed loop area, that is, an area between the boundary line of the first closed area and the boundary line of the second closed area, by the boundary line of the first closed area and the boundary line of the second closed area, and determine the loop area as a remaining area in the parking area.

In the embodiment, the remaining area in the parking area can be determined under the condition that the non-parking area exists in the parking area, and the parking spaces are further arranged in the remaining area in different parking space arrangement modes, so that the parking spaces arranged in the parking area can reach the maximum area utilization rate.

According to the parking space arrangement method, after the first parking spaces are arranged in the parking area, the remaining area in the parking area is determined according to the actual scene where the parking area is located, and the second parking spaces are further arranged in the remaining area through different parking space arrangement modes, so that the overlapping arrangement condition can be avoided, and the maximum area utilization rate of the parking spaces arranged in the parking area can be achieved.

As one embodiment, the step of arranging the second parking space according to the parking space arrangement manner, the parking space information, and the lane width information corresponding to the boundary type of the remaining area in S400 may be implemented by: and if the boundary type is the boundary endpoint of the remaining area, arranging double rows of parking spaces according to the parking space information and the lane width information to obtain a second parking space.

Specifically, if the shape of the remaining area is a right-angled rectangle or an oblique rectangle, the computer device may use the boundary type of the remaining area as a boundary endpoint of the remaining area, use any boundary endpoint of the remaining area as a parking space arrangement reference endpoint, and arrange double-row parking spaces according to the parking space information and the lane width information in a first parking space arrangement manner to obtain a second parking space. If the shape of the remaining area is circular or elliptical, the computer device may use any one point on the boundary line of the remaining area as the boundary end point. The number of second parking spaces may be greater than or equal to 1.

As shown in fig. 11, the step of arranging double rows of parking spaces according to the parking space information and the lane width information to obtain the second parking space may specifically include the following steps:

and S410, determining extreme value end points from all boundary end points of the residual area.

Specifically, in this embodiment, each boundary end point of the remaining region may be represented by two-dimensional coordinates, i.e., (X, Y), where X represents a coordinate value of the boundary end point mapped on the X axis, and Y represents a coordinate value of the boundary end point mapped on the Y axis. The computer device can compare all coordinate values of all boundary end points of the residual area mapped on the X axis to determine a maximum value X _max Or minimum value x _min And maximum value x _max Determining the corresponding boundary end point as a maximum end point or determining the minimum value x _min The corresponding boundary end point is determined as the minimum end point. In addition, the computer device may compare all coordinate values of all boundary end points of the remaining region mapped on the Y-axis to determine the maximum value Y _max Or minimum value y _min And maximum value y _max Determining the corresponding boundary end point as a maximum end point or determining the minimum value y _min The corresponding boundary end point is determined as the minimum end point.

That is, the number of extremum endpoints that can be determined by the present embodiment can be equal to 4, two maximum endpoints and two minimum endpoints.

And S420, sequentially arranging double rows of parking spaces in the remaining area along the first direction from the extreme value end point according to the parking space information and the lane width information to obtain a second parking space.

It can be understood that the computer device may arbitrarily select 1 extremum end point from the 4 extremum end points of the remaining area as a parking space arrangement reference end point, and sequentially arrange double rows of parking spaces in the remaining area along the first direction according to the parking space information and the lane width information from the selected parking space arrangement reference end point to obtain the second parking space. In this embodiment, double rows of parking spaces are sequentially arranged in the remaining area in the first direction, and the number of parking space arrangement results obtained may be equal to 4. It is also understood that the steps in S410 and S420 described above may be understood as a specific process of the first parking space arrangement manner.

Among them, the 4 forms of double-row parking spaces arranged in order in the remaining area in the first direction can be described by the following example. Illustratively, if the extreme end point is selected as a maximum X mapped on the X-axis _max A boundary end point of the corresponding remaining region, and coordinates of the boundary end point are (1, 2), the first direction may be a direction from a larger value of x to a smaller value of x on a line segment where y = 2; if the extreme value end point is selected as the minimum value X mapped on the X axis _min A boundary end point of the corresponding remaining region, and coordinates of the boundary end point are (1, 2), the first direction may be a direction from a smaller value of x to a larger value of x on a line segment where y = 2; if the extreme value end point is selected as the maximum value Y mapped on the Y axis _max A boundary end point of the corresponding remaining region, and coordinates of the boundary end point are (1, 2), the first direction may be a direction from a larger value of y to a smaller value of y on a line segment of x = 1; if the extreme value end point is selected as the minimum value Y mapped on the Y axis _min The corresponding boundary end point of the residual region, and the coordinate of the boundary end point is (1, 2), thenThe first direction may be a direction from a smaller value of y to a larger value of y on a line segment of x = 1.

Illustratively, on the basis of the model of fig. 9, the second parking space is continuously arranged in the remaining area, and fig. 12 is a model diagram showing the result of the arrangement of the parking spaces. Fig. 13 is a schematic diagram illustrating the result of arranging parking spaces in a parking area, where the remaining area in the parking area is a quadrilateral area, and the result is the result of arranging a second parking space in the remaining area by using the first parking space arrangement manner.

According to the method, the second parking spaces can be arranged in the remaining area of the parking area according to the parking space arrangement mode corresponding to the boundary type of the remaining area, so that the method can automatically arrange the parking spaces in the parking area through various combined parking space arrangement modes, and therefore various optional parking space arrangement results are obtained, a user can select a parking space arrangement model of a project requirement according to actual requirements, and the situation that the parking spaces are arranged in the parking area only through one parking space arrangement mode and the parking space arrangement results are relatively single is avoided; meanwhile, the method can obtain various optional parking space arrangement results, and in order to improve the utilization rate of the parking area, a user can select a parking space arrangement model with the maximum utilization rate of the parking area from the various parking space arrangement results.

The parking space arrangement method can arrange the second parking spaces in the residual area of the parking area according to the parking space arrangement mode corresponding to the boundary type of the residual area, so that the method can automatically arrange the parking spaces in the parking area through various combined parking space arrangement modes, thereby obtaining various optional parking space arrangement results, enabling a user to select a parking space arrangement model of a project requirement according to an actual requirement, and avoiding the situation that the parking spaces are arranged in the parking area only through one parking space arrangement mode and the parking space arrangement result is relatively single; meanwhile, the method can obtain various optional parking space arrangement results, and in order to improve the utilization rate of the parking area, a user can select a parking space arrangement model with the maximum utilization rate of the parking area from the various parking space arrangement results.

As an embodiment, the step of arranging the second parking space according to the parking space arrangement manner, the parking space information, and the lane width information corresponding to the boundary type of the remaining area in S400 may be further implemented by: and if the boundary type is the first boundary line of the residual area, arranging double rows of parking spaces according to the parking space information and the lane width information to obtain a second parking space.

It can be understood that, if the shape of the remaining area is a right-angled rectangle or an oblique rectangle, the computer device may use any one of the first boundary lines of the remaining area as a parking space arrangement reference path according to the type of the boundary of the remaining area, and arrange double rows of parking spaces according to the parking space information and the lane width information in a second parking space arrangement manner to obtain a second parking space.

In this embodiment, the first parking space arrangement manner and the second parking space arrangement manner may be different, and the first parking space arrangement manner and the second parking space arrangement manner may be collectively referred to as a non-orthogonal arrangement manner, and the arrangement manner in which the first parking space is arranged may be referred to as an orthogonal arrangement manner. In this embodiment, the step of obtaining the second parking space by arranging the double-row parking spaces according to the parking space information and the lane width information if the boundary type is the first boundary line of the remaining area may be interchanged with the step of obtaining the second parking space by arranging the double-row parking spaces according to the parking space information and the lane width information if the boundary type is the boundary end point of the remaining area.

Wherein, the above-mentioned step of arranging double parking stall according to parking stall information and lane width information, obtaining the second parking stall can include: and taking two adjacent first boundary lines in the residual area as reference layout paths, and sequentially arranging double rows of parking spaces in the residual area along a second direction from the intersection point of the reference layout paths according to the parking space information and the lane width information to obtain a second parking space.

Specifically, two adjacent first boundary lines in the surplus region may be understood as L-shaped boundary lines among the plurality of types of first boundary lines of the surplus region. The second direction may be a vertical direction inward of any one of the L-shaped first boundary lines. Exemplarily, with continuing reference to the parking area in fig. 13, fig. 14 shows an arrangement result of parking areas obtained by arranging parking spaces in a double row in the remaining area in sequence in a second direction from an intersection point of the reference arrangement route according to the parking space information and the lane width information with two first boundary lines adjacent above the remaining area as L-shaped first boundary lines, and taking the L-shaped first boundary lines as the reference arrangement route, the outermost first boundary line in the figure being the parking area first boundary line, and the second direction being a vertical direction inward of the upper right first boundary line in the L-shaped first boundary line above the remaining area in this exemplary case. Meanwhile, the second direction in the example may also be set to a vertical direction inward of the upper left first boundary line in the L-shaped boundary line above the surplus region.

In this embodiment, the double-row parking space can be understood as the adjacent arrangement condition of two single-row parking spaces, that is, there is no lane width information between two rows of parking spaces, but there is lane width information between two double-row parking spaces. One L-shaped first boundary line of the remainder area may correspond to the second parking space arrangement manner, that is, double-row parking spaces are arranged along two first boundary lines of the L-shaped first boundary lines, respectively, and thus, double-row parking spaces are arranged with two adjacent first boundary lines of the remainder area as reference arrangement paths, and the number of parking space arrangement results obtained may be equal to the number of L-shaped first boundary lines of the plurality of types of first boundary lines of the remainder area multiplied by 2.

Further, if the parking area includes a non-parking area, after all the steps, the parking space arrangement method further includes: and deleting the second parking space in the second closed area.

It is understood that when a non-parking area exists in the parking area, that is, after the second parking space is arranged, there may be a case where the second parking space overlaps with the non-parking area, and therefore, after the second parking space is arranged, the computer device may delete the second parking space in the second closed area. If the partial area of the second parking space intersects with the boundary of the second closed area, the second parking spaces intersecting with the boundary of the second closed area can be deleted at the same time.

According to the parking space arrangement method and the parking space arrangement system, under the condition that the parking areas include the non-parking areas, the parking space arrangement result can be obtained, the obtained parking space arrangement result is more accurate, and the usability of the parking space arrangement method is improved.

The parking space arrangement method can arrange the second parking spaces in the residual area of the parking area according to the parking space arrangement mode corresponding to the boundary type of the residual area, so that the method can automatically arrange the parking spaces in the parking area through various combined parking space arrangement modes, thereby obtaining various optional parking space arrangement results, enabling a user to select a parking space arrangement model of a project requirement according to an actual requirement, and avoiding the situation that the parking spaces are arranged in the parking area only through one parking space arrangement mode and the parking space arrangement result is relatively single; meanwhile, the method can obtain various optional parking space arrangement results, and in order to improve the utilization rate of the parking area, a user can select a parking space arrangement model with the maximum utilization rate of the parking area from various parking space arrangement results.

In order to facilitate understanding of those skilled in the art, the parking space arrangement method provided in the present application is described by taking an execution subject as a computer device as an example, and specifically, the method includes:

(1) And drawing a parking area according to the received parking space arrangement instruction based on a parking space parameter setting interface, wherein the parking space arrangement instruction carries parking space information and lane width information.

(2) And respectively retracting two ends of each first boundary line of the parking area by a preset distance to obtain an arrangement path corresponding to each first boundary line of the parking area.

(3) And arranging single-row parking spaces along the inner sides of the arrangement paths from the end points of the arrangement paths according to the parking space width and the parking space length to obtain first parking spaces, wherein the parking space information comprises the parking space width and the parking space length.

(4) Determining an overlapping area between an entrance and an exit of the parking garage and a parking area according to the boundary information of the entrance and the exit of the parking garage; the parking space information further includes boundary information of an entrance and an exit of the parking garage.

(5) And deleting the first parking space in the overlapping area.

(6) And summing the parking space length and the lane width information of the first parking space to obtain a first distance.

(7) And moving the first boundary lines inwards by a first distance along the vertical direction of the first boundary lines to obtain a first closed area consisting of the moved first boundary lines as a residual area.

(8) And if the parking area comprises a non-parking area, arranging a third parking space outwards along a second boundary line of the non-parking area according to the parking space information.

(9) And summing the parking space length and the lane width information of the first parking space to obtain a first distance.

(10) And moving the first boundary lines inwards by a first distance along the vertical direction of the first boundary lines to obtain a first closed area formed by the moved first boundary lines.

(11) And summing the parking space length and the lane width information of the third parking space to obtain a second distance.

(12) And moving the second boundary lines outwards by a second distance along the vertical direction of the second boundary lines, and extending the moved second boundary lines until the second boundary lines intersect to obtain a second closed area.

(13) And determining the area except the second closed area in the first closed area as the residual area.

(14) And if the boundary type is the boundary end point of the residual region, determining an extreme value end point from all the boundary end points of the residual region.

(15) And sequentially arranging double rows of parking spaces in the remaining area along the first direction from the extreme value end point according to the parking space information and the lane width information to obtain a second parking space.

(16) And if the boundary type is the first boundary line of the residual area, taking two adjacent first boundary lines in the residual area as reference layout paths, and sequentially arranging double rows of parking spaces in the residual area from the intersection point of the reference layout paths along the second direction according to the parking space information and the lane width information to obtain a second parking space.

(17) And deleting the second parking space in the second closed area.

For the implementation processes of (1) to (17), reference may be specifically made to the description of the above embodiments, and the implementation principles and technical effects thereof are similar and will not be described herein again.

It should be understood that, although the various steps in the flowcharts of fig. 2, 5-7, and 10-11 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2, 5-7, and 10-11 may include multiple steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performing the steps or stages is not necessarily sequential, but may be alternated or alternated with other steps or at least some of the other steps.

In one embodiment, as shown in fig. 15, there is provided a parking space arrangement apparatus 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:

the parking area drawing module 11 is configured to obtain a parking space arrangement instruction, and draw a parking area according to the parking space arrangement instruction, where the parking space arrangement instruction carries parking space information and lane width information;

a first parking space arrangement module 12 configured to inwardly arrange a first parking space along a boundary line of a parking area according to parking space information;

a remaining area determining module 13, configured to determine a remaining area in the parking area according to the first parking space and the lane width information;

and a second parking space arrangement module 14, configured to arrange a second parking space according to the parking space arrangement manner, the parking space information, and the lane width information corresponding to the boundary type of the remaining area.

The parking space arrangement device provided by this embodiment can execute the above method embodiments, and the implementation principle and technical effect thereof are similar, and are not described herein again.

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

the arrangement path acquisition unit is used for respectively retracting two ends of each first boundary line of the parking area by a preset distance to acquire an arrangement path corresponding to each first boundary line of the parking area;

and the first parking space arrangement unit is used for arranging single-row parking spaces along the inner sides of the arrangement paths from the end points of the arrangement paths according to the width and the length of the parking spaces to obtain the first parking spaces.

In one embodiment, the parking space information further includes boundary information of an entrance and an exit of the parking garage, and the parking space arrangement apparatus further includes: an overlap area determination module and a parking space deletion module, wherein:

the overlapping area determining module is used for determining the overlapping area between the entrance and the exit of the parking garage and the parking area according to the boundary information of the entrance and the exit of the parking garage;

and the parking space deleting module is used for deleting the first parking space in the overlapping area.

In one embodiment, the remaining area determining module 13 includes: a summing unit and a boundary line moving unit, wherein:

the summing unit is used for summing the parking space length and the lane width information of the first parking space to obtain a first distance;

and a boundary line moving unit for moving each first boundary line inwards by a first distance along the vertical direction of each first boundary line to obtain a first closed area formed by each moved first boundary line as a residual area.

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:

and the third parking space arrangement module is used for outwards arranging a third parking space along a second boundary line of the non-parking area according to the parking space information.

The parking space arrangement apparatus provided by this embodiment may implement the above method embodiments, and the implementation principle and technical effect are similar, which are not described herein again.

In one embodiment, the remaining area determining module 13 includes: a remaining region determining unit, wherein:

a remaining area determination unit for determining a remaining area in the parking area based on the first parking space, the third parking space, and the lane width information.

In one embodiment, the remaining region determining unit includes: a first summing subunit, a first boundary line moving subunit, a second summing subunit, a second boundary line moving subunit, and a remaining area determining subunit, wherein:

the first summing subunit is used for summing the parking space length and the lane width information of the first parking space to obtain a first distance;

the first boundary line moving subunit is used for moving each first boundary line inwards by a first distance along the vertical direction of each first boundary line to obtain a first closed area formed by each moved first boundary line;

the second summation subunit is used for summing the parking space length and the lane width information of the third parking space to obtain a second distance;

the second boundary line moving subunit is used for moving each second boundary line outwards by a second distance along the vertical direction of each second boundary line and extending each moved second boundary line to intersect to obtain a second closed area;

and the residual region determining subunit is used for determining the regions except the second closed region in the first closed region as residual regions.

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

the second parking space arrangement unit is used for arranging double rows of parking spaces according to the parking space information and the lane width information to obtain a second parking space when the boundary type is the boundary endpoint of the residual area;

the second parking space arrangement unit includes: an extreme point determining subunit and a first parking space arrangement subunit, wherein:

the extreme point determining subunit is used for determining extreme end points from all boundary end points of the residual region;

and the first parking space arrangement subunit is used for sequentially arranging double rows of parking spaces in the remaining area from the extreme value end point along the first direction according to the parking space information and the lane width information to obtain a second parking space.

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

the third parking space arrangement unit is used for arranging double rows of parking spaces according to the parking space information and the lane width information to obtain a second parking space when the boundary type is the first boundary line of the residual area;

the third parking space arrangement unit is specifically configured to take two adjacent boundary lines in the remaining area as reference arrangement paths, and sequentially arrange double rows of parking spaces in the remaining area along the second direction from an intersection point of the reference arrangement paths according to the parking space information and the lane width information to obtain a second parking space.

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:

and the parking space deleting unit is used for deleting the second parking space in the second closed area.

For specific definition of the parking space arrangement device, reference may be made to the above definition of the parking space arrangement method, which is not described herein again. The respective modules in the parking space arrangement apparatus described above may be implemented in whole or in part by software, hardware, and a combination thereof. The modules can be embedded in a hardware form or independent of a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having a computer program stored therein, the processor implementing the following steps when executing the computer program:

arranging a first parking space inward along a boundary line of a parking area according to parking space information;

and arranging a second parking space according to the parking space arrangement mode, the parking space information and the lane width information corresponding to the boundary type of the remaining area.

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

determining a remaining area in the parking area according to the first parking space and the lane width information;

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.

The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A parking space arrangement method, characterized in that the method comprises:

2. The method of claim 1, wherein the parking space information includes a parking space width and a parking space length; the arranging of the first parking space inward along the boundary line of the parking area according to the parking space information includes:

respectively retracting two ends of each first boundary line of the parking area by preset distances, and acquiring an arrangement path corresponding to each first boundary line of the parking area, wherein the boundary line of the parking area comprises each first boundary line of the parking area;

3. The method according to claim 2, wherein the parking space information further includes boundary information of an entrance and exit of a parking garage; the method further comprises the following steps:

deleting the first parking space in the overlapping region.

4. The method according to any one of claims 1-3, wherein said determining a remaining area in the parking area from the first parking space, the lane width information, comprises:

5. The method according to any one of claims 1-3, wherein if a no-parking area is included in the parking area, the method further comprises:

6. The method of claim 5, wherein said determining a remaining area in the parking area from the first parking space, the third parking space, and the lane width information comprises:

7. The method according to claim 1, wherein the arranging a second parking space according to the parking space arrangement manner, the parking space information, and the lane width information corresponding to the boundary type of the remaining area includes:

if the boundary type is the boundary endpoint of the remaining area, arranging double rows of parking spaces according to the parking space information and the lane width information to obtain a second parking space;

wherein, according to the parking stall information with the lane width information arrange double parking stall, obtain the second parking stall includes:

8. The method according to claim 7, wherein the arranging a second parking space according to the parking space arrangement manner, the parking space information, and the lane width information corresponding to the boundary type of the remaining area further comprises:

taking two adjacent first boundary lines in the remaining area as reference arrangement paths, and sequentially arranging double rows of parking spaces in the remaining area along a second direction from an intersection point of the reference arrangement paths according to the parking space information and the lane width information to obtain a second parking space;

if the parking area comprises a non-parking area, the method further comprises the following steps:

deleting the second parking space in the second closed area.

9. A parking space arrangement apparatus, characterized in that the apparatus comprises:

10. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor when executing the computer program performs the steps of the method according to any of claims 1 to 8.