CN104575081A - Method for detecting entrance of vehicle into polygonal electronic fence region - Google Patents

Method for detecting entrance of vehicle into polygonal electronic fence region Download PDF

Info

Publication number
CN104575081A
CN104575081A CN201410740462.7A CN201410740462A CN104575081A CN 104575081 A CN104575081 A CN 104575081A CN 201410740462 A CN201410740462 A CN 201410740462A CN 104575081 A CN104575081 A CN 104575081A
Authority
CN
China
Prior art keywords
region
polygon
vehicle
fence region
domain
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.)
Granted
Application number
CN201410740462.7A
Other languages
Chinese (zh)
Other versions
CN104575081B (en
Inventor
张天瑜
褚阳波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SHENZHEN G&T INDUSTRIAL DEVELOPMENT Co Ltd
Original Assignee
SHENZHEN G&T INDUSTRIAL DEVELOPMENT Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by SHENZHEN G&T INDUSTRIAL DEVELOPMENT Co Ltd filed Critical SHENZHEN G&T INDUSTRIAL DEVELOPMENT Co Ltd
Priority to CN201410740462.7A priority Critical patent/CN104575081B/en
Publication of CN104575081A publication Critical patent/CN104575081A/en
Application granted granted Critical
Publication of CN104575081B publication Critical patent/CN104575081B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/123Traffic control systems for road vehicles indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Image Analysis (AREA)

Abstract

The invention provides a method for detecting entrance of a vehicle into a polygonal electronic fence region. The method for detecting the entrance of the vehicle into the polygonal electronic fence region comprises the following steps: judging whether the electronic fence region is a convex polygonal region or a concave polygonal region; converting the concave polygonal region to a convex polygonal region if the electronic fence region is the concave polygonal region; making a reference straight line based on each side of the convex polygonal region, constructing reference straight lines with directions according to the clockwise or counterclockwise direction based on the various sides and judging whether the vehicle is positioned on the same side of all the reference straight lines or not if the electronic fence region is the convex polygonal region; confirming that the vehicle enters the electronic fence region if the vehicle is positioned on the same side of all the reference straight lines of the electronic fence region.

Description

Vehicle enters the detection method in polygon fence region
Technical field
The present invention relates to vehicle location monitoring technique, especially, relate to the detection method that a kind of vehicle enters polygon fence region.
Background technology
Along with the raising of people's living standard, automobile, as a kind of important trip vehicles, comes into huge numbers of families gradually.May there is some region can enter vehicle and carry out management and control in real life, whether these regions generally can be designed fence and enter vehicle and detect.Current industry is for judging that the detection whether vehicle enters polygonal fence region judges generally to adopt approximate data, computing more complicated, and accuracy is not high.
Summary of the invention
One of them object of the present invention be for solve prior art above-mentioned technical matters and provide the detection method that a kind of vehicle enters polygon fence region.
Vehicle provided by the invention enters the detection method in polygon fence region, comprising: judge that fence region is Convex Polygon Domain or concave polygon region; If described fence region is concave polygon region, converts concave polygon region to Convex Polygon Domain and process; If described fence region is Convex Polygon Domain, based on described Convex Polygon Domain each bar limit and according to building the directive reference line of tool clockwise or counterclockwise, and judge whether vehicle is positioned at the same side of all reference lines in described fence region; If described vehicle is positioned at the same side of all reference lines in described fence region, judge that described vehicle enters described fence region.
Enter at vehicle provided by the invention in a kind of preferred embodiment of the detection method in polygon fence region, also comprise: judge described vehicle enter described fence region after start report to the police instruction.
Enter in a kind of preferred embodiment of the detection method in polygon fence region at vehicle provided by the invention, described judgement fence region is that Convex Polygon Domain or concave polygon region comprise: extracted on the summit in polygon fence region; Based on the connecting line on adjacent two summits in described polygon fence region, according to building the directive reference line of described tool clockwise or counterclockwise; Using any one reference line as with reference to line, judge whether other summits in described polygon fence region except the summit of described reference line are all positioned at the same side of described reference line; If be all positioned at the same side, then can judge that described polygon fence region is Convex Polygon Domain; Otherwise, can judge that described polygon fence region is concave polygon region.
Enter at vehicle provided by the invention in a kind of preferred embodiment of the detection method in polygon fence region, describedly concave polygon region is converted to the step that Convex Polygon Domain carries out processing and comprise: search the crucial summit that described fence region of sening as an envoy to becomes concave polygon region; According to described crucial summit, increase auxiliary area in described concave polygon region, build virtual Convex Polygon Domain.
Enter in a kind of preferred embodiment of the detection method in polygon fence region at vehicle provided by the invention, the lookup method on described crucial summit comprises: if using adjacent two reference lines at place, some summits as during with reference to line, all find that other summits lay respectively at the not homonymy of described reference line, then described summit is the crucial summit making described fence region become concave polygon region.
Enter in a kind of preferred embodiment of the detection method in polygon fence region at vehicle provided by the invention, the virtual Convex Polygon Domain of described structure comprises: two virtual boost lines in summit adjacent with described crucial summit in described fence region coupled together, and gets rid of described crucial summit thus form a virtual polygonal region.
Enter in a kind of preferred embodiment of the detection method in polygon fence region at vehicle provided by the invention, describedly concave polygon region being converted to the step that Convex Polygon Domain carries out processing and also comprise: based on each bar limit of described virtual Convex Polygon Domain according to building described virtual Convex Polygon Domain reference line clockwise or counterclockwise, judging whether vehicle is positioned at the same side of all reference lines of described virtual Convex Polygon Domain; If described vehicle is positioned at the same side of all reference lines of described virtual Convex Polygon Domain, judge whether described vehicle is positioned at described auxiliary area; If described vehicle is positioned at the same side of all reference lines of described virtual Convex Polygon Domain and is not positioned at described auxiliary area, then judge that vehicle enters described fence region.
Enter in a kind of preferred embodiment of the detection method in polygon fence region at vehicle provided by the invention, also comprise: if the virtual polygonal region got rid of described crucial summit and form is still concave polygon region, whether described vehicle is positioned at described virtual polygonal region inside to adopt recursive fashion to judge.
Compared to prior art, the detection method that vehicle provided by the invention enters polygon fence region builds reference line according to the summit in the fence region of convex polygon, and by judging that the same side whether vehicle position is positioned at all reference lines judges whether vehicle enters polygon fence region further, detect evaluation algorithm comparatively simple.In addition, can virtual convex polygon be built thus also go for above-mentioned detection determination methods by increase auxiliary area when fence region is concave polygon, therefore method provided by the invention is equally applicable to the fence region of convex polygon and concave polygon, the scope of application is wider compared to existing technologies, and testing result accurately and reliably.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, below the accompanying drawing used in describing embodiment is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings, wherein:
Fig. 1 is the schematic flow sheet that vehicle provided by the invention enters a kind of embodiment of detection method in polygon fence region;
Fig. 2 is the detection schematic diagram of the method shown in Fig. 1 when described fence region is convex polygon;
Fig. 3 to Fig. 6 is the detection schematic diagram of method when described fence region is concave polygon described in Fig. 1.
Embodiment
Be clearly and completely described to the technical scheme in the embodiment of the present invention below, obviously, described embodiment is only a part of embodiment of the present invention, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making other embodiments all obtained under creative work prerequisite, belong to the scope of protection of the invention.
Refer to Fig. 1, it is the schematic flow sheet that vehicle provided by the invention enters a kind of embodiment of detection method in polygon fence region.The detection method that described vehicle enters polygon fence region mainly comprises the following steps:
Step 101, the summit based on fence region builds the directive reference line of tool with clockwise or counter clockwise direction, and judges that fence region is Convex Polygon Domain or concave polygon region according to described reference line; If Convex Polygon Domain, enter step 102; And if concave polygon region, enter step 105.
Particularly, be convex polygon or concave polygon about the polygon fence region that the present invention relates to, can judge by the following method:
First, extracted on the summit in described polygon fence region, see also Fig. 2 and Fig. 3, the summit in described fence region can be summit S1, S2, S3, S4, S5 and S6 as shown in Figure 2; Or summit P1, P2, P3, P4, P5 and P6 as shown in Figure 3.
Secondly, based on the connecting line on adjacent two summits in described polygon fence region, according to building the directive reference line of multiple tool clockwise or counterclockwise;
Such as, in the polygon fence region 200 shown in Fig. 2, the reference line that the connecting line based on adjacent two summit S1 and S2 builds is the straight line S1-S2 pointing to S2 from S1; In a clockwise direction, similarly can also construct reference line S2-S3, S3-S4, S4-S5, S5-S6 and S6-S1, namely always have six reference lines.In fact each reference line can correspond to a wherein limit in described polygon fence region 200.And in the polygon fence region 300 shown in Fig. 3, six reference lines P1-P2, P2-P3, P3-P4, P4-P5, P5-P6 and P6-P1 can be constructed equally in a clockwise direction.
Then, using any one reference line as reference line, judge whether other summits in described polygon fence region except the summit of described reference line are all positioned at the same side of described reference line, if be all positioned at the same side, then can judge that described polygon fence region is Convex Polygon Domain; Otherwise, can judge that described polygon fence region is concave polygon region.
Particularly, refer to Fig. 2, in described polygon fence region 200, using reference line S1-S2 as with reference to line, can detect that other summits S3, S4, S5 and S6 are all positioned at the right side of described reference line; Analogously, using other any reference line S2-S3, S3-S4, S4-S5, S5-S6 and S6-S1 as when detecting with reference to line, can judge that other summits are all positioned at the right side of described reference line equally, thus, just can judge that the polygon fence region 200 shown in Fig. 2 is Convex Polygon Domain.
And in the polygon fence region 300 shown in Fig. 3, using reference line P3-P4 as with reference to line, can detect that summit P2 is positioned at the right side of described reference line, and summit P5 is positioned at the left side of described reference line; Analogously, using datum line P4-P5 as with reference to line, can detect that summit P6 is positioned at the right side of described reference line, and summit P3 is positioned at the left side of described reference line.In other words, in the polygon fence region 300 shown in Fig. 3, can detect that some reference line makes other summits lay respectively at the not homonymy of described reference line according to the method described above, therefore can judge that the polygon fence region 300 shown in Fig. 3 is concave polygon region.
Step 102, if described fence region is Convex Polygon Domain, judges whether vehicle is positioned at the same side of all reference lines in described fence region;
For ease of understanding, it is that example is described that following examples build reference line in a clockwise direction.Refer to Fig. 2, in a clockwise direction using each limit in described convex polygon fence region 200 as reference line, i.e. connecting line S1-S2, S2-S3, S3-S4, S4-S5, S5-S6 and the S6-S1 on above-mentioned adjacent two summits, judges whether described vehicle position is positioned at the same side of all reference line S1-S2, S2-S3, S3-S4, S4-S5, S5-S6 and S6-S1 of described Convex Polygon Domain.Such as, if vehicle position is the T point shown in Fig. 2, then it is positioned at the right side of all reference lines; And if vehicle position is the M point shown in Fig. 2 or N point, then it is not positioned at the same side of described reference line.Particularly, when vehicle is at M point, it is positioned at the right side of reference line S1-S2, the left side of reference line S2-S3; And when vehicle is at N point, it is positioned at the right side of reference line S5-S6, the left side of reference line S6-S1.
Step 103, if whether vehicle is positioned at the same side of all reference lines in the fence region of described convex polygon, judges that vehicle enters described fence region, and starts warning;
After above-mentioned steps 102 judges whether described vehicle is positioned at the same side of all reference lines of described Convex Polygon Domain, can judge that vehicle enters the fence region of described convex polygon further; Further, now warning can be started as required.
Step 104, if whether vehicle is positioned at the same side of all reference lines in the fence region of described convex polygon, judges that vehicle does not enter described fence region, does not start warning.
Step 105, if described fence region is concave polygon region, is converted to Convex Polygon Domain by described concave polygon region and processes.
Particularly, refer to Fig. 6, what step 105 related to be converted to described concave polygon region, and Convex Polygon Domain carries out process can comprise following sub-step:
First, the crucial summit that fence region of sening as an envoy to becomes concave polygon region is searched;
Particularly, in the polygon fence region 300 judged shown in Fig. 3 for after concave polygon region, can find out further and make described fence region 300 become the crucial summit of concave polygon in the summit P1 ~ P6 in described fence region 300.Described crucial summit can find out by the following method: if using adjacent two reference lines at place, some summits as during with reference to line, all can find that other summits lay respectively at the not homonymy of described reference line, then described summit is the crucial summit causing described fence region to become concave polygon region.
Refer to Fig. 3, using one of them reference line P3-P4 at P4 place, summit as with reference to line, left side and right side that summit P5 and P2 lays respectively at described reference line can be found out; And using another reference line P4-P5 at P4 place, summit as reference line, left side and right side that summit P3 and P6 lays respectively at described reference line can be found out, therefore can judge that described summit P4 is the crucial summit causing described fence region 300 to become concave polygon region.And using the reference line P2-P3 at other summits (such as P3) place as during with reference to line, can find that other summits P1, P4, P5 and P6 are all positioned at the right side of described reference line, namely there are not being positioned at other summits of described reference line not homonymy, then can judge summit P3 not described crucial summit.
Secondly, according to described crucial summit, increase auxiliary area in described concave polygon region, build virtual Convex Polygon Domain;
Judging that summit P4 is for making after the fence region 300 shown in Fig. 3 is the crucial summit in concave polygon region, auxiliary area (shadow region A2 as shown in Figure 4) can be increased according to described crucial summit P4 in described concave polygon region, thus the fence region 300 originally for concave polygon is converted to a virtual Convex Polygon Domain.
Refer to Fig. 4, the concrete grammar of the Convex Polygon Domain that structure provided by the invention is virtual can be: coupled together with virtual boost line P3-P5 on two summits (being namely summit P3 and summit P5) adjacent with described crucial summit P4 in described fence region 300, and exclude described crucial summit P4, thus the Convex Polygon Domain that formation one is virtual, because described crucial summit P4 is excluded, so described virtual Convex Polygon Domain only includes following summit: P1, P2, P3, P5 and P6.Above-mentioned virtual Convex Polygon Domain can be the equal of on the basis in the fence region 300 of original concave polygon, increasing by one using described crucial summit P4 and adjacent two summit P3 and P5 thereof as the triangle auxiliary area on summit, is namely the shadow region A2 shown in Fig. 4.Suppose that the fence region 300 of original concave polygon is designated as A1, the virtual Convex Polygon Domain built after increasing described auxiliary area A2 is just specially A1+A2.
After constructing described virtual Convex Polygon Domain A1+A2, the determination methods of the Convex Polygon Domain that just can relate to according to step 102, judges whether described vehicle is positioned at the same side of all reference lines of described virtual Convex Polygon Domain.
Particularly, refer to Fig. 5, based on each limit that summit P1, P2, P3, P5 and P6 of described virtual Convex Polygon Domain A1+A2 correspond respectively to described virtual Convex Polygon Domain A1+A2 with tool directive reference line P1-P2, P2-P3, P3-P5, P5-P6 and P6-P1 of building along pointer direction, in described virtual Convex Polygon Domain, described virtual boost line P3-P5 is namely adopted to replace reference line P3-P4 and P4-P5 of original concave polygon region A1.Then, just according to step 102, can judge whether described vehicle position is positioned at the same side of all reference line P1-P2, P2-P3, P3-P5, P5-P6 and P6-P1 of described virtual Convex Polygon Domain.
Such as, if vehicle position is the X point shown in Fig. 5, then can judge that it is positioned at the right side of described reference line P1-P2, P2-P3, P3-P5, P5-P6 and P6-P1, namely current described vehicle is positioned at the same side of described reference line.And if vehicle position is the Y point shown in Fig. 5, then can judges that it is positioned at the right side of described reference line P1-P2, P3-P5, P5-P6 and P6-P1, but be positioned at the left side of described reference line P2-P3; Analogously, if vehicle position is the Z point shown in Fig. 5, then the right side of its P2-P3, P3-P5, P5-P6 and P6-P1, but the left side being positioned at described reference line P1-P2; In other words, when described vehicle is positioned at the Y point shown in Fig. 5 or Z point, it is not positioned at the same side of all reference lines of described virtual Convex Polygon Domain.
Be to be understood that, when described fence region is concave polygon region, owing to introducing described auxiliary area A2 in above-mentioned deterministic process, therefore, after judging that the position at described vehicle place is positioned at the same side of all reference lines, X point as shown in Figure 5, also needs to judge whether described X point is positioned within described auxiliary area A2 further.As shown in Figure 5, because described auxiliary area A2 is triangle, namely it is also Convex Polygon Domain, therefore judges that the method whether described X point is positioned within described auxiliary area A2 can with reference to judging whether vehicle is positioned at the scheme of Convex Polygon Domain inside, repeats no more herein above.
On the other hand, should be noted that, embodiment shown in Fig. 5 only relates to the situation that described concave polygon region only has a crucial summit P4, and therefore it just can obtain described virtual Convex Polygon Domain after getting rid of described crucial summit P4 and increase described auxiliary area A2; But in practical situations both, likely concave polygon region has multiple crucial summit, now described concave polygon region is after one of them crucial summit of eliminating, still has the shape of concave polygon, in this case, just needs to adopt Recursion process.
Particularly, refer to Fig. 6, if when described fence region is for concave polygon region ABCDEFGHIJK shown in Fig. 6, then in summit A, B, C, D, E, F, G, H, I, J, K and the L in described concave polygon region, can judge that the crucial summit that described fence region becomes concave polygon region is L, K, J, I, H and G.
First, because described fence region ABCDEFGHIJK is concave polygon region, for wherein first crucial summit L, remove described crucial summit L by adding virtual boost line A-K, thus obtain the first virtual polygonal region ABCDEFGHIJK; Then, by judging that the first virtual polygonal region ABCDEFGHIJK obtains it still as concave polygon region, then for second crucial summit K, remove described crucial summit K by adding virtual boost line A-J, thus obtain the second virtual polygonal region ABCDEFGHIJ; The like, described crucial summit J is removed respectively by the virtual boost line A-I of interpolation, add virtual boost line A-H to remove described crucial summit I, add virtual boost line A-G to remove described crucial summit H, until add virtual boost line A-F to remove described crucial summit G and to obtain virtual polygonal region ABCDEF, now judge that described virtual polygonal region ABCDEF is Convex Polygon Domain.In described virtual Convex Polygon Domain ABCDEF, the auxiliary area of interpolation is ALKJIHGF.
For described virtual Convex Polygon Domain ABCDEF, its reference line built according to clockwise direction is A-B, B-C, C-D, D-E, E-F and F-A respectively.
If Current vehicle is positioned at the Y point shown in Fig. 5, then can judge that it is not positioned at the same side of all reference lines of described virtual Convex Polygon Domain ABCDEF, therefore can judge that it is not positioned within described virtual polygonal region ABCDEF; And the subset being described virtual polygonal region ABCDEF due to the fence region ABCDEFGHIJK of described concave polygon, therefore can judge that described vehicle is not positioned at the outside of the fence region ABCDEFGHIJK of described concave polygon further.
And when if Current vehicle is positioned at the X point shown in Fig. 5, Z point or M point, then by judging to learn that described X point, Z point or M point are all positioned at the right side of all reference lines of described virtual polygonal region, therefore can obtain described X point, Z point or M point to be all positioned within described virtual polygonal region ABCDEF, now just need to judge whether described X point, Z point or M point are positioned at the inside of the auxiliary area ALKJIHGF of described interpolation further; If be positioned at the inside of described auxiliary area ALKJIHGF, then Current vehicle does not just enter described fence region ABCDEFGHIJK, otherwise then Current vehicle enters described fence region ABCDEFGHIJK.
Whether the position about Current vehicle place is positioned at the determination methods of the inside of described auxiliary area ALKJIHGF, can with reference to method described above.
Specifically, first can judge that described auxiliary area ALKJIHGF is Convex Polygon Domain or concave polygon region; If Convex Polygon Domain, then directly whether can be positioned at the same side of all reference lines of Convex Polygon Domain according to Current vehicle position, judge whether Current vehicle position is positioned at the inside of described auxiliary area ALKJIHGF.
If described auxiliary area ALKJIHGF is concave polygon region, as shown in Figure 6, then according to above-mentioned determination methods, first crucial summit L and G making described auxiliary area ALKJIHGF become concave polygon region is found out, by adding after virtual boost line A-K removes described crucial summit L, the polygonal region AKJIHGF of formation is still concave polygon region; After now can removing described crucial summit G further by the virtual boost line H-F of interpolation, the polygonal region AKJIHF of formation is Convex Polygon Domain.In other words, be used as auxiliary area by increasing delta-shaped region ALK and delta-shaped region FGH, thus the auxiliary area ALKJIHGF of described concave polygon is converted to Convex Polygon Domain AKJIHF further.
Then, just can judge whether Current vehicle position is positioned at the inside of described Convex Polygon Domain AKJIHF further.
Particularly, if Current vehicle position is X point, then now judge that described X point is not positioned at the same side of all reference lines of described Convex Polygon Domain AKJIHF, therefore described X point is not positioned at the inside of described Convex Polygon Domain AKJIHF.Auxiliary area ALKJIHGF due to described concave polygon is the subset of described Convex Polygon Domain AKJIHF, and therefore described X point is also the inside of the auxiliary area ALKJIHGF being positioned at described concave polygon scarcely.Thus, in conjunction with the described X point judged above within described virtual polygonal region ABCDEF, just can infer that the vehicle being currently located at X point enters described fence region ABCDEFGHIJKL.
If Current vehicle is positioned at described Z point or M point, then now judge that described Z point or M point are positioned at the same side of all reference lines of described Convex Polygon Domain AKJIHF, therefore described Z point or M point are positioned at the inside of described Convex Polygon Domain AKJIHF.Then can judge further by similar method whether described Z point or M point are positioned at the inside of triangle auxiliary area ALK and FGH, obtain described Z point not in the inside of described triangle auxiliary area ALK and FGH, therefore can judge that described Z point is positioned at the inside of the auxiliary area ALKJIHGF of described concave polygon, just can infer that the vehicle being currently located at X point does not enter the inside of described fence region ABCDEFGHIJKL thus further.And described M point is positioned at the inside of one of them triangle auxiliary area FGH just, therefore described M point is not positioned at the inside of the auxiliary area ALKJIHGF of described concave polygon, now combine the described M point judged above within described virtual polygonal region ABCDEF, just can infer that the vehicle being currently located at M point enters described fence region ABCDEFGHIJKL.
More than describe is carry out by recursion method the scheme that judges when being complicated concave polygon region in described fence region, the termination condition of recurrence be current be positioned at the convex polygon auxiliary area of the Convex Polygon Domain that finally builds and interpolation in the process when can judge vehicle position inside or outside till, no matter recurrence which floor, as long as every layer of negate once just can.Comprehensive above description can be found out, no matter on earth how the shape in fence region, and be no matter the polygonal region of how complexity on earth, whether vehicle enters described fence region to adopt scheme provided by the invention to judge exactly.
Compared to prior art, the detection method that vehicle provided by the invention enters polygon fence region builds reference line according to the summit in the fence region of convex polygon, and by judging that the same side whether vehicle position is positioned at all reference lines judges whether vehicle enters polygon fence region further, detect evaluation algorithm comparatively simple and practical and accurately.In addition, can virtual convex polygon be built thus also go for above-mentioned detection determination methods by increase auxiliary area when fence region is concave polygon, therefore method provided by the invention is equally applicable to the fence region of convex polygon and concave polygon, the scope of application is wider compared to existing technologies, and testing result accurately and reliably.
The foregoing is only embodiments of the invention; not thereby the scope of the claims of the present invention is limited; every utilize description of the present invention to do equivalent structure or equivalent flow process conversion; or be directly or indirectly used in other relevant technical field, be all in like manner included within scope of patent protection of the present invention.

Claims (8)

1. vehicle enters the detection method in polygon fence region, it is characterized in that, comprising:
Judge that fence region is Convex Polygon Domain or concave polygon region;
If described fence region is concave polygon region, converts concave polygon region to Convex Polygon Domain and process;
If described fence region is Convex Polygon Domain, based on described Convex Polygon Domain each bar limit and according to building the directive reference line of tool clockwise or counterclockwise, and judge whether vehicle is positioned at the same side of all reference lines in described fence region;
If described vehicle is positioned at the same side of all reference lines in described fence region, judge that described vehicle enters described fence region.
2. vehicle as claimed in claim 1 enters the detection method in polygon fence region, it is characterized in that, also comprises: judging that described vehicle starts instruction of reporting to the police after entering described fence region.
3. vehicle as claimed in claim 1 enters the detection method in polygon fence region, and it is characterized in that, described judgement fence region is that Convex Polygon Domain or concave polygon region comprise:
The summit in polygon fence region is extracted;
Based on the connecting line on adjacent two summits in described polygon fence region, according to building the directive reference line of described tool clockwise or counterclockwise;
Using any one reference line as with reference to line, judge whether other summits in described polygon fence region except the summit of described reference line are all positioned at the same side of described reference line; If be all positioned at the same side, then can judge that described polygon fence region is Convex Polygon Domain; Otherwise, can judge that described polygon fence region is concave polygon region.
4. vehicle as claimed in claim 1 enters the detection method in polygon fence region, it is characterized in that, describedly concave polygon region is converted to the step that Convex Polygon Domain carries out processing and comprises:
Search the crucial summit that described fence region of sening as an envoy to becomes concave polygon region;
According to described crucial summit, increase auxiliary area in described concave polygon region, build virtual Convex Polygon Domain.
5. vehicle as claimed in claim 4 enters the detection method in polygon fence region, it is characterized in that, the lookup method on described crucial summit comprises: if using adjacent two reference lines at place, some summits as during with reference to line, all find that other summits lay respectively at the not homonymy of described reference line, then described summit is the crucial summit making described fence region become concave polygon region.
6. vehicle as claimed in claim 5 enters the detection method in polygon fence region, it is characterized in that, the virtual Convex Polygon Domain of described structure comprises:
Two virtual boost lines in summit adjacent with described crucial summit in described fence region are coupled together, and gets rid of described crucial summit thus form a virtual polygonal region.
7. vehicle as claimed in claim 6 enters the detection method in polygon fence region, it is characterized in that, describedly concave polygon region is converted to the step that Convex Polygon Domain carries out processing and also comprises:
Based on each bar limit of described virtual Convex Polygon Domain according to building described virtual Convex Polygon Domain reference line clockwise or counterclockwise, judge whether vehicle is positioned at the same side of all reference lines of described virtual Convex Polygon Domain;
If described vehicle is positioned at the same side of all reference lines of described virtual Convex Polygon Domain, judge whether described vehicle is positioned at described auxiliary area;
If described vehicle is positioned at the same side of all reference lines of described virtual Convex Polygon Domain and is not positioned at described auxiliary area, then judge that vehicle enters described fence region.
8. vehicle as claimed in claim 6 enters the detection method in polygon fence region, it is characterized in that, also comprise: if the virtual polygonal region got rid of described crucial summit and form is still concave polygon region, whether described vehicle is positioned at described virtual polygonal region inside to adopt recursive fashion to judge.
CN201410740462.7A 2014-12-08 2014-12-08 Vehicle enters the detection method in polygon fence region Active CN104575081B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410740462.7A CN104575081B (en) 2014-12-08 2014-12-08 Vehicle enters the detection method in polygon fence region

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410740462.7A CN104575081B (en) 2014-12-08 2014-12-08 Vehicle enters the detection method in polygon fence region

Publications (2)

Publication Number Publication Date
CN104575081A true CN104575081A (en) 2015-04-29
CN104575081B CN104575081B (en) 2018-01-09

Family

ID=53091022

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410740462.7A Active CN104575081B (en) 2014-12-08 2014-12-08 Vehicle enters the detection method in polygon fence region

Country Status (1)

Country Link
CN (1) CN104575081B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107562895A (en) * 2017-09-06 2018-01-09 上海享骑电动车服务有限公司 Geography fence
CN107610455A (en) * 2017-09-06 2018-01-19 上海享骑电动车服务有限公司 Fence
CN107886707A (en) * 2017-11-02 2018-04-06 芒果出行(北京)科技有限公司 Optimization method and device, vehicle monitoring method and the device of geographic region
CN108230664A (en) * 2018-02-02 2018-06-29 辽宁友邦网络科技有限公司 Vehicles management method based on virtual electronic fence
CN108507581A (en) * 2017-02-28 2018-09-07 北京嘀嘀无限科技发展有限公司 The method and device of stroke state prompt message is sent to user
CN109741633A (en) * 2019-02-22 2019-05-10 三一汽车制造有限公司 Region security running method and vehicle
CN113313620A (en) * 2021-06-10 2021-08-27 平安国际智慧城市科技股份有限公司 Method, device and equipment for detecting vehicle and storage medium

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1405034A (en) * 2001-08-13 2003-03-26 厦门雅迅网络股份有限公司 Over-boundary defining method for alarming vehicle over-boundary
US20070194924A1 (en) * 2006-02-21 2007-08-23 Karr Lawrence J Electronic Fence Mode Alert System and Method
CN102213767A (en) * 2011-04-08 2011-10-12 浙江工业大学 Positioning control method for closed region of vehicle-mounted GPS (Global Positioning System)
CN102982562A (en) * 2012-10-19 2013-03-20 浙江中正智能科技有限公司 Method for judging whether target point is positioned inside polygon area
CN103106807A (en) * 2013-01-11 2013-05-15 南威软件股份有限公司 Method of location early warning in official vehicle monitoring
CN103106781A (en) * 2013-01-11 2013-05-15 深圳市领华卫通数码科技有限公司 Hot spot region alarm method and service platform based on global position system (GPS) information
CN103280041A (en) * 2013-05-08 2013-09-04 广东电网公司珠海供电局 Monitoring method and monitoring system for automatic deploying virtual electronic fence
US20130239904A1 (en) * 2009-11-03 2013-09-19 Dt Systems, Inc. Hand controller for electronic trainer
CN104123737A (en) * 2014-07-15 2014-10-29 沈颖 Testing method for judging inclusivity of points on inner portion, outer portion or boundary of polygonal area

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1405034A (en) * 2001-08-13 2003-03-26 厦门雅迅网络股份有限公司 Over-boundary defining method for alarming vehicle over-boundary
US20070194924A1 (en) * 2006-02-21 2007-08-23 Karr Lawrence J Electronic Fence Mode Alert System and Method
US20130239904A1 (en) * 2009-11-03 2013-09-19 Dt Systems, Inc. Hand controller for electronic trainer
CN102213767A (en) * 2011-04-08 2011-10-12 浙江工业大学 Positioning control method for closed region of vehicle-mounted GPS (Global Positioning System)
CN102982562A (en) * 2012-10-19 2013-03-20 浙江中正智能科技有限公司 Method for judging whether target point is positioned inside polygon area
CN103106807A (en) * 2013-01-11 2013-05-15 南威软件股份有限公司 Method of location early warning in official vehicle monitoring
CN103106781A (en) * 2013-01-11 2013-05-15 深圳市领华卫通数码科技有限公司 Hot spot region alarm method and service platform based on global position system (GPS) information
CN103280041A (en) * 2013-05-08 2013-09-04 广东电网公司珠海供电局 Monitoring method and monitoring system for automatic deploying virtual electronic fence
CN104123737A (en) * 2014-07-15 2014-10-29 沈颖 Testing method for judging inclusivity of points on inner portion, outer portion or boundary of polygonal area

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
丁健 等: ""基于边方向角长度表示的多边形方向、凹凸性及点包含算法"", 《计算机辅助设计与图形学学报》 *
宋晓眉 等: ""简单多边形顶点凹凸性判断算法综述"", 《国土资源遥感》 *
朱传敏 等: ""凹多边形凸分解算法在快速原型中的应用"", 《现代制造工程》 *
李积元: ""点集在凸多边形内外判断算法的拓扑映射方法"", 《青海大学学报(自然科学版)》 *
王承翔 等: "平面多边形凹凸性的算法研究", 《湖南大学学报》 *
贺琰旻: ""电子围栏行业发展趋势探析与创新功能分析"", 《技术与应用》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108507581A (en) * 2017-02-28 2018-09-07 北京嘀嘀无限科技发展有限公司 The method and device of stroke state prompt message is sent to user
CN107562895A (en) * 2017-09-06 2018-01-09 上海享骑电动车服务有限公司 Geography fence
CN107610455A (en) * 2017-09-06 2018-01-19 上海享骑电动车服务有限公司 Fence
CN107886707A (en) * 2017-11-02 2018-04-06 芒果出行(北京)科技有限公司 Optimization method and device, vehicle monitoring method and the device of geographic region
CN107886707B (en) * 2017-11-02 2019-12-24 芒果出行(北京)科技有限公司 Geographic block optimization method and device, and vehicle monitoring method and device
CN108230664A (en) * 2018-02-02 2018-06-29 辽宁友邦网络科技有限公司 Vehicles management method based on virtual electronic fence
CN109741633A (en) * 2019-02-22 2019-05-10 三一汽车制造有限公司 Region security running method and vehicle
CN113313620A (en) * 2021-06-10 2021-08-27 平安国际智慧城市科技股份有限公司 Method, device and equipment for detecting vehicle and storage medium

Also Published As

Publication number Publication date
CN104575081B (en) 2018-01-09

Similar Documents

Publication Publication Date Title
CN104575081A (en) Method for detecting entrance of vehicle into polygonal electronic fence region
CN111144330B (en) Deep learning-based lane line detection method, device and equipment
US9330343B2 (en) Image analysis apparatus mounted to vehicle
CN110967028B (en) Navigation map construction method and device, robot and storage medium
US20160103202A1 (en) Mobile Robot and Sound Source Position Estimation System
US10210411B2 (en) Method and apparatus for establishing feature prediction accuracy
CN111998860A (en) Automatic driving positioning data verification method and device, electronic equipment and storage medium
CN114005282B (en) Intelligent city traffic management system and method based on crowd sensing
CN107862863B (en) Method and device for improving traffic data quality
CN113933858A (en) Abnormal detection method and device of positioning sensor and terminal equipment
CN107480592B (en) Multi-lane detection method and tracking method
WO2022116831A1 (en) Positioning method and apparatus, electronic device and readable storage medium
CN110033492B (en) Camera calibration method and terminal
CN109615679B (en) Identification method of house type component
CN113971697A (en) Air-ground cooperative vehicle positioning and orienting method
US10339394B2 (en) Step detection device and step detection method
KR20180055433A (en) Autonomous driving system fail-safe utility and method thereof
CN116086429A (en) Map updating method, device, equipment and computer readable storage medium
CN105516164A (en) P2P botnet detection method based on fractal and self-adaptation fusion
CN113671530B (en) Pose determination method and device, storage medium and electronic equipment
US20190162544A1 (en) Route information conversion system, route information transmission apparatus, and route information reception apparatus
JP2013148948A (en) Lane detector
JP6057660B2 (en) Lane monitoring system and lane monitoring method
CN113325415A (en) Fusion method and system for vehicle radar data and camera data
CN112270357A (en) VIO vision system and method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C53 Correction of patent of invention or patent application
CB02 Change of applicant information

Address after: 518052, A, building two, phase 1057, science and technology building, Nanhai Road, Shenzhen, Guangdong, Nanshan District, China 501A

Applicant after: FIBOCOM WIRELESS INC.

Address before: 518052, A, building two, phase 1057, science and technology building, Nanhai Road, Shenzhen, Guangdong, Nanshan District, China 501A

Applicant before: Shenzhen G&T Industrial Development Co., Ltd.

COR Change of bibliographic data

Free format text: CORRECT: APPLICANT; FROM: SHENZHEN G+T INDUSTRIAL DEVELOPMENT CO., LTD. TO: SHENZHEN FIBOCOM WIRELESS INC.

C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant