CN113158296A - Parking space arrangement method, device, equipment and storage medium - Google Patents
Parking space arrangement method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN113158296A CN113158296A CN202110276675.9A CN202110276675A CN113158296A CN 113158296 A CN113158296 A CN 113158296A CN 202110276675 A CN202110276675 A CN 202110276675A CN 113158296 A CN113158296 A CN 113158296A
- Authority
- CN
- China
- Prior art keywords
- lane
- line
- parking space
- space arrangement
- streamline
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 66
- 230000011218 segmentation Effects 0.000 claims abstract description 23
- 238000012163 sequencing technique Methods 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 3
- 238000007689 inspection Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 description 29
- 238000010586 diagram Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 238000013519 translation Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Geometry (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Theoretical Computer Science (AREA)
- Civil Engineering (AREA)
- Structural Engineering (AREA)
- Computational Mathematics (AREA)
- Architecture (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Traffic Control Systems (AREA)
Abstract
The application discloses parking stall arrangement method, device, equipment and storage medium, this application is regional to the target site of waiting to arrange the parking stall, acquire the lane streamline in it, the lane streamline is used for instructing the central line in lane, and then can be based on the lane streamline, divide target site region, the parking stall that is used for arranging the parking stall after obtaining the segmentation arranges the region, arrange the rule of arranging according to setting for, arrange regional parking stall of carrying out the parking stall and arrange to each parking stall, thereby realize arranging the regional parking stall of target site automatically, compare in relying on the manual parking stall of arranging one by one of designer, this application scheme degree of automation is higher, parking stall arrangement efficiency is faster, it is also shorter consuming time.
Description
Technical Field
The present disclosure relates to the field of computer graphics technologies, and in particular, to a method, an apparatus, a device, and a storage medium for parking space arrangement.
Background
With the continuous development of computer technology, the use of various auxiliary design software becomes necessary skills for practitioners. And the computer aided design software-based further prompt design efficiency is always pursued by practitioners. The parking space arrangement is one of the most important links in the design stage, and the efficiency improvement is always a hotspot researched by researchers in related fields
In the current parking stall mode of arranging, the majority still stops the designer and arranges the parking stall one by one based on the lane, carries out operations such as skew, rotation to the parking stall of arranging at last, obtains the parking stall result of arranging in whole place. Its degree of automation of this kind of processing method is lower, needs the designer to arrange the parking stall one by one, and the whole process of arranging is consuming time longer.
Disclosure of Invention
In view of the above problems, the present application is provided to provide a parking space arrangement method, device, equipment and storage medium, so as to solve the problems of low efficiency and long time consumption of the existing manual parking space arrangement mode. The specific scheme is as follows:
a parking space arrangement method comprises the following steps:
acquiring a target field area where parking spaces are to be arranged and a lane streamline in the target field area, wherein the lane streamline is used for indicating the center line of a lane;
segmenting the target field area based on a lane streamline in the target field area to obtain a parking space arrangement area;
and carrying out parking space arrangement on the parking space arrangement region obtained by segmentation according to a set arrangement rule.
Preferably, the acquiring a target site area of the parking space to be arranged includes:
and obtaining the contour line of the target field area and the contour line of the non-arrangeable area contained in the target field area.
Preferably, the segmenting the target field area based on the lane streamline in the target field area to obtain the parking space arrangement area includes:
storing the contour lines of the target site area to a line set according to a first hour hand sequence, and storing the contour lines of the non-layout area to the line set according to a second hour hand sequence, wherein the first hour hand sequence is opposite to the second hour hand sequence;
copying each lane streamline, and storing the lane streamlines as two lines with unchanged positions and opposite directions in the line set;
based on the stored line set, searching for a minimum ring composed of lines according to the first time sequence to obtain a plurality of minimum rings;
and determining a corresponding parking space arrangement area based on each minimum ring.
Preferably, the searching for the minimum ring composed of lines according to the first time-slot sequence based on the stored line set to obtain a plurality of minimum rings includes:
selecting a line from the stored line set, taking the selected line as a starting line, and sequentially searching lines connected end to end in the stored lines according to the first time sequence until the searched lines and the starting line form a minimum ring; when the next line connected with the current line is searched each time, selecting a line which is connected with the end point of the current line and has the largest vector included angle with the current line as the searched next line;
and removing each line contained in the searched minimum ring from the stored line set, and returning to the step of selecting one line from the line set until the minimum ring is not searched, so as to obtain each searched minimum ring.
Preferably, the determining a corresponding parking space arrangement area based on each of the minimum rings includes:
for each line belonging to the lane streamline in the minimum ring, deviating half lane width towards the interior of the minimum ring to obtain a processed ring;
and searching the minimum rings formed by the lines according to the first time pointer sequence based on the line sets corresponding to the processed rings, and taking the obtained minimum rings as parking space arrangement areas.
Preferably, before the searching for the minimum ring composed of lines according to the first time-point sequence based on the line set corresponding to the processed ring, the method further includes:
and if one end of the line segment of the lane streamline which deviates by half lane width is determined to be positioned in the minimum ring, extending the line segment to the boundary of the minimum ring to obtain the processed ring.
Preferably, before the segmenting the target field area based on the lane streamlines in the target field area, the method further includes:
and carrying out rationality inspection on each lane streamline, and removing a target lane streamline if any endpoint of the target lane streamline is determined not to be connected with the contour line of the target field area, the contour line of the non-layout area or other lane streamlines.
Preferably, according to the set arrangement rule, the parking space arrangement of the parking space arrangement region obtained by segmentation includes:
determining a side line which is adjacent to a lane in the contour line of the parking space arrangement area;
and for each sideline, sequentially arranging parking spaces from one end of the sideline to the other end of the sideline.
Preferably, before the step of arranging the parking spaces successively from one end of each of the sidelines to the other end, the method further comprises:
sequencing all the edges in the order from long to short;
then, for each sideline, arranging parking spaces from one end of the sideline to the other end successively comprises:
and arranging the parking spaces from one end of the sideline to the other end of each sideline in sequence according to the sequencing sequence of the sidelines.
Preferably, the method further comprises:
and after the parking spaces are arranged on each sideline, the arranged parking spaces exceeding the parking space arrangement area are removed.
Preferably, the method further comprises the following steps:
after the parking places are arranged on the side lines, whether overlapping exists between the parking places arranged on any two side lines is checked;
if, then will have in two sidelines that the parking stall overlaps, the target parking stall on the shorter sideline of length removes, there is the overlap in target parking stall and the parking stall on the longer sideline of length.
A parking space arrangement device, comprising:
the system comprises a data acquisition unit, a data acquisition unit and a control unit, wherein the data acquisition unit is used for acquiring a target field area of a parking space to be arranged and a lane streamline in the target field area, and the lane streamline is used for indicating the center line of a lane;
the parking space arrangement region segmentation unit is used for segmenting the target field region based on a lane streamline in the target field region to obtain a parking space arrangement region;
and the parking space arrangement unit is used for carrying out parking space arrangement on the parking space arrangement area obtained by segmentation according to the set arrangement rule.
A parking space arrangement apparatus comprising: a memory and a processor;
the memory is used for storing programs;
the processor is configured to execute the program, and implement the steps of the parking space arrangement method.
A storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the individual steps of the parking space arrangement method as described above.
Borrow by above-mentioned technical scheme, this application is regional to the target site of waiting to arrange the parking stall, acquire the lane streamline in it, the lane streamline is used for instructing the central line in lane, and then can be based on the lane streamline, segmentation is carried out to the target site region, obtain the parking stall that is used for arranging the parking stall after the segmentation and arrange the region, arrange the rule according to setting for, arrange the region to each parking stall and carry out the parking stall and arrange, thereby realize arranging the parking stall of target site region is automatic, compare in relying on the manual parking stall of arranging one by one of designer, this application scheme degree of automation is higher, the efficiency is arranged to the parking stall is faster, it is also shorter consuming time.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the application. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a schematic flow chart of a parking space arrangement method according to an embodiment of the present application;
FIG. 2 illustrates a schematic diagram of a target site area contour line and a lane streamline;
FIG. 3 illustrates a diagram of a minimum ring search process;
FIG. 4 illustrates a lane streamline translation process;
FIG. 5 illustrates another lane streamline translation process;
FIG. 6 illustrates a process diagram of the minimum ring search process selecting the next line of the current line;
FIG. 7 is a schematic diagram illustrating a processing method for overlapping parking spaces arranged in two sidelines;
FIG. 8 illustrates a diagram of the effect of the arrangement of parking spaces on the local parking spaces of the underground parking lot according to the parking space arrangement scheme of the present application;
fig. 9 is a schematic structural view of a parking space arrangement device according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of a parking space arrangement device provided in the embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The application provides a parking stall arrangement scheme, can realize that automatic parking stall arranges, has greatly saved designer's time. The scheme of this application can be realized based on the terminal that possesses data processing ability, and this terminal can be cell-phone, computer, server, high in the clouds etc..
Next, referring to fig. 1, the parking space arrangement method of the present application may include the following steps:
s100, acquiring a target field area of the parking places to be arranged and a lane streamline in the target field area.
Wherein the lane streamline is used to indicate a centerline of a lane.
It should be noted that a basic principle of parking space arrangement is that a parking space needs to be arranged next to a lane, so that a vehicle can drive into the parking space from the lane. In the design software, lanes are typically expressed by lane streamlines. The target site area where the parking space is to be arranged can be an area such as a square, the ground in a cell, a basement parking lot and the like. In order to arrange parking spaces in a target site area, a lane streamline needs to be designed in the target site area.
In this step, the target site area where the lane flow line has been designed can be directly acquired. On this basis, can directly arrange subsequent parking stall based on the lane streamline. Of course, the existing lane streamline can be adjusted, and then subsequent parking space arrangement is carried out based on the adjusted lane streamline.
In addition, the target site area obtained in the step can also be an area without a designed lane flow line, and on the basis, the lane flow line can be firstly arranged in the target site area in the step.
And S110, segmenting the target field area based on the lane streamline in the target field area to obtain a parking space arrangement area.
Specifically, because the arrangement of the parking spaces needs to be based on a lane streamline, the lane streamline can be utilized to segment the target field region in the step, and each region after segmentation can be used as a parking space arrangement region based on that each region after segmentation is adjacent to a lane.
And S120, carrying out parking space arrangement on the parking space arrangement area obtained through segmentation according to a set arrangement rule.
Specifically, this application can set up the rule of arranging of parking stall in advance, and the rule of arranging can stipulate the size of parking stall, the direction that the parking stall was arranged etc.. Based on the arrangement rule, the arrangement of the parking spaces can be carried out on the distribution of the arrangement areas of the divided parking spaces, so that the whole parking space arrangement process of the target field area is completed.
The embodiment of the application provides a parking stall arrangement method, to the target site area of waiting to arrange the parking stall, acquire the lane streamline in it, the lane streamline is used for instructing the central line in lane, and then can be based on the lane streamline, cut target site area, the parking stall that is used for arranging the parking stall after obtaining the segmentation arranges the region, according to the rule of arranging of settlement, arrange regional parking stall to each parking stall and arrange, thereby realize arranging the parking stall of target site area is automatic, compare in relying on the manual parking stall of arranging one by one of designer, this application scheme degree of automation is higher, the efficiency is arranged more fast to the parking stall, it is consuming time also shorter.
In some embodiments of the present application, the target site area of the parking space to be arranged, which is obtained in step S100, may be an outline line expressing the target site area. In addition, if an area such as a building which cannot be laid out exists in the target field area, the contour line of the area which cannot be laid out is further acquired.
On this basis, the process of segmenting the target field area based on the lane streamline in the target field area to obtain the parking space arrangement area in the step S110 is introduced.
In this embodiment, a parking space arrangement region segmentation method based on a minimum ring is introduced.
And S1, storing the contour lines of the target site area to a line set according to a first hour order, and storing the contour lines of the non-layout area to the line set according to a second hour order.
Wherein the first hour hand order is opposite to the second hour hand order. For example, the first hour hand sequence is clockwise and the second hour hand sequence is counterclockwise. Of course, the first hour hand sequence may also be counterclockwise, and the corresponding second hour hand sequence is clockwise.
And S2, copying each lane streamline, and storing the lane streamlines in the line set as two lines with unchanged positions and opposite directions.
Specifically, because the parking stall can all be arranged to the both sides of lane, in order to divide the parking stall as much as possible and arrange the region, can duplicate every lane streamline in this step, also be a lane streamline and become two lane streamlines after duplicating, the position of two lane streamlines after duplicating is unchangeable and the opposite direction to store to the line is concentrated.
As shown in fig. 2:
for the outer contour of the target field area, a clockwise set of lines is stored. The outer contours of the undeployable regions within the target field region are stored as a counterclockwise set of lines. For the lane streamlines (lines connecting the outer contour of the target site area and the outer contour of the layout-incapable area in fig. 2), the two lines with unchanged positions and opposite directions are stored in the line set after being copied (the positions of the two copied lane streamlines in fig. 2 are not overlapped, only for illustrating the effect after copying the lane streamlines, and the position data actually stored in the line set are the same).
And S3, based on the stored line set, searching the minimum rings formed by the lines according to the first time sequence to obtain a plurality of minimum rings.
Specifically, a minimum ring composed of the outer contour line of the target site area, the outer contour line of the non-layout area and the lane streamline can be used as the parking space layout area. Therefore, in this step, the minimum ring composed of the lines in the line set can be searched according to the storage sequence of the outer contour line of the target field area in the line set, that is, the first time-point sequence, and a plurality of minimum rings can be found.
An alternative implementation for finding the minimum loop is as follows:
and S31, selecting a line from the stored line set, taking the selected line as a starting line, and sequentially searching lines connected end to end in the stored lines according to the first time sequence until the searched lines and the starting line form a minimum ring.
And selecting a line which is connected with the end point of the current line and has the largest vector included angle with the current line as the searched next line when searching the next line connected with the current line each time.
Wherein, the value range of the vector included angle can be [0,180 degrees ] and [ 0-180 degrees ].
Referring to fig. 6, the target site area illustrated in fig. 6 is a rectangular area, no layout-incapable area exists inside, and the lane streamline is a line connecting opposite sides of the rectangle illustrated in fig. 6. In the process of finding the minimum loop, assuming that the current line is L1, for simplicity of understanding, the results after replication for each lane streamline in fig. 6 only show the lines starting from the end point of L1, i.e., L2, L3, and L4. When the next line is selected, the vector included angles of L2, L3 and L4 and L1 are respectively judged, the included angle between L1 and L2 is 90 degrees, the included angle between L1 and L3 is 0 degree, and the included angle between L1 and L4 is-90 degrees. And selecting the line with the largest vector included angle, namely L2, as the next line of the current line L1.
It can be understood that, the lines connected end to end are sequentially searched according to the selection mode of the step, and the finally found ring is the minimum ring.
And S32, removing each line contained in the searched minimum ring from the stored line set, and returning to execute the step S31 of selecting one line from the line set until the minimum ring is not searched, so as to obtain each searched minimum ring.
Referring to fig. 3, according to the minimum ring search manner illustrated in the above steps, the two minimum rings illustrated in the right side of fig. 3 may be searched in sequence.
And S4, determining a corresponding parking space arrangement area based on each minimum ring.
It can be understood that each of the searched minimum rings is located within the contour line of the target site area and does not include an undeployable area, and therefore, the corresponding parking space arrangement area can be determined based on each of the minimum rings.
For each minimum ring, the determination process of the corresponding parking space arrangement area can be realized by referring to the following steps:
and S41, for the line belonging to the lane streamline in each minimum ring, deviating half lane width towards the inside of the minimum ring to obtain a processed ring.
Specifically, the minimum ring may include a line of the lane streamline, and the lane streamline is a center line of the lane, so that the lane streamline may be subjected to offset processing. Specifically, the lane streamline can be deviated by half lane width towards the inside of the minimum ring, the deviated line is the side line of the lane, and the processed ring is obtained after the lane streamline is deviated.
It should be noted that, after the partial lane streamline is subjected to the offset processing, one end of the offset line segment may be located inside the minimum ring, and for this case, one end of the offset line segment may be extended to the boundary of the minimum ring, so as to obtain the processed ring.
Referring to fig. 4 and 5, the process of lane streamline offset of the two smallest loops found in fig. 3 is illustrated respectively.
In fig. 4 and 5, the lane streamlines before the shift are indicated by broken lines. And after the lane streamline is deviated, if one end of the line segment after deviation is determined to be positioned in the minimum ring, the line segment after deviation can be extended to the boundary of the minimum ring to obtain a processed ring.
And S42, based on the line set corresponding to the processed rings, searching for the minimum rings formed by the lines according to the first time pointer sequence, and taking the obtained minimum rings as parking space arrangement areas.
It should be noted that, due to the complexity of the shape of the outer contour of the undeployable region in the target field region, the processed ring obtained after the lane streamline offset processing may not include the standard minimum ring, which may include a plurality of minimum rings and some redundant line segments, so that the step of S3 finding the minimum ring composed of lines according to the first time point sequence may be repeated based on the line set corresponding to the processed ring to obtain a plurality of minimum rings, and the finally obtained minimum rings are used as the final parking space arrangement region.
In some embodiments of the application, in the foregoing step S110, based on the lane streamline in the target field area, the target field area is segmented, and before the parking space arrangement area is obtained, a process of performing rationality check on the lane streamline may be further added.
Specifically, the process of performing the rationality check on each lane streamline may include: and if any endpoint of a target lane streamline is determined not to be connected with the contour line of the target field area, the contour line of the non-layout area or other lane streamlines, removing the target lane streamline.
That is, the end point of the lane flow line needs to be connected with the contour line of the target site area, the contour line of the non-arrangeable area or other lane flow lines, otherwise, the lane flow line is unreasonable and needs to be removed.
In some embodiments of the application, regarding step S120, according to a set arrangement rule, a process of performing parking space arrangement on the parking space arrangement region obtained by splitting is introduced.
And S1, determining a side line adjacent to the lane in the contour line of the parking space arrangement area.
Specifically, as can be seen from the introduction of the parking space arrangement area determination process according to the foregoing embodiment, the contour line of each determined parking space arrangement area includes a side line adjacent to the lane. For example, for a borderline obtained by offsetting a lane streamline, the borderline belongs to a borderline adjacent to a lane.
Because the principle of parking space arrangement requires that the parking spaces are close to the lanes, for each parking space arrangement area, a sideline adjacent to the lanes needs to be selected from the contour line of the parking space arrangement area, so that the parking space arrangement is carried out based on the sidelines.
And S2, arranging parking spaces from one end of each sideline to the other end of each sideline.
Specifically, the parking spaces can be sequentially arranged from the starting points of the sidelines to the end point direction, and after the parking spaces are arranged in each sideline, the arranged parking spaces exceeding the parking space arrangement area can be removed.
Further optionally, in order to improve the coverage rate of the parking space arrangement, the following step S3 may be added before the step S2:
and sequencing all the edges in the order from long to short.
That is, for each edge adjacent to the lane in the contour line of the vehicle-space layout region determined in S1, the edges may be sorted in order from long to short.
On this basis, the process of arranging the parking spaces in S2 is to arrange the parking spaces successively from one end of the sidelines to the other end of each sideline in sequence according to the sequencing order of the sidelines.
Still further, after the parking spaces are arranged on the edges, whether overlapping exists between the parking spaces arranged on any two edges can be checked.
If, then will have in two sidelines that the parking stall overlaps, the target parking stall on the shorter sideline of length removes, there is the overlap in target parking stall and the parking stall on the longer sideline of length.
Specifically, see fig. 7 for a schematic representation of:
for the boundary lines L5 and L6, the starting point-to-ending point directions are shown by the arrow directions in fig. 7.
When the parking spaces are arranged, the parking spaces are arranged from the starting point to the ending point of the sideline to the L5 and the L6 respectively, and finally 4 parking spaces shown in fig. 7 are arranged on the L5 and 2 parking spaces shown in fig. 7 are arranged on the L6. The last parking space on the L5 and the first parking space on the L6 are overlapped through inspection, so that the first parking space on the L6 with the shorter length can be removed, the overlapping of the last parking space on the L5 is avoided, and the reasonability of parking space arrangement is guaranteed. And, because remove the target parking stall on the shorter sideline of length in this application embodiment to guaranteed the completeness that the parking stall was arranged on the longer sideline, make whole parking stall arrange more regular reasonable.
Referring to fig. 8, fig. 8 illustrates a local parking space arrangement effect diagram of an underground parking lot according to the parking space arrangement scheme of the present application.
As can be seen from figure 8, the parking stall arrangement scheme of the application not only can realize the automatic arrangement of the parking stalls, but also can realize the overall arrangement rule and reasonableness of the arranged parking stalls, can be directly put into practical application, or can be realized by local fine adjustment of designers, and greatly saves the operation time of the designers.
The parking space arrangement device provided by the embodiment of the application is described below, and the parking space arrangement device described below and the parking space arrangement method described above can be referred to correspondingly.
Referring to fig. 9, fig. 9 is a schematic structural view of a parking space arrangement device disclosed in the embodiment of the present application.
As shown in fig. 9, the apparatus may include:
the system comprises a data acquisition unit 11, a parking space management unit and a parking space management unit, wherein the data acquisition unit is used for acquiring a target field area of a parking space to be arranged and a lane streamline in the target field area, and the lane streamline is used for indicating the center line of a lane;
the parking space arrangement region segmentation unit 12 is configured to segment the target field region based on a lane streamline in the target field region to obtain a parking space arrangement region;
and the parking space arrangement unit 13 is used for carrying out parking space arrangement on the parking space arrangement area obtained through segmentation according to a set arrangement rule.
Optionally, the process of acquiring the target site area of the parking space to be arranged by the data acquisition unit may include:
and obtaining the contour line of the target field area and the contour line of the non-arrangeable area contained in the target field area.
Optionally, the parking space arrangement region segmentation unit segments the target field region based on a lane streamline in the target field region to obtain a process of the parking space arrangement region, which may include:
storing the contour lines of the target site area to a line set according to a first hour hand sequence, and storing the contour lines of the non-layout area to the line set according to a second hour hand sequence, wherein the first hour hand sequence is opposite to the second hour hand sequence;
copying each lane streamline, and storing the lane streamlines as two lines with unchanged positions and opposite directions in the line set;
based on the stored line set, searching for a minimum ring composed of lines according to the first time sequence to obtain a plurality of minimum rings;
and determining a corresponding parking space arrangement area based on each minimum ring.
Optionally, the process of finding the minimum rings formed by the lines according to the first time slot sequence based on the stored line set by the parking space arrangement region segmentation unit to obtain a plurality of minimum rings may include:
selecting a line from the stored line set, taking the selected line as a starting line, and sequentially searching lines connected end to end in the stored lines according to the first time sequence until the searched lines and the starting line form a minimum ring; when the next line connected with the current line is searched each time, selecting a line which is connected with the end point of the current line and has the largest vector included angle with the current line as the searched next line;
and removing each line contained in the searched minimum ring from the stored line set, and returning to the step of selecting one line from the line set until the minimum ring is not searched, so as to obtain each searched minimum ring.
Optionally, the process of determining the corresponding parking space arrangement region by the parking space arrangement region segmentation unit based on each minimum ring may include:
for each line belonging to the lane streamline in the minimum ring, deviating half lane width towards the interior of the minimum ring to obtain a processed ring;
and searching the minimum rings formed by the lines according to the first time pointer sequence based on the line sets corresponding to the processed rings, and taking the obtained minimum rings as parking space arrangement areas.
Optionally, before the parking space arrangement region segmentation unit searches for the minimum ring composed of lines according to the first time slot sequence based on the line set corresponding to the processed ring, the following operations may be further performed:
and if one end of the line segment of the lane streamline which deviates by half lane width is determined to be positioned in the minimum ring, extending the line segment to the boundary of the minimum ring to obtain the processed ring.
Optionally, the apparatus of the present application may further include:
and the lane streamline checking unit is used for checking the reasonableness of each lane streamline before segmenting the target field area based on the lane streamline in the target field area, and removing the target lane streamline if any endpoint of a determined target lane streamline is not connected with the contour line of the target field area, the contour line of the non-arrangeable area or other lane streamlines.
Optionally, the parking space arrangement unit arranges the process of parking space arrangement in the parking space arrangement region according to the set arrangement rule, and the process may include:
determining a side line which is adjacent to a lane in the contour line of the parking space arrangement area;
and for each sideline, sequentially arranging parking spaces from one end of the sideline to the other end of the sideline.
Optionally, before the parking spaces are arranged from one end of each sideline to the other end of each sideline in sequence, the parking space arrangement unit may further include:
sequencing all the edges in the order from long to short;
then, for each sideline, arranging parking spaces from one end of the sideline to the other end successively comprises:
and arranging the parking spaces from one end of the sideline to the other end of each sideline in sequence according to the sequencing sequence of the sidelines.
Optionally, the parking space arrangement unit arranges the process of parking space arrangement in the parking space arrangement region according to the set arrangement rule, and the process may further include:
and after the parking spaces are arranged on each sideline, the arranged parking spaces exceeding the parking space arrangement area are removed.
Optionally, the parking space arrangement unit arranges the process of parking space arrangement in the parking space arrangement region according to the set arrangement rule, and the process may further include:
after the parking places are arranged on the side lines, whether overlapping exists between the parking places arranged on any two side lines is checked;
if, then will have in two sidelines that the parking stall overlaps, the target parking stall on the shorter sideline of length removes, there is the overlap in target parking stall and the parking stall on the longer sideline of length.
The parking stall arrangement device that this application embodiment provided can be applied to the parking stall and arrange equipment, like the terminal: mobile phones, computers, etc. Optionally, fig. 10 shows a block diagram of a hardware structure of the parking space arrangement device, and referring to 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;
in the embodiment of the 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 complete mutual communication through the communication bus 4;
the processor 1 may be a central processing unit CPU, or an application Specific Integrated circuit asic, or one or more Integrated circuits configured to implement embodiments of the present invention, etc.;
the memory 3 may include a high-speed RAM memory, and may further include a non-volatile memory (non-volatile memory) or the like, such as at least one disk memory;
wherein the memory stores a program and the processor can call the program stored in the memory, the program for:
acquiring a target field area where parking spaces are to be arranged and a lane streamline in the target field area, wherein the lane streamline is used for indicating the center line of a lane;
segmenting the target field area based on a lane streamline in the target field area to obtain a parking space arrangement area;
and carrying out parking space arrangement on the parking space arrangement region obtained by segmentation according to a set arrangement rule.
Alternatively, the detailed function and the extended function of the program may be as described above.
Embodiments of the present application further provide a storage medium, where a program suitable for execution by a processor may be stored, where the program is configured to:
acquiring a target field area where parking spaces are to be arranged and a lane streamline in the target field area, wherein the lane streamline is used for indicating the center line of a lane;
segmenting the target field area based on a lane streamline in the target field area to obtain a parking space arrangement area;
and carrying out parking space arrangement on the parking space arrangement region obtained by segmentation according to a set arrangement rule.
Alternatively, the detailed function and the extended function of the program may be as described above.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, the embodiments may be combined as needed, and the same and similar parts may be referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (14)
1. A parking space arrangement method is characterized by comprising the following steps:
acquiring a target field area where parking spaces are to be arranged and a lane streamline in the target field area, wherein the lane streamline is used for indicating the center line of a lane;
segmenting the target field area based on a lane streamline in the target field area to obtain a parking space arrangement area;
and carrying out parking space arrangement on the parking space arrangement region obtained by segmentation according to a set arrangement rule.
2. The method of claim 1, wherein the obtaining of the target site area for the parking space to be arranged comprises:
and obtaining the contour line of the target field area and the contour line of the non-arrangeable area contained in the target field area.
3. The method of claim 2, wherein the segmenting the target site area based on the lane streamlines within the target site area to obtain a carport arrangement area comprises:
storing the contour lines of the target site area to a line set according to a first hour hand sequence, and storing the contour lines of the non-layout area to the line set according to a second hour hand sequence, wherein the first hour hand sequence is opposite to the second hour hand sequence;
copying each lane streamline, and storing the lane streamlines as two lines with unchanged positions and opposite directions in the line set;
based on the stored line set, searching for a minimum ring composed of lines according to the first time sequence to obtain a plurality of minimum rings;
and determining a corresponding parking space arrangement area based on each minimum ring.
4. The method of claim 3, wherein searching for the minimum rings of lines in the first time order based on the stored set of lines to obtain a plurality of minimum rings comprises:
selecting a line from the stored line set, taking the selected line as a starting line, and sequentially searching lines connected end to end in the stored lines according to the first time sequence until the searched lines and the starting line form a minimum ring; when the next line connected with the current line is searched each time, selecting a line which is connected with the end point of the current line and has the largest vector included angle with the current line as the searched next line;
and removing each line contained in the searched minimum ring from the stored line set, and returning to the step of selecting one line from the line set until the minimum ring is not searched, so as to obtain each searched minimum ring.
5. The method of claim 3, wherein said determining a corresponding parking space arrangement area based on each of said minimum loops comprises:
for each line belonging to the lane streamline in the minimum ring, deviating half lane width towards the interior of the minimum ring to obtain a processed ring;
and searching the minimum rings formed by the lines according to the first time pointer sequence based on the line sets corresponding to the processed rings, and taking the obtained minimum rings as parking space arrangement areas.
6. The method of claim 5, wherein before said finding the smallest ring of lines in the first time order based on the set of lines corresponding to the processed ring, the method further comprises:
and if one end of the line segment of the lane streamline which deviates by half lane width is determined to be positioned in the minimum ring, extending the line segment to the boundary of the minimum ring to obtain the processed ring.
7. The method of claim 2, wherein prior to said segmenting said target site area based on lane streamlines within said target site area, the method further comprises:
and carrying out rationality inspection on each lane streamline, and removing a target lane streamline if any endpoint of the target lane streamline is determined not to be connected with the contour line of the target field area, the contour line of the non-layout area or other lane streamlines.
8. The method according to any one of claims 1 to 7, wherein the performing parking space arrangement on the parking space arrangement region obtained by splitting according to the set arrangement rule comprises:
determining a side line which is adjacent to a lane in the contour line of the parking space arrangement area;
and for each sideline, sequentially arranging parking spaces from one end of the sideline to the other end of the sideline.
9. The method of claim 8, wherein prior to said arranging the slots successively for each of said sidelines from one end of said sideline to the other, the method further comprises:
sequencing all the edges in the order from long to short;
then, for each sideline, arranging parking spaces from one end of the sideline to the other end successively comprises:
and arranging the parking spaces from one end of the sideline to the other end of each sideline in sequence according to the sequencing sequence of the sidelines.
10. The method of claim 8, further comprising:
and after the parking spaces are arranged on each sideline, the arranged parking spaces exceeding the parking space arrangement area are removed.
11. The method of claim 8, further comprising:
after the parking places are arranged on the side lines, whether overlapping exists between the parking places arranged on any two side lines is checked;
if, then will have in two sidelines that the parking stall overlaps, the target parking stall on the shorter sideline of length removes, there is the overlap in target parking stall and the parking stall on the longer sideline of length.
12. A parking space arrangement device is characterized by comprising:
the system comprises a data acquisition unit, a data acquisition unit and a control unit, wherein the data acquisition unit is used for acquiring a target field area of a parking space to be arranged and a lane streamline in the target field area, and the lane streamline is used for indicating the center line of a lane;
the parking space arrangement region segmentation unit is used for segmenting the target field region based on a lane streamline in the target field region to obtain a parking space arrangement region;
and the parking space arrangement unit is used for carrying out parking space arrangement on the parking space arrangement area obtained by segmentation according to the set arrangement rule.
13. A parking space arrangement device, comprising: a memory and a processor;
the memory is used for storing programs;
the processor is configured to execute the program to implement the steps of the parking space arrangement method according to any one of claims 1 to 11.
14. A storage medium on which a computer program is stored, wherein the computer program, when executed by a processor, implements the steps of the parking space arrangement method according to any one of claims 1 to 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110276675.9A CN113158296A (en) | 2021-03-15 | 2021-03-15 | Parking space arrangement method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110276675.9A CN113158296A (en) | 2021-03-15 | 2021-03-15 | Parking space arrangement method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113158296A true CN113158296A (en) | 2021-07-23 |
Family
ID=76887491
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110276675.9A Pending CN113158296A (en) | 2021-03-15 | 2021-03-15 | Parking space arrangement method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113158296A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114446090A (en) * | 2022-04-07 | 2022-05-06 | 深圳小库科技有限公司 | Method, device, equipment and medium for generating parking space arrangement scheme of ground parking lot |
| WO2024067175A1 (en) * | 2022-09-26 | 2024-04-04 | 华为技术有限公司 | Map construction method and apparatus, and vehicle |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180032643A1 (en) * | 2016-07-26 | 2018-02-01 | Mitek Holdings, Inc. | Design-model management |
| CN108615404A (en) * | 2018-06-15 | 2018-10-02 | 北京四象网讯科技有限公司 | The method, apparatus and readable storage medium storing program for executing of automatic planning parking position |
| CN109784344A (en) * | 2019-01-24 | 2019-05-21 | 中南大学 | A kind of non-targeted filtering method of image for ground level mark identification |
| CN111159811A (en) * | 2020-01-02 | 2020-05-15 | 广东博智林机器人有限公司 | Underground garage layout method, device, equipment and storage medium |
| CN111159809A (en) * | 2019-12-31 | 2020-05-15 | 广东博智林机器人有限公司 | Garage drawing generation method and device, electronic equipment and storage medium |
| CN111506939A (en) * | 2020-04-24 | 2020-08-07 | 广东博智林机器人有限公司 | Garage design method, device, terminal and medium |
| CN111739043A (en) * | 2020-04-13 | 2020-10-02 | 北京京东叁佰陆拾度电子商务有限公司 | Parking space drawing method, device, equipment and storage medium |
| JP2020170267A (en) * | 2019-04-01 | 2020-10-15 | トヨタホーム株式会社 | Outdoor facilities planning support device |
| CN111814235A (en) * | 2020-07-01 | 2020-10-23 | 广东博智林机器人有限公司 | Parking space arrangement optimization and polygon simplification method, device, equipment and storage medium |
| CN111968402A (en) * | 2020-08-12 | 2020-11-20 | 广东博智林机器人有限公司 | Parking space arrangement method, device, terminal and medium |
-
2021
- 2021-03-15 CN CN202110276675.9A patent/CN113158296A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180032643A1 (en) * | 2016-07-26 | 2018-02-01 | Mitek Holdings, Inc. | Design-model management |
| CN108615404A (en) * | 2018-06-15 | 2018-10-02 | 北京四象网讯科技有限公司 | The method, apparatus and readable storage medium storing program for executing of automatic planning parking position |
| CN109784344A (en) * | 2019-01-24 | 2019-05-21 | 中南大学 | A kind of non-targeted filtering method of image for ground level mark identification |
| JP2020170267A (en) * | 2019-04-01 | 2020-10-15 | トヨタホーム株式会社 | Outdoor facilities planning support device |
| CN111159809A (en) * | 2019-12-31 | 2020-05-15 | 广东博智林机器人有限公司 | Garage drawing generation method and device, electronic equipment and storage medium |
| CN111159811A (en) * | 2020-01-02 | 2020-05-15 | 广东博智林机器人有限公司 | Underground garage layout method, device, equipment and storage medium |
| CN111739043A (en) * | 2020-04-13 | 2020-10-02 | 北京京东叁佰陆拾度电子商务有限公司 | Parking space drawing method, device, equipment and storage medium |
| CN111506939A (en) * | 2020-04-24 | 2020-08-07 | 广东博智林机器人有限公司 | Garage design method, device, terminal and medium |
| CN111814235A (en) * | 2020-07-01 | 2020-10-23 | 广东博智林机器人有限公司 | Parking space arrangement optimization and polygon simplification method, device, equipment and storage medium |
| CN111968402A (en) * | 2020-08-12 | 2020-11-20 | 广东博智林机器人有限公司 | Parking space arrangement method, device, terminal and medium |
Non-Patent Citations (1)
| Title |
|---|
| 陈舣亦;楼肖华;: "城市中心区停车规划策略研究", 城市道桥与防洪, no. 11 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114446090A (en) * | 2022-04-07 | 2022-05-06 | 深圳小库科技有限公司 | Method, device, equipment and medium for generating parking space arrangement scheme of ground parking lot |
| CN114446090B (en) * | 2022-04-07 | 2022-06-21 | 深圳小库科技有限公司 | Method, device, equipment and medium for generating parking space arrangement scheme of ground parking lot |
| WO2024067175A1 (en) * | 2022-09-26 | 2024-04-04 | 华为技术有限公司 | Map construction method and apparatus, and vehicle |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113158296A (en) | Parking space arrangement method, device, equipment and storage medium | |
| CN111159809B (en) | Garage drawing generation method and device, electronic equipment and storage medium | |
| WO2019024391A1 (en) | Differential code synchronization method, storage medium, electronic device and system | |
| CN111968402B (en) | Parking space arrangement method, device, terminal and medium | |
| CN115779424B (en) | Navigation grid path finding method, device, equipment and medium | |
| CN111104410A (en) | Local road information extraction method and device | |
| CN113026457B (en) | Road construction segment determining method and determining device | |
| US11429759B2 (en) | Method for selecting multiple edges and faces in modeled object | |
| CN110750556B (en) | Method and device for thinning and filling joints of geographic data and storage medium | |
| CN108920749B (en) | Pipeline two-dimensional and three-dimensional data updating method and device and computer readable storage medium | |
| CN114092932A (en) | Method and device for identifying chamfered surface, electronic equipment and storage medium | |
| CN115953501B (en) | Method, device, equipment and storage medium for generating ordered discrete point set | |
| CN108346170B (en) | Gap filling method and device for electronic map | |
| US10157485B2 (en) | Method and system for merging of polygons in adjacent tiles | |
| CN104801044A (en) | Method and device for generating trajectory vertex sequence | |
| CN110597845A (en) | Method, device and system for distributed storage and geographic data retrieval | |
| CN110674890B (en) | Filling model establishing method, graph filling method and device and electronic equipment | |
| CN109855633A (en) | Map updating method, device, equipment and storage medium | |
| JP2897541B2 (en) | Closed figure extraction method | |
| CN117253052A (en) | Maximum closure area identification method and device, storage medium and computer equipment | |
| CN117437329B (en) | High-consequence region drawing method, system, readable storage medium and computer device | |
| CN114943112B (en) | Automatic generation method, device, equipment and medium for arrangement scheme along building line | |
| CN112101369B (en) | Image segmentation method and device | |
| CN112465978B (en) | Geological model processing method, device, equipment and computer readable storage medium | |
| Marchand-Maillet et al. | Skeleton location and evaluation based on local digital width in ribbon-like images |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |