Parking space arrangement method, device, equipment and storage medium

Abstract

The present application discloses a parking space arrangement method, device, equipment and storage medium. The present application obtains lane flow lines within a target site area to be arranged with parking spaces, and the lane flow lines are used to indicate the center line of the lane. The target site area can be segmented based on the lane flow lines to obtain segmented parking space arrangement areas for arranging parking spaces. Parking space arrangement is performed on each parking space arrangement area according to a set arrangement rule, thereby realizing automatic arrangement of parking spaces in the target site area. Compared with relying on designers to manually arrange parking spaces one by one, the present application scheme has a higher degree of automation, faster parking space arrangement efficiency and less time consumption.

Description

Technical Field

[0001] The present application relates to the technical field of computer graphics, and more specifically, to a parking space arrangement method, device, equipment and storage medium. Background Art

[0002] With the continuous development of computer technology, the use of various auxiliary design software has become an essential skill for practitioners. Further improving design efficiency based on computer-aided design software has always been the pursuit of practitioners. Parking space layout is one of the most important links in the design stage, and improving its efficiency has always been a hot topic for researchers in related fields.

[0003] In the existing parking space arrangement methods, most of them still remain in the stage where designers arrange parking spaces one by one based on lanes, and finally perform operations such as offset and rotation on the arranged parking spaces to obtain the parking space arrangement result of the entire site. This processing method has a low degree of automation and requires designers to arrange parking spaces one by one, and the overall arrangement process takes a long time. Summary of the invention

[0004] In view of the above problems, this application is proposed to provide a parking space arrangement method, device, equipment and storage medium to solve the problem that the existing manual parking space arrangement method is inefficient and time-consuming. The specific solution is as follows:

[0005] A parking space arrangement method, comprising:

[0006] Acquire a target site area where parking spaces are to be arranged, and lane flow lines within the target site area, wherein the lane flow lines are used to indicate the center line of the lane;

[0007] Based on the lane flow lines in the target site area, the target site area is segmented to obtain a parking space arrangement area;

[0008] According to the set arrangement rules, parking spaces are arranged in the parking space arrangement area obtained by segmentation.

[0009] Preferably, the step of obtaining a target site area where parking spaces are to be arranged includes:

[0010] The contour line of the target site area and the contour line of the non-arrangeable area contained in the target site area are obtained.

[0011] Preferably, the target site area is segmented based on the lane streamlines in the target site area to obtain parking space arrangement areas, including:

[0012] storing the contour lines of the target site area into a line set in a first clockwise order, and storing the contour lines of the non-arrangeable area into a line set in a second clockwise order, wherein the first clockwise order is opposite to the second clockwise order;

[0013] Copying each of the lane flow lines and storing them in the line set as two lines with unchanged positions and opposite directions;

[0014] Based on the stored line set, searching for a minimum ring composed of lines according to the first clockwise order to obtain several minimum rings;

[0015] Based on each of the minimum rings, a corresponding parking space arrangement area is determined.

[0016] Preferably, the step of searching for a minimum ring composed of lines in the first clockwise order based on the stored line set to obtain several minimum rings includes:

[0017] A line is selected from the stored line set, the selected line is used as the starting line, and the lines connected from the beginning to the end are searched in turn in the first clockwise order among the stored lines until the found lines and the starting line form a minimum loop; wherein each time the next line connected to the current line is searched, the line connected to the end point of the current line and having the largest vector angle with the current line is selected as the next line found;

[0018] Each line included in the found minimum ring is removed from the stored line set, and the step of selecting a line from the line set is returned to be executed until no minimum ring is found, thereby obtaining each found minimum ring.

[0019] Preferably, determining the corresponding parking space arrangement area based on each of the minimum rings includes:

[0020] For each of the lane flow lines in the minimum ring, offset the line by half the lane width into the minimum ring to obtain a processed ring;

[0021] Based on the line set corresponding to the processed ring, a minimum ring composed of lines is searched in the first clockwise order, and the obtained minimum rings are used as parking space arrangement areas.

[0022] Preferably, before searching for a minimum ring composed of lines in the first clockwise order based on the line set corresponding to the processed ring, the method further comprises:

[0023] If it is determined that one end of the line segment after the lane streamline is offset by half the lane width is inside the minimum ring, it is extended to the boundary of the minimum ring to obtain the processed ring.

[0024] Preferably, before segmenting the target site area based on the lane streamlines in the target site area, the method further comprises:

[0025] A rationality check is performed on each lane flow line. If it is determined that any end point of a target lane flow line is not connected to the contour line of the target site area, the contour line of the non-arrangeable area, or other lane flow lines, the target lane flow line is removed.

[0026] Preferably, the step of arranging parking spaces in the parking space arrangement area obtained by segmentation according to a set arrangement rule includes:

[0027] Determine the edge line of the parking space layout area that is adjacent to the lane;

[0028] For each of the sidelines, parking spaces are arranged successively from one end of the sideline to the other end.

[0029] Preferably, before arranging parking spaces one by one from one end to the other end of each edge line, the method further comprises:

[0030] Arrange the edges in order from longest to shortest;

[0031] Then, for each of the sidelines, arranging parking spaces one by one from one end of the sideline to the other end includes:

[0032] According to the sorting order of the sidelines, parking spaces are arranged one by one for each sideline from one end to the other.

[0033] Preferably, the method further comprises:

[0034] After the parking spaces are arranged for each of the sidelines, the parking spaces that are arranged beyond the parking space arrangement area are removed.

[0035] Preferably, it also includes:

[0036] After arranging the parking spaces for each of the sidelines, checking whether there is overlap between the parking spaces arranged for any two sidelines;

[0037] If so, the target parking space on the shorter sideline of the two sidelines with overlapping parking spaces is removed, because the target parking space overlaps with the parking space on the longer sideline.

[0038] A parking space arrangement device, comprising:

[0039] A data acquisition unit, used to acquire a target site area where parking spaces are to be arranged, and lane flow lines within the target site area, wherein the lane flow lines are used to indicate the center line of the lane;

[0040] A parking space arrangement area segmentation unit, configured to segment the target site area based on lane flow lines within the target site area to obtain parking space arrangement areas;

[0041] The parking space arrangement unit is used to arrange parking spaces for the parking space arrangement area obtained by segmentation according to a set arrangement rule.

[0042] A parking space arrangement device, comprising: a memory and a processor;

[0043] The memory is used to store programs;

[0044] The processor is used to execute the program to implement the various steps of the parking space arrangement method as described above.

[0045] A storage medium stores a computer program, which, when executed by a processor, implements the various steps of the parking space arrangement method described above.

[0046] By means of the above technical scheme, the present application obtains the lane flow lines within the target site area where parking spaces are to be arranged, and the lane flow lines are used to indicate the center line of the lane. The target site area can then be segmented based on the lane flow lines to obtain the segmented parking space arrangement areas for arranging parking spaces, and parking spaces are arranged in each parking space arrangement area according to the set arrangement rules, thereby realizing the automatic arrangement of parking spaces in the target site area. Compared with relying on designers to manually arrange parking spaces one by one, the present application scheme has a higher degree of automation, faster parking space arrangement efficiency, and less time consumption. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Various other advantages and benefits will become apparent to those of ordinary skill in the art by reading the detailed description of the preferred embodiments below. The accompanying drawings are only for the purpose of illustrating the preferred embodiments and are not to be considered as limiting the present application. Also, the same reference symbols are used throughout the accompanying drawings to represent the same components. In the accompanying drawings:

[0048] Figure 1 A schematic diagram of a process of a parking space arrangement method provided in an embodiment of the present application;

[0049] Figure 2 An example of a target site area contour line and lane flow line schematic diagram is provided;

[0050] Figure 3 An example of a schematic diagram of the minimum ring search process is shown;

[0051] Figure 4 An example of a lane streamline translation process schematic diagram is shown;

[0052] Figure 5 Another schematic diagram of lane streamline translation process is illustrated;

[0053] Figure 6 An example of a minimum ring search process to select the next line of the current line;

[0054] Figure 7 A schematic diagram of a method for handling overlapping parking spaces arranged on two side lines is shown as an example;

[0055] Figure 8 An example of a partial parking space layout effect diagram of an underground parking lot according to the parking space layout solution of the present application is provided;

[0056] Fig. 9 A schematic diagram of the structure of a parking space arrangement device provided in an embodiment of the present application;

[0057] Fig.10 A schematic diagram of the structure of the parking space arrangement device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0059] The present application provides a parking space arrangement solution, which can realize automatic parking space arrangement and greatly save the time of designers. The solution of the present application can be implemented based on a terminal with data processing capability, which can be a mobile phone, computer, server, cloud, etc.

[0060] Next, combine Figure 1 The parking space arrangement method of the present application may include the following steps:

[0061] Step S100: Acquire a target site area where parking spaces are to be arranged and lane streamlines within the target site area.

[0062] The lane streamline is used to indicate the center line of the lane.

[0063] It should be noted that a basic principle of parking space arrangement is that parking spaces need to be set up next to lanes so that vehicles can drive into the parking spaces from the lanes. In design software, lanes are generally expressed by lane streamlines. The target site area where parking spaces are to be arranged can be a square, the ground in a residential area, a basement parking lot, and other areas. In order to arrange parking spaces in the target site area, it is necessary to first design lane streamlines in the target site area.

[0064] In this step, the target site area with designed lane streamlines can be directly obtained. On this basis, the subsequent parking space arrangement can be directly based on the lane streamlines. Of course, the existing lane streamlines can also be adjusted, and then the subsequent parking space arrangement can be based on the adjusted lane streamlines.

[0065] In addition, the target site area obtained in this step may also be an area where no lane streamlines are designed. On this basis, in this step, lane streamlines may be firstly arranged for the target site area.

[0066] Step S110: based on the lane streamlines in the target site area, the target site area is segmented to obtain parking space arrangement areas.

[0067] Specifically, since the layout of parking spaces needs to be based on lane streamlines, the target site area can be segmented using lane streamlines in this step. Based on the fact that each segmented area is adjacent to the lane, each segmented area can be used as a parking space layout area.

[0068] Step S120: Arrange parking spaces for the divided parking space arrangement area according to a set arrangement rule.

[0069] Specifically, the present application may pre-set parking space arrangement rules, which may specify the size of parking spaces, the direction of parking space arrangement, etc. Based on the arrangement rules, parking space arrangement may be performed on the distribution of each parking space arrangement area after segmentation, thereby completing the overall parking space arrangement process for the target site area.

[0070] The parking space arrangement method provided in the embodiment of the present application obtains the lane streamlines within the target site area where the parking spaces are to be arranged, and the lane streamlines are used to indicate the center line of the lane. The target site area can be divided based on the lane streamlines to obtain the divided parking space arrangement areas for arranging the parking spaces. The parking spaces are arranged in each parking space arrangement area according to the set arrangement rules, thereby realizing the automatic arrangement of the parking spaces in the target site area. Compared with relying on designers to manually arrange the parking spaces one by one, the present application scheme has a higher degree of automation, faster parking space arrangement efficiency, and less time consumption.

[0071] In some embodiments of the present application, the target site area to be arranged with parking spaces obtained in step S100 may be a contour line expressing the target site area. On this basis, if there are areas such as buildings that cannot be arranged in the target site area, the contour line of the non-arrangeable area is further obtained.

[0072] On this basis, the process of step S110, dividing the target site area based on the lane streamlines in the target site area to obtain parking space arrangement areas, is introduced.

[0073] This embodiment introduces a parking space layout area segmentation method based on a minimum ring.

[0074] S1. Store the contour lines of the target site area into a line set according to a first clockwise order, and store the contour lines of the non-arrangeable area into a line set according to a second clockwise order.

[0075] The first clockwise order is opposite to the second clockwise order. For example, the first clockwise order is clockwise and the second clockwise order is counterclockwise. Of course, the first clockwise order can also be counterclockwise, and the corresponding second clockwise order is clockwise.

[0076] S2. Duplicate each lane streamline and store them in the line set as two lines with unchanged positions and opposite directions.

[0077] Specifically, since parking spaces can be arranged on both sides of the lane, in order to divide the parking space arrangement area as much as possible, each lane streamline can be copied in this step, that is, one lane streamline becomes two lane streamlines after copying. The positions of the two copied lane streamlines remain unchanged and their directions are opposite, and they are stored in the line set.

[0078] like Figure 2 As shown:

[0079] The outer contour of the target site area is stored as a clockwise line set. The outer contour of the non-arrangeable area within the target site area is stored as a counterclockwise line set. Figure 2 The lines connecting the outer contour of the target site area and the outer contour of the non-arrangeable area in the line set are copied and stored in the line set as two lines with unchanged positions and opposite directions ( Figure 2 The positions of the two lane streamlines after copying do not overlap. This is just to illustrate the effect of lane streamline copying. The actual position data stored in the line set is the same).

[0080] S3. Based on the stored line set, search for a minimum ring composed of lines in the first clockwise order to obtain several minimum rings.

[0081] Specifically, the smallest ring formed by the outer contour line of the target site area, the outer contour line of the non-arrangeable area and the lane streamline can be used as the parking space arrangement area. To this end, in this step, the smallest ring formed by the lines in the line set can be found according to the storage order of the outer contour line of the target site area in the line set, that is, the first clockwise order, and several smallest rings can be found.

[0082] An optional implementation of finding the smallest ring is as follows:

[0083] S31. Select a line from the stored line set, take the selected line as the starting line, and search for the end-to-end connected lines in the stored lines in the first clockwise order until the found lines and the starting line form a minimum loop.

[0084] Each time when searching for the next line connected to the current line, a line connected to the end point of the current line and having the largest vector angle with the current line is selected as the next line found.

[0085] The vector angle can range from [0, 180°] to [0, -180°].

[0086] See also Figure 6 , Figure 6 The target site area of ​​the example is a rectangular area, and there is no unarrangeable area inside. The lane flow line is Figure 6 In the process of finding the minimum loop, assume that the current line is L1. To simplify understanding, Figure 6 In the result of copying the streamlines of each lane, only the lines starting from the end point of L1, namely L2, L3, and L4, are shown. When selecting the next line, the vector angles between L2, L3, and L4 and L1 are determined respectively. The angle between L1 and L2 is 90°, the angle between L1 and L3 is 0°, and the angle between L1 and L4 is -90°. The line with the largest vector angle, namely L2, is selected as the next line of the current line L1.

[0087] It can be understood that, by searching for the lines connecting the head and the tail in sequence according to the selection method of this step, the ring finally found is the minimum ring.

[0088] S32, removing each line included in the found minimum ring from the stored line set, and returning to execute the step of selecting a line from the line set in S31, until no minimum ring is found, thereby obtaining each found minimum ring.

[0089] Reference Figure 3 As shown, according to the minimum ring search method in the above steps, you can find Figure 3 The two minimal rings of the example on the right.

[0090] S4. Based on each of the minimum rings, determine a corresponding parking space arrangement area.

[0091] It can be understood that each of the minimum rings found above is within the contour of the target site area and does not include an unarrangeable area. Therefore, the corresponding parking space arrangement area can be determined based on each minimum ring.

[0092] For each minimum ring, the process of determining the corresponding parking space layout area can be implemented by referring to the following steps:

[0093] S41. For each minimum ring, the line belonging to the lane streamline is offset into the minimum ring by half the lane width to obtain a processed ring.

[0094] Specifically, the minimum ring may contain lane streamlines, and the lane streamlines are the center lines of the lanes. For this purpose, the lane streamlines can be offset. Specifically, the lane streamlines can be offset into the minimum ring by half the lane width. The offset line is the lane edge line. After the lane streamlines are offset, the processed ring is obtained.

[0095] It should be noted that after the offset processing, one end of the offset line segment of some lane streamlines may be inside the minimum ring. In this case, one end of the offset line segment can be extended to the boundary of the minimum ring to obtain the processed ring.

[0096] See also Figure 4 , Figure 5 , which respectively exemplify Figure 3 The process of performing lane streamline offset based on the two minimum rings found in .

[0097] Figure 4 and Figure 5 In , the lane streamlines before the shift are represented by dotted lines. After the lane streamlines are shifted, if it is determined that one end of the shifted line segment is inside the minimum ring, it can be extended to the boundary of the minimum ring to obtain the processed ring.

[0098] S42: based on the line set corresponding to the processed ring, searching for a minimum ring composed of lines in the first clockwise order, and obtaining several minimum rings as parking space arrangement areas.

[0099] It should be noted that due to the complexity of the shape of the outer contour of the non-arrangeable area in the target site area, the processed ring obtained after the lane streamline offset processing may not be a standard minimum ring, and it may contain multiple minimum rings and some redundant line segments. Therefore, based on the line set corresponding to the processed ring, the above S3 can be repeated to search for the minimum ring composed of lines in the first clockwise order to obtain several minimum rings. The final several minimum rings are used as the final parking space arrangement area.

[0100] In some embodiments of the present application, in the aforementioned step S110, based on the lane streamlines in the target site area, the target site area is segmented to obtain the parking space layout area, and a process of checking the rationality of the lane streamlines may be further added.

[0101] Specifically, the process of performing a rationality check on each lane flow line may include: if it is determined that any endpoint of a target lane flow line is not connected to the contour line of the target site area, the contour line of the non-arrangeable area or other lane flow lines, then removing the target lane flow line.

[0102] That is, the endpoints of the lane streamline need to be connected to the contour line of the target site area, the contour line of the non-arrangeable area, or other lane streamlines, otherwise it means that the lane streamline is unreasonable and needs to be removed.

[0103] In some embodiments of the present application, the process of arranging parking spaces in the divided parking space arrangement area according to the set arrangement rule in the above step S120 is introduced.

[0104] S1. Determine a sideline of the outline of the parking space arrangement area that is adjacent to a lane.

[0105] Specifically, according to the description of the parking space layout area determination process in the above embodiment, the contour lines of each determined parking space layout area include the edge lines adjacent to the lane. For example, the edge lines obtained after the lane streamline is offset are the edge lines adjacent to the lane.

[0106] Since the principle of parking space arrangement requires being adjacent to the lane, for each parking space arrangement area, it is necessary to select the edge line adjacent to the lane from its contour line so as to arrange the parking space based on the edge line.

[0107] S2. For each of the sidelines, arrange parking spaces one by one from one end of the sideline to the other end.

[0108] Specifically, the parking spaces may be arranged sequentially from the starting point of the sideline toward the end point, and after the parking spaces are arranged along each sideline, the parking spaces that are arranged beyond the parking space arrangement area may be removed.

[0109] Further optionally, in order to improve the coverage of parking space arrangement, the following step S3 may be added before the above step S2:

[0110] The edge lines are sorted in order from longest to shortest.

[0111] That is, for the contour lines of a parking space arrangement area determined in S1, the side lines adjacent to the lanes may be sorted in order from long to short.

[0112] On this basis, the process of arranging parking spaces in S2 is to arrange parking spaces for each sideline from one end to the other end in sequence according to the sorting order of the sidelines.

[0113] Furthermore, after arranging the parking spaces along each sideline, the embodiment of the present application can check whether there is overlap between the parking spaces arranged along any two sidelines.

[0114] If so, the target parking space on the shorter sideline of the two sidelines with overlapping parking spaces is removed, because the target parking space overlaps with the parking space on the longer sideline.

[0115] For details, see Figure 7 As shown:

[0116] For the edge lines L5 and L6, the directions from their starting point to their end point are as follows: Figure 7 Indicated by the direction of the arrow.

[0117] When arranging parking spaces, arrange parking spaces for L5 and L6 respectively from the starting point to the end point of the sideline, and finally arrange the following on L5: Figure 7 The 4 parking spaces shown are arranged on L6 as follows Figure 7 The two parking spaces shown. After inspection, it is found that there is an overlap between the last parking space on L5 and the first parking space on L6. Therefore, the first parking space on L6 with a shorter length can be removed to avoid overlapping with the last parking space on L5, thereby ensuring the rationality of the parking space layout. In addition, since the target parking space on the shorter sideline is removed in the embodiment of the present application, the completeness of the parking space layout on the longer sideline is ensured, making the overall parking space layout more regular and reasonable.

[0118] See also Figure 8 , Figure 8 An example of the effect of partial parking space arrangement of an underground parking lot according to the parking space arrangement solution of the present application is shown.

[0119] Depend on Figure 8 It can be seen that the parking space arrangement scheme of the present application can not only realize the automatic arrangement of parking spaces, but also the overall arrangement of the arranged parking spaces is regular and reasonable, which can be directly put into practical application, or the designer can make local fine-tuning, which greatly saves the designer's operation time.

[0120] The parking space arrangement device provided in an embodiment of the present application is described below. The parking space arrangement device described below and the parking space arrangement method described above can refer to each other.

[0121] See also Fig. 9 , Fig. 9 This is a schematic diagram of the structure of a parking space arrangement device disclosed in an embodiment of the present application.

[0122] like Fig. 9 As shown, the device may include:

[0123] A data acquisition unit 11 is used to acquire a target site area where parking spaces are to be arranged, and lane streamlines within the target site area, wherein the lane streamlines are used to indicate a center line of a lane;

[0124] A parking space arrangement area segmentation unit 12 is used to segment the target site area based on lane flow lines in the target site area to obtain parking space arrangement areas;

[0125] The parking space arrangement unit 13 is used to arrange parking spaces for the parking space arrangement area obtained by segmentation according to a set arrangement rule.

[0126] Optionally, the process of the data acquisition unit acquiring the target site area to be arranged with parking spaces may include:

[0127] The contour line of the target site area and the contour line of the non-arrangeable area contained in the target site area are obtained.

[0128] Optionally, the parking space arrangement area segmentation unit segments the target site area based on lane flow lines in the target site area to obtain the parking space arrangement area, which may include:

[0129] storing the contour lines of the target site area into a line set in a first clockwise order, and storing the contour lines of the non-arrangeable area into a line set in a second clockwise order, wherein the first clockwise order is opposite to the second clockwise order;

[0130] Copying each of the lane flow lines and storing them in the line set as two lines with unchanged positions and opposite directions;

[0131] Based on the stored line set, searching for a minimum ring composed of lines according to the first clockwise order to obtain several minimum rings;

[0132] Based on each of the minimum rings, a corresponding parking space arrangement area is determined.

[0133] Optionally, the process of the parking space arrangement area segmentation unit searching for a minimum ring composed of lines in the first clockwise order based on the stored line set to obtain a plurality of minimum rings may include:

[0134] A line is selected from the stored line set, the selected line is used as the starting line, and the lines connected from the beginning to the end are searched in turn in the first clockwise order among the stored lines until the found lines and the starting line form a minimum loop; wherein each time the next line connected to the current line is searched, the line connected to the end point of the current line and having the largest vector angle with the current line is selected as the next line found;

[0135] Each line included in the found minimum ring is removed from the stored line set, and the step of selecting a line from the line set is returned to be executed until no minimum ring is found, thereby obtaining each found minimum ring.

[0136] Optionally, the process of determining the corresponding parking space arrangement area by the parking space arrangement area segmentation unit based on each of the minimum rings may include:

[0137] For each of the lane flow lines in the minimum ring, offset the line by half the lane width into the minimum ring to obtain a processed ring;

[0138] Based on the line set corresponding to the processed ring, a minimum ring composed of lines is searched in the first clockwise order, and the obtained minimum rings are used as parking space arrangement areas.

[0139] Optionally, the parking space arrangement area segmentation unit may further perform the following operations before searching for a minimum ring composed of lines in the first clockwise order based on the line set corresponding to the processed ring:

[0140] If it is determined that one end of the line segment after the lane streamline is offset by half the lane width is inside the minimum ring, it is extended to the boundary of the minimum ring to obtain the processed ring.

[0141] Optionally, the device of the present application may further include:

[0142] A lane streamline verification unit is used to perform a rationality check on each lane streamline before dividing the target site area based on the lane streamlines in the target site area. If it is determined that any end point of a target lane streamline is not connected to the contour line of the target site area, the contour line of the non-arrangeable area or other lane streamlines, the target lane streamline is removed.

[0143] Optionally, the process of the parking space arrangement unit arranging parking spaces for the parking space arrangement area obtained by segmentation according to a set arrangement rule may include:

[0144] Determine the edge line of the parking space layout area that is adjacent to the lane;

[0145] For each of the sidelines, parking spaces are arranged successively from one end of the sideline to the other end.

[0146] Optionally, before the parking space arrangement unit arranges parking spaces one by one from one end to the other end of each edge line, the parking space arrangement unit may further include:

[0147] Arrange the edges in order from longest to shortest;

[0148] Then, for each of the sidelines, arranging parking spaces one by one from one end of the sideline to the other end includes:

[0149] According to the sorting order of the sidelines, parking spaces are arranged one by one for each sideline from one end to the other.

[0150] Optionally, the process of the parking space arrangement unit arranging parking spaces for the parking space arrangement area obtained by segmentation according to a set arrangement rule may further include:

[0151] After the parking spaces are arranged for each of the sidelines, the parking spaces that are arranged beyond the parking space arrangement area are removed.

[0152] Optionally, the process of the parking space arrangement unit arranging parking spaces for the parking space arrangement area obtained by segmentation according to a set arrangement rule may further include:

[0153] After arranging the parking spaces for each of the sidelines, checking whether there is overlap between the parking spaces arranged for any two sidelines;

[0154] If so, the target parking space on the shorter sideline of the two sidelines with overlapping parking spaces is removed, because the target parking space overlaps with the parking space on the longer sideline.

[0155] The parking space arrangement device provided in the embodiment of the present application can be applied to parking space arrangement equipment, such as terminals: mobile phones, computers, etc. Optionally, Fig.10 The hardware structure diagram of the parking space arrangement device is shown. Fig.10 , the hardware structure of the parking space arrangement device may include: at least one processor 1, at least one communication interface 2, at least one memory 3 and at least one communication bus 4;

[0156] In the embodiment of the present application, the number of the processor 1, the communication interface 2, the memory 3, and the communication bus 4 is at least one, and the processor 1, the communication interface 2, and the memory 3 communicate with each other through the communication bus 4;

[0157] The processor 1 may be a central processing unit CPU, or an application-specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement the embodiments of the present invention, etc.;

[0158] The memory 3 may include a high-speed RAM memory, and may also include a non-volatile memory, such as at least one disk memory;

[0159] The memory stores a program, and the processor can call the program stored in the memory, wherein the program is used to:

[0160] Acquire a target site area where parking spaces are to be arranged, and lane flow lines within the target site area, wherein the lane flow lines are used to indicate the center line of the lane;

[0161] Based on the lane flow lines in the target site area, the target site area is segmented to obtain a parking space arrangement area;

[0162] According to the set arrangement rules, parking spaces are arranged in the parking space arrangement area obtained by segmentation.

[0163] Optionally, the detailed functions and extended functions of the program may refer to the above description.

[0164] The embodiment of the present application further provides a storage medium, which may store a program suitable for execution by a processor, wherein the program is used to:

[0165] Acquire a target site area where parking spaces are to be arranged, and lane flow lines within the target site area, wherein the lane flow lines are used to indicate the center line of the lane;

[0166] Based on the lane flow lines in the target site area, the target site area is segmented to obtain a parking space arrangement area;

[0167] According to the set arrangement rules, parking spaces are arranged in the parking space arrangement area obtained by segmentation.

[0168] Optionally, the detailed functions and extended functions of the program may refer to the above description.

[0169] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0170] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The various embodiments can be combined as needed, and the same or similar parts can refer to each other.

[0171] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A parking space arrangement method, characterized in that: include: Acquire a target site area where parking spaces are to be arranged, and lane flow lines within the target site area, wherein the lane flow lines are used to indicate the center line of the lane; Based on the lane streamlines in the target site area, the target site area is segmented by a parking space arrangement area segmentation method based on a minimum ring to obtain a parking space arrangement area; the parking space arrangement area of ​​the minimum ring is a minimum ring composed of an outer contour line of the target site area, an outer contour line of a non-arrangeable area contained in the target site area, and the lane streamlines; According to the set arrangement rules, parking spaces are arranged in the parking space arrangement area obtained by segmentation.

2. The method according to claim 1, characterized in that The step of obtaining a target site area to be arranged with parking spaces includes: The contour line of the target site area and the contour line of the non-arrangeable area contained in the target site area are obtained.

3. The method according to claim 2, characterized in that The step of dividing the target site area based on the lane streamlines in the target site area to obtain parking space arrangement areas includes: storing the contour lines of the target site area into a line set in a first clockwise order, and storing the contour lines of the non-arrangeable area into a line set in a second clockwise order, wherein the first clockwise order is opposite to the second clockwise order; Copying each of the lane flow lines and storing them in the line set as two lines with unchanged positions and opposite directions; Based on the stored line set, searching for a minimum ring composed of lines according to the first clockwise order to obtain several minimum rings; Based on each of the minimum rings, a corresponding parking space arrangement area is determined.

4. The method according to claim 3, characterized in that Based on the stored line set, searching for a minimum ring composed of lines in the first clockwise order to obtain several minimum rings includes: A line is selected from the stored line set, the selected line is used as the starting line, and the lines connected from the beginning to the end are searched in turn in the first clockwise order among the stored lines until the found lines and the starting line form a minimum loop; wherein each time the next line connected to the current line is searched, the line connected to the end point of the current line and having the largest vector angle with the current line is selected as the next line found; Each line included in the found minimum ring is removed from the stored line set, and the step of selecting a line from the line set is returned to be executed until no minimum ring is found, thereby obtaining each found minimum ring.

5. The method according to claim 3, characterized in that: The determining of a corresponding parking space arrangement area based on each of the minimum rings includes: For each of the lane flow lines in the minimum ring, offset the line by half the lane width into the minimum ring to obtain a processed ring; Based on the line set corresponding to the processed ring, a minimum ring composed of lines is searched in the first clockwise order, and the obtained minimum rings are used as parking space arrangement areas.

6. The method according to claim 5, characterized in that Before searching for a minimum ring composed of lines in the first clockwise order based on the line set corresponding to the processed ring, the method further includes: If it is determined that one end of the line segment after the lane streamline is offset by half the lane width is inside the minimum ring, it is extended to the boundary of the minimum ring to obtain the processed ring.

7. The method according to claim 2, characterized in that Before segmenting the target site area based on the lane flow lines in the target site area, the method further includes: A rationality check is performed on each lane flow line. If it is determined that any end point of a target lane flow line is not connected to the contour line of the target site area, the contour line of the non-arrangeable area, or other lane flow lines, the target lane flow line is removed.

8. The method according to any one of claims 1 to 7, characterized in that: Arranging parking spaces in the divided parking space arrangement area according to the set arrangement rule includes: Determine the edge line of the parking space layout area that is adjacent to the lane; For each of the sidelines, parking spaces are arranged successively from one end of the sideline to the other end.

9. The method according to claim 8, characterized in that Before arranging parking spaces one by one from one end to the other end of each sideline, the method further comprises: Arrange the edges in order from longest to shortest; Then, for each of the sidelines, arranging parking spaces one by one from one end of the sideline to the other end includes: According to the sorting order of the sidelines, parking spaces are arranged one by one for each sideline from one end to the other.

10. The method according to claim 8, characterized in that The method further includes: After the parking spaces are arranged for each of the sidelines, the parking spaces that are arranged beyond the parking space arrangement area are removed.

11. The method according to claim 8, characterized in that Also includes: After arranging the parking spaces for each of the sidelines, checking whether there is overlap between the parking spaces arranged for any two sidelines; If so, the target parking space on the shorter sideline of the two sidelines with overlapping parking spaces is removed, because the target parking space overlaps with the parking space on the longer sideline.

12. A parking space arrangement device, characterized in that: include: A data acquisition unit, used to acquire a target site area where parking spaces are to be arranged, and lane flow lines within the target site area, wherein the lane flow lines are used to indicate the center line of the lane; A parking space arrangement area segmentation unit is used to segment the target site area based on the lane streamlines in the target site area by using a parking space arrangement area segmentation method based on a minimum ring to obtain a parking space arrangement area; the parking space arrangement area of ​​the minimum ring is a minimum ring composed of an outer contour line of the target site area, an outer contour line of a non-arrangeable area contained in the target site area, and the lane streamlines; The parking space arrangement unit is used to arrange parking spaces for the parking space arrangement area obtained by segmentation according to a set arrangement rule.

13. A parking space arrangement device, characterized in that: include: Memory and processor; The memory is used to store programs; The processor is used to execute the program to implement each step of the parking space arrangement method according to any one of claims 1 to 11.

14. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, each step of the parking space arrangement method according to any one of claims 1 to 11 is implemented.

Images