CN106488400B - Generate the method and device of geography fence - Google Patents
Generate the method and device of geography fence Download PDFInfo
- Publication number
- CN106488400B CN106488400B CN201510547426.3A CN201510547426A CN106488400B CN 106488400 B CN106488400 B CN 106488400B CN 201510547426 A CN201510547426 A CN 201510547426A CN 106488400 B CN106488400 B CN 106488400B
- Authority
- CN
- China
- Prior art keywords
- road
- interest
- closure
- point
- points
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Instructional Devices (AREA)
Abstract
The present invention discloses a kind of method and device for generating geography fence, wherein this method comprises: traversal interest point set is determined to cover the target circle of all points of interest to each point of interest；In target circle, acquisition being capable of end to end closure road；The closure road that cannot cover all points of interest is rejected, the closure road left after having rejected forms effectively closed road set；In effectively closed road set, the area of each closure road is calculated, chooses the smallest closure road of area as geography fence；Geography fence is plotted on map.The present invention is based on being closed road data in point of interest and map to automatically generate accurate geography fence, manual operations can be greatly reduced, reduce labor workload, improve the efficiency for drawing geography fence.
Description
Technical field
The present invention relates to field of location service technology more particularly to a kind of method and devices for generating geography fence.
Background technique
By dividing geography fence, different service areas can be distinguished on the electronic map, is convenient for all trades and professions business
Development, such as judge whether personnel or vehicle enter in fence in violation of rules and regulations outside fence, or whether leave out of fence.
A kind of method in the prior art clicks shortest path using manual point-by-point mapping geography fence, and in head and the tail,
But since geography fence is often irregular polygon, if manually operation mouse is drawn, one for drawing geography fence
Side needs that map is constantly expanded to maximum level, visual to draw relatively accurate boundary, and due to maximum level
Range is narrow, generally requires constantly to slide map, so as to complete side extended line drafting, after a line of completing,
It needs to zoom to map into normal visible ratio, to observe the effect drawn, and prepares the drafting of lower a line；When needs are drawn
When multiple summits processed, need repeatedly to operate repeatedly by hand, manual work amount burdensome, and the geography fence drawn is easy
It is influenced by human factor, it is inaccurate sometimes.
When another kind method in the prior art draws geography fence, density serious offense is found inside the region of target fence
Then the point of interest of certain threshold value joins end to end to form closure section using these points as significant key point, but such as
The Density Distribution in the fruit region is more dispersed to be unable to satisfy threshold value or central area is big and boundary density is small, then is difficult to pass through
This method efficiently accomplishes the automatic drafting of fence.
Therefore, it is necessary to propose a kind of method of generation geography fence to solve the above problems.
Summary of the invention
The disclosure technical problem to be solved is how to propose a kind of method for automatically generating geography fence, improves life
At the efficiency of geography fence, labor workload is reduced.
The disclosure provides a kind of method for generating geography fence, comprising: traversal interest point set determines each point of interest
The target circle of all points of interest can be covered；Obtaining in target circle being capable of end to end closure road；Rejecting cannot cover
The closure road of all points of interest, the closure road left after having rejected form effectively closed road set；Effectively closed
In road set, the area of each closure road is calculated, chooses the smallest closure road of area as geography fence；By geography fence
It is plotted on map.
Further, interest point set is traversed, each point of interest is determined to cover target circle, the packet of all points of interest
It includes: drawing target circle centered on point of interest and with initial radium value；Judge whether target circle can cover the institute of interest point set
Interesting point, if it is not, then expanding initial radium value, and continues picture target circle by the center of circle of point of interest, until interest point set
In all points of interest all in target circle；It being capable of end to end closure road if it is, being obtained in target circle.
Further, the initial radium of target circle is set as R, if the circle that radius is R can cover all of interest point set
Point of interest, then in the target circle that radius is R, built-in road data Automatic-searching can cover all points of interest according to the map
Closure road, and the information of the closure road searched out is included into effectively closed road set；If in the target circle that radius is R
Inside fail to find the closure road of all points of interest of covering interest point set, is then RX, RX in radius2Or the mesh that radius is bigger
Until finding the closure road that can cover all points of interest of interest point set in mark circle, and the letter for being closed road that will be searched out
Breath is included into effectively closed road set, wherein X > 1.
Further, in target circle, acquisition being capable of end to end closure road, comprising: all roads in traversal map
The road of all starting points and end point all in target circle is included into set M { m by road1,m2,..,mn}；An optional miIt opens
Begin, searching and miThere is the road m of public pointj, if there is a plurality of, form multiple branches and continue；For mj, continue above-mentioned mistake
Journey, until searching out energy and miUntil the road of closure, 1 or multiple closure roads are finally obtained.
Further, geography fence is plotted on map includes: the longitude and latitude for obtaining the closure road as geography fence
Spend information aggregate；The longitude and latitude for being closed road is presented on map with the method got ready, the automation for completing geography fence is drawn
System.
The disclosure also provides a kind of device for generating geography fence, comprising: point of interest spider module, for traversing point of interest
Set, is determined to each point of interest to cover the target circle of all points of interest；It is closed road computing module, in target circle
Interior acquisition being capable of end to end closure road；It is closed road and rejects module, closing for all points of interest cannot be covered for rejecting
Road is closed, the closure road left after having rejected forms effectively closed road set；Object boundary processing module, for having
In effect closure road set, the area of each closure road is calculated, chooses the smallest closure road of area as geography fence；Boundary
Drafting module, for geography fence to be plotted to map.
Further, point of interest spider module is also used to: drawing target circle centered on point of interest and with initial radium value；Sentence
Whether disconnected target circle can cover all points of interest of interest point set, if it is not, then expanding initial radium value, and with point of interest
Continue picture target circle for the center of circle, until all points of interest in interest point set are all in target circle；If it is, in target circle
Interior acquisition being capable of end to end closure road.
Further, the initial radium of target circle is set as R, if the circle that radius is R can cover all of interest point set
Point of interest, then in the target circle that radius is R, closure road computing module built-in road data Automatic-searching energy according to the map
The closure road of all points of interest is enough covered, and the information of the closure road searched out is included into effectively closed road set；
If failing to find the closure road of all points of interest of covering interest point set in the target circle that radius is R, close
Closing road computing module is then RX, RX in radius2Or find that can to cover interest point set all in the bigger target circle of radius
Until the closure road of point of interest, and the information of the closure road searched out is included into effectively closed road set, wherein X > 1.
It is closed road and rejects module, for obtaining the face of each closure road institute closed area in effectively closed road set
Product chooses geography fence of the area the smallest closure road in closed area as interest point set.
Further, it is closed road computing module, for traversing all roads in map, by all starting points and end point
Road all in target circle is included into set M { m1,m2,..,mn}；An optional miStart, searching and miThere is the road of public point
Road mj, if there is a plurality of, form multiple branches and continue；An optional miStart, searching and miThere is the road m of public pointj, such as
Fruit has a plurality of, forms multiple branches and continues；For mj, proceed as described above, until searching out energy and miUntil the road of closure,
Finally obtain 1 or multiple closure roads.
Further, boundary mapping module is used to obtain the latitude and longitude information set of the closure road as geography fence；
The longitude and latitude for being closed road is presented on map with the method got ready, the automation for completing geography fence is drawn.
The generation geography fence method and device that the disclosure provides, certainly based on closure road data in point of interest and map
It is dynamic to generate accurate geography fence, and manual operations can be greatly reduced, labor workload is reduced, improves and draws geography fence
Efficiency.
Detailed description of the invention
Fig. 1 shows the flow chart of the generation geography fence method of one embodiment of the invention.
Fig. 2 shows the flow charts of the generation geography fence method of another embodiment of the present invention.
Fig. 3 shows the schematic diagram of the generation geography fence process of another embodiment of the invention.
Fig. 4 shows the effect diagram for the geography fence of one embodiment of the invention actually generated.
Fig. 5 shows the structural block diagram of the device of the generation geography fence of one embodiment of the invention.
Fig. 6 shows a kind of structural block diagram of the equipment of generation geography fence of another embodiment of the invention.
Specific embodiment
With reference to the accompanying drawings to invention is more fully described, wherein illustrating exemplary embodiment of the present invention.
Fig. 1 shows the flow chart of the generation geography fence method of one embodiment of the invention.As shown in Figure 1, this method master
Include:
Step 100, traversal interest point set is determined to cover the target circle of all points of interest to each point of interest.
In an organization internal, if there is multiple geography fences carry out segmentation services range, then for the ease of management and area
Point, why it is boundary with road that tissue if often requiring that between each status fence using road as boundary, be because of many business
Development be the static region as the cells of both sides of the road, office building, rather than dynamic area of driving a vehicle as the road,
It therefore can be using road as the boundary in point of interest area.
Specifically, under normal circumstances, need to draw the organization unit of geography fence be to the service area of oneself it is known,
By long-term business development, to the data of the point of interest (Point of Interest, POI) of one's respective area longitude and latitude in other words
Collection has certain accumulation, forms the longitude and latitude database of itself, and each POI includes four aspect information, title, classification, longitude latitude
The information such as degree, neighbouring retail shop, restaurant, hotel can be referred to as " navigation map information ", and navigation map data is that entire navigation produces
The foundation stone of industry.
In one embodiment, some interest that can substantially cover service area can be temporarily clicked on the electronic map
Point, and geography fence is determined according to these temporary interests points.
In one embodiment, which may include: to draw target circle centered on point of interest and with initial radium value；Sentence
Whether disconnected target circle can cover all points of interest of interest point set, if it is not, then expanding initial radium value, and with point of interest
Continue picture target circle for the center of circle, until all points of interest in interest point set are all in target circle；If it is, in target circle
Interior acquisition being capable of end to end closure road.
For example, when being determined to cover the target circle of all points of interest, it can gradually expand radius and draw circle, successively increase
Big k value judges radius for RXkCircle whether can cover all points of interest in interest point set, wherein X be greater than 1, k be nature
Number.For example, can be respectively with radius R, RX1、RX2、RX3... circle is drawn, judges radius R, RX, RX2、RX3... circle can cover it is emerging
All points of interest of interesting point set.In one embodiment, it can be gradually increased radius in a manner of direct proportion and draw circle.
Although drawing circle in the form of exponential form or direct proportion is example to explain, it will be understood by those in the art that
The invention is not limited thereto, otherwise increased radius can also draw circle.
Step 102, in target circle, acquisition being capable of end to end closure road.
In one embodiment, all roads in map are traversed, by all starting points and end point all in target circle
Road is included into set M { m1, m2 .., mn }；An optional mi starts, and the road mj for having public point with mi is found, if there is more
Item then forms multiple branches and continues；It for mj, proceeds as described above, until searching out the road that can be closed with mi.In this way
The road that may search for can form a multiway tree, last available 1 or multiple closure roads.
Step 104, the closure road that cannot cover all points of interest is rejected, the closure road composition left after having rejected
Effectively closed road set.
In one embodiment, the initial radium that target circle can be set is set as R, if radius be R circle can cover it is emerging
All points of interest of interesting point set, then in the target circle that radius is R, built-in road data Automatic-searching can according to the map
The closure road of all points of interest is covered, and the information of the closure road searched out is included into effectively closed road set；If
Fail to find the closure road of all points of interest of covering interest point set in the target circle that radius is R, then radius be RX,
RX2Or until in the bigger target circle of radius finding the closure road that can cover all points of interest of interest point set, and it will seek
The information of the closure road found is included into effectively closed road set, wherein X > 1.
In one embodiment, RX can be usedkThe radius of target circle is represented, wherein R indicates that initial radium, X indicate radius
Growth rate, k is the natural number since 0, if radius is RXkK-th of circle can cover all points of interest of interest point set,
It is then RX in radiuskCircle in, built-in road data Automatic-searching can cover the closure road of all points of interest according to the map
Road, and the information of the closure road searched out is included into effectively closed road set；If being RX in radiuskK-th of circle in not
The closure road that all points of interest of covering interest point set can be found continues to increase k value, until in radius RXk+1Or radius is more
Until finding the closure road that can cover all points of interest of interest point set in big circle, and the closure road that will be searched out
Information is included into effectively closed road set.
Step 106, in effectively closed road set, the area of each closure road is calculated, the smallest closure of area is chosen
Road is as geography fence.
It is, for example, possible to use the areas that lattice Method calculates each closure road closed region, after rasterizing map, pass through meter
Calculate the area that the lattice point number in closure road determines closure road.
In one embodiment, other api interfaces in the prior art be may call upon
Step 108, geography fence is plotted on map.
In one embodiment, the latitude and longitude information set of the closure road as geography fence is obtained；Road will be closed
Longitude and latitude be presented on map with the method got ready, complete geography fence automation draw.
The geography fence generation method of the embodiment of the present invention is automatically generated based on road data is closed in point of interest and map
The geography fence of high accuracy, and manual operations can be greatly reduced, workload is reduced, the effect for drawing geography fence is improved
Rate.
Fig. 2 shows the flow charts of the generation geography fence method of another embodiment of the present invention.As shown in Fig. 2, this method
Include:
Step 200, point of interest is defined as a set A, successively traverses all points of interest inside set A.Specifically
Ground, the mode for traversing interest point set can be order traversal or backward traversal, dichotomy traversal etc., as long as being able to achieve traversal institute
The effect of interesting point.
Step 201, to each point of interest in set A, gradually expand radius and draw circle.For example, can be set round initial
Radius is R, with radius R, RX, RX2... picture target circle.
Step 202, judge that can target circle cover all points of interest in set A.
If point of interest all in set A can be covered with the circle that radius R is drawn, 203 are thened follow the steps, it is interior according to the map
Road of the road data Automatic-searching set to closure；If radius cannot be covered interesting in set A by the target circle of R
Point, thens follow the steps 204, continues to expand radius picture circle, the target circle of all points of interest in set A can be covered until that can find
Until.
Specifically, it can judge that can target circle cover all points of interest in set using apart from comparative approach, due to
The longitude and latitude in the center of circle it is known that can calculate each point of interest to the current center of circle distance, for example, by using d=sqrt ((xi-x0)2+
(yi-y0)2) calculate the distance of each point of interest to the center of circle, known radius after calculating distance d, with current target circle
R compares, if the distance d in each point of interest to the center of circle, which is respectively less than, is equal to known radius R, then it is assumed that the target circle can cover collection
All points of interest for closing A, if there is the distance d of some point of interest to the center of circle is all larger than known radius R, then it is assumed that current circle
All points of interest cannot be covered, then needs to continue to expand radius and draws circle.Certainly, judge that can target circle cover all points of interest
It can also be general-purpose algorithm using map field, such as may call upon some API in graphical development field, can be realized and above-mentioned sentence
Disconnected effect.
Specifically, step 203 may include following below scheme: all roads in traversal map, starting point and end point all exist
Road in target circle is included into set M { m1,m2,..,mn}；An optional miStart, searching and miThere is the road m of public pointj,
If there is a plurality of, form multiple branches and continue；For mj, proceed as described above, until searching out certain road energy and miClosure.
In this way, searching structure is a multiway tree, 1 or multiple closure roads are finally obtained.It specifically can choose recursion cycle
Mode has traversed all road datas, is determined to the closure road of closed all points of interest.
Step 205, can the closure road that judgment step 203 searches out cover all points of interest in set A.If can
All points of interest closure road that can be covered in set A is found, 206 is thened follow the steps, the closure road found is included into collection
Close B；If the closure road that can cover all points of interest in set A cannot be found in target circle, 207 are thened follow the steps, after
It is continuous to expand picture circle, and recycle and execute step S203 and S205, it is interested in until finding to cover in set A in target circle
Until the closure road of point.
Specifically, if the circle of radius R can not cover all points of interest, by increasing radius to R*X, X is adjustable and X > 1,
If still can not coverage goal circle in all points of interest, continue expand radius to R*X*X, and circuit sequentially expansion partly
Diameter, and so on the road of the closure of all points of interest is covered until that can find.
If the closure road found covers all points of interest, it is included into set B, wherein if such
It is closed road more than one and also falls under set B as long as meeting above-mentioned condition.
Step 208, all closure roads in set B are traversed, calculate the area of closed area one by one.
Specifically, after having traversed all the points in set A, set B is handled, each blocked road traversed in set B is
Polygon, one by one reference area.
Step 209, geography fence of the smallest closure road of area as set A is selected.
Step 210, the longitude and latitude of the blocked road of the geography fence is presented on map with the method got ready, completes ground
The automation for managing fence is drawn.
Fig. 3 shows the schematic diagram of the generation geography fence process of another embodiment of the invention.As shown in figure 3, in set A
There are multiple points of interest, asterisk point is that first point of traversal is expanded as if the circle of radius R cannot cover all points of interest
R*X calculates 3 closure roads in the circle that radius is R*X, but judges that discovery closure road 3 can not cover and be interested in
Point then rejects closure road 3, is left closure road 1 and 2, and closure road 1 and 2 is included into set B.And so on, it has traversed
All points of interest of set A, obtaining includes multiple set B for being closed roads, successively the closing of the closure road in set of computations B
Region area, the smallest closure road of reference area fence as a result.
Fig. 4 shows the effect diagram for the geography fence of one embodiment of the invention actually generated.As shown in figure 4, emerging
Interest point region has multiple points to indicate that POI point, the fence of area peripheral edge are to calculate the minimum fence generated.
The geography fence generation method of the embodiment of the present invention, steps through method using point of interest, automatic in target circle
The closure road of multiple all points of interest of covering is generated, then choosing area minimum in closure road, electronics encloses as a result
Column, geography fence of disposably completing are that other any patents all do not adopt used method.In compared with the existing technology
Density processing method is carried out to point of interest, consideration is handled to each point of interest, it is more perfect to the processing of point of interest, in target
The road that multiple closures are disposably obtained in region, by choosing the closure road of minimum area as last fence.Relatively
In in the prior art for each person every day averagely draw 5 fences efficiency, the method provided according to embodiments of the present invention, for each person every day
Average draw can draw 30 fences, it is time-consuming seldom draw work, and be automatically performed, the time, major expenses were in interest point data
Above, this method can be used in the products such as vehicle location service for the importing in library.
Fig. 5 shows the structural block diagram of the device of the generation geography fence of one embodiment of the invention.As shown in figure 5, the dress
It sets and includes:
Point of interest spider module 501 is determined to covering to each point of interest and is interested in for traversing interest point set
The target circle of point.
It is closed road computing module 502, in target circle, acquisition being capable of end to end closure road.
Closure road is rejected module 503 and is stayed after having rejected for rejecting the closure road that cannot cover all points of interest
Under closure road form effectively closed road set.
Object boundary processing module 504, in effectively closed road set, calculating the area of each closure road, choosing
Take the smallest closure road of area as geography fence.
Boundary mapping module 505, for geography fence to be plotted to map.
In one embodiment, point of interest spider module 501 is also used to: centered on point of interest and with initial radium value picture
Target circle；Judge whether target circle can cover all points of interest of interest point set, if it is not, then expand initial radium value,
And continue picture target circle by the center of circle of point of interest, until all points of interest in interest point set are all in target circle；If so,
Then obtaining in target circle being capable of end to end closure road.
In one embodiment, closure road computing module 502 is for traversing all roads in map, by all starting points
Set M { m is included into road of the end point all in target circle1,m2,..,mn}；An optional miStart, searching and miHave public
The road m of endpointj, if there is a plurality of, form multiple branches and continue；An optional miStart, searching and miThere is public point
Road mj, if there is a plurality of, form multiple branches and continue；For mj, proceed as described above, until searching out energy and miClosure
Until road.
In one embodiment, the initial radium of target circle is set as R, if the circle that radius is R can cover interest point set
All points of interest, then in the target circle that radius is R, closure road computing module 502 built-in road data according to the map
Automatic-searching can cover the closure road of all points of interest, and the information of the closure road searched out is included into effectively closed road
Road set；If failing to find the closure road of all points of interest of covering interest point set, closure in the target circle that radius is R
Road computing module 502 is then RX, RX in radius2Or find that can to cover interest point set all in the bigger target circle of radius
Until the closure road of point of interest, and the information of the closure road searched out is included into effectively closed road set, wherein X > 1.
In one embodiment, closure road rejects module 503, for obtaining each closure in effectively closed road set
The area of road institute closed area chooses geography fence of the area the smallest closure road in closed area as interest point set.
In one embodiment, boundary mapping module 505 is used to obtain the longitude and latitude of the closure road as geography fence
Information aggregate；The longitude and latitude for being closed road is presented on map with the method got ready, the automation for completing geography fence is drawn.
Fig. 6 shows a kind of structural block diagram of the equipment of generation geography fence of another embodiment of the invention.It generates
The equipment 600 of geography fence can be the host server for having computing capability, personal computer PC or portable portable
Formula computer, mobile terminal or other terminals etc..The specific embodiment of the invention does not limit the specific implementation of calculate node.
The equipment 600 for generating geography fence includes processor (processor) 601, communication interface (Communications
Interface) 602, memory (memory) 603 and bus 604.Wherein, processor 601, communication interface 602 and storage
Device 603 completes mutual communication by bus 604.
Communication interface 602 is used for and network device communications, and wherein the network equipment includes such as Virtual Machine Manager center, shares
Storage etc..
Processor 601 is for executing program.Processor 601 can be a central processor CPU, or can be dedicated
Integrated circuit ASIC (Application Specific Integrated Circuit), or be arranged to implement this hair
One or more integrated circuits of bright embodiment.
Memory 603 is for storing file.Memory 603 may include high speed RAM memory, can also further include non-volatile
Property memory (non-volatile memory), for example, at least a magnetic disk storage.Memory 603 is also possible to memory
Array.Memory 603 is also possible to by piecemeal, and block can be combined into virtual volume by certain rule.
In one embodiment, above procedure can be the program code for including computer operation instruction.The program is specific
Can be used for: traversal interest point set is determined to each point of interest to cover the target circle of all points of interest；It is obtained in target circle
Taking being capable of end to end closure road；The closure road that cannot cover all points of interest is rejected, what is left after having rejected closes
It closes road and forms effectively closed road set；In effectively closed road set, the area of each closure road is calculated, area is chosen
The smallest closure road is as geography fence；Geography fence is plotted on map.
In one embodiment, interest point set is traversed, each point of interest is determined to cover all points of interest
Target circle includes: to draw target circle centered on point of interest and with initial radium value；Judge whether target circle can cover point of interest
All points of interest of set if it is not, then expanding initial radium value, and continue picture target circle by the center of circle of point of interest, until emerging
All points of interest in interesting point set are all in target circle；If it is, obtaining in target circle end to end can be closed
Road.
In one embodiment, the initial radium of target circle is set as R, if the circle that radius is R can cover interest point set
All points of interest closed, then in the target circle that radius is R, built-in road data Automatic-searching can cover institute according to the map
The closure road of interesting point, and the information of the closure road searched out is included into effectively closed road set；If being R in radius
Target circle in fail to find covering interest point set all points of interest closure road, then be RX, RX in radius2Or radius
Until finding the closure road that can cover all points of interest of interest point set in bigger target circle, and the closure that will be searched out
The information of road is included into effectively closed road set, wherein X > 1.
In one embodiment, in target circle, acquisition being capable of end to end closure road, comprising: traversal map
In all roads, the road of all starting points and end point all in target circle is included into set M { m1,m2,..,mn}；Optional one
A miStart, searching and miThere is the road m of public pointj, if there is a plurality of, form multiple branches and continue；For mj, continue on
Process is stated, until searching out energy and miUntil the road of closure, 1 or multiple closure roads are finally obtained.
In one embodiment, geography fence is plotted on map includes: the closure road obtained as geography fence
The latitude and longitude information set on road；The longitude and latitude for being closed road is presented on map with the method got ready, completes geography fence
Automation is drawn.
Those of ordinary skill in the art may be aware that each exemplary cell and algorithm in embodiment described herein
Step can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions actually with hardware also
It is software form to realize, the specific application and design constraint depending on technical solution.Professional technician can be directed to
It is specific that described function is realized using different methods is selected, but this realization is it is not considered that exceed model of the invention
It encloses.
If function and when sold or used as an independent product is realized in the form of computer software, certain
It is believed that all or part (such as the part that contributes to existing technology) of technical solution of the present invention is in terms of in degree
What the form of calculation machine software product embodied.The computer software product is generally stored inside computer-readable non-volatile memories
In medium, including some instructions are used so that computer equipment (can be personal computer, server or network equipment etc.)
Execute all or part of the steps of various embodiments of the present invention method.And storage medium above-mentioned include USB flash disk, it is mobile hard disk, read-only
Memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or
The various media that can store program code such as person's CD.
Description of the invention is given for the purpose of illustration and description, and is not exhaustively or will be of the invention
It is limited to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.It selects and retouches
It states embodiment and is to more preferably illustrate the principle of the present invention and practical application, and those skilled in the art is enable to manage
The solution present invention is to design various embodiments suitable for specific applications with various modifications.
Claims (8)
1. a kind of method for generating geography fence characterized by comprising
Interest point set is traversed, each point of interest is determined to cover the target circle of all points of interest；It specifically includes: with interest
Target circle is drawn centered on point and with initial radium value；Judge whether the target circle can cover being interested in for interest point set
Point if it is not, then expanding the initial radium value, and continues picture target circle by the center of circle of the point of interest, until interest point set
All points of interest in conjunction are all in the target circle；
It being capable of end to end closure road if so, being obtained in target circle；
The closure road that cannot cover all points of interest is rejected, the closure road left after having rejected forms effectively closed road
Set；
In effectively closed road set, the area of each closure road is calculated, chooses the smallest closure road of area as geographical
Fence；
The geography fence is plotted on map.
2. the method according to claim 1, wherein the traversal interest point set, to each point of interest determine
The target circle of all points of interest can be covered further include:
The initial radium of target circle is set as R, if radius is that the circle of R can cover all points of interest of interest point set, half
Diameter is in the target circle of R, and built-in road data Automatic-searching can cover the closure road of all points of interest according to the map, and
The information of the closure road searched out is included into effectively closed road set；
If failing to find the closure road of all points of interest of covering interest point set in the target circle that radius is R, half
Diameter is R × X, R × X2Or the closure road that can cover all points of interest of interest point set is found in the bigger target circle of radius
Until, and the information of the closure road searched out is included into effectively closed road set, wherein X > 1.
3. according to the method in claim 2, which is characterized in that it is described in target circle, obtain end to end can be closed
Road includes:
All roads in map are traversed, the road of all starting points and end point all in target circle is included into set M { m1,
m2,..,mn}；
An optional miStart, searching and miThere is the road m of public pointj, if there is a plurality of, form multiple branches and continue；
For mj, proceed as described above, until searching out energy and miUntil the road of closure, 1 or multiple closures are finally obtained
Road.
4. the method according to claim 1, wherein the described geography fence is plotted on map includes:
Obtain the latitude and longitude information set of the closure road as geography fence；
The longitude and latitude of the closure road is presented on map with the method got ready, the automation for completing geography fence is drawn.
5. a kind of device for generating geography fence characterized by comprising
Point of interest spider module is determined to each point of interest to cover the mesh of all points of interest for traversing interest point set
Mark circle；Specifically for drawing target circle centered on point of interest and with initial radium value；Judge whether the target circle can cover
All points of interest of interest point set if it is not, then expanding the initial radium value, and continue picture using the point of interest as the center of circle
Target circle, until all points of interest in interest point set are all in the target circle；
It is closed road computing module, when for all points of interest of interest point set can be covered in the target circle, in target
Obtaining in circle being capable of end to end closure road；
It is closed road and rejects module, for rejecting the closure road that cannot cover all points of interest, what is left after having rejected is closed
It closes road and forms effectively closed road set；
Object boundary processing module chooses area most in effectively closed road set, calculating the area of each closure road
Small closure road is as geography fence；
Boundary mapping module, for the geography fence to be plotted to map.
6. device according to claim 5, it is characterised in that:
The point of interest spider module is also used to the initial radium of target circle being set as R, if radius be R circle can cover it is emerging
All points of interest of interesting point set, then in the target circle that radius is R；The closure road computing module is built-in according to the map
Road data Automatic-searching can cover the closure road of all points of interest, and the information of the closure road searched out has been included into
Effect closure road set；
It is described to close if failing to find the closure road of all points of interest of covering interest point set in the target circle that radius is R
Closing road computing module is then R × X, R × X in radius2Or it is found in the bigger target circle of radius and can cover interest point set
Until the closure road of all points of interest, and the information of the closure road searched out is included into effectively closed road set, wherein X
>1；
The closure road rejects module, for obtaining the face of each closure road institute closed area in effectively closed road set
Product chooses geography fence of the area the smallest closure road in closed area as interest point set.
7. device according to claim 6, which is characterized in that the closure road computing module is also used to traverse map
In all roads, the road of all starting points and end point all in target circle is included into set M { m1,m2,..,mn}；Optional one
A miStart, searching and miThere is the road m of public pointj, if there is a plurality of, form multiple branches and continue；An optional miIt opens
Begin, searching and miThere is the road m of public pointj, if there is a plurality of, form multiple branches and continue；For mj, continue above-mentioned mistake
Journey, until searching out energy and miUntil the road of closure, 1 or multiple closure roads are finally obtained.
8. device according to claim 5, which is characterized in that the boundary mapping module is used as geography fence for obtaining
Closure road latitude and longitude information set；The longitude and latitude of the closure road is presented on map with the method got ready, it is complete
It is drawn at the automation of geography fence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510547426.3A CN106488400B (en) | 2015-08-31 | 2015-08-31 | Generate the method and device of geography fence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510547426.3A CN106488400B (en) | 2015-08-31 | 2015-08-31 | Generate the method and device of geography fence |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106488400A CN106488400A (en) | 2017-03-08 |
| CN106488400B true CN106488400B (en) | 2019-10-22 |
Family
ID=58236114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510547426.3A Active CN106488400B (en) | 2015-08-31 | 2015-08-31 | Generate the method and device of geography fence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106488400B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108961478B (en) * | 2017-05-19 | 2021-03-09 | 江苏猎吧科技有限公司 | Irregular electronic fence generation method of intelligent identification system for vehicle |
| CN110633344B (en) * | 2018-06-25 | 2021-08-24 | 北京嘀嘀无限科技发展有限公司 | Method and device for determining point-to-fence relationship and electronic equipment |
| CN109561387A (en) * | 2018-11-23 | 2019-04-02 | 北京摩拜科技有限公司 | Adjust the method, apparatus and server of fence |
| CN110087185A (en) * | 2019-03-16 | 2019-08-02 | 平安城市建设科技(深圳)有限公司 | Commercial circle fence generation method, device, equipment and computer readable storage medium |
| CN110570647A (en) * | 2019-09-06 | 2019-12-13 | 北京嘀嘀无限科技发展有限公司 | prompting method and system based on electronic fence |
| CN110650437B (en) * | 2019-11-27 | 2020-02-18 | 苏宁云计算有限公司 | Fence point deleting method and device on electronic fence and computer equipment |
| CN111831175B (en) * | 2020-01-17 | 2022-04-22 | 北京嘀嘀无限科技发展有限公司 | Geo-fence identification method and system, computer readable storage medium |
| CN112100520A (en) * | 2020-08-12 | 2020-12-18 | 华人运通(上海)云计算科技有限公司 | POI information pushing method and device, terminal equipment and storage medium |
| CN112257207B (en) * | 2020-10-27 | 2021-08-06 | 智慧足迹数据科技有限公司 | Road network boundary determining method and device, electronic equipment and storage medium |
| CN112435311A (en) * | 2020-12-11 | 2021-03-02 | 上海中通吉网络技术有限公司 | Method and device for generating electronic geo-fence |
| CN113468193A (en) * | 2021-07-01 | 2021-10-01 | 深圳集智数字科技有限公司 | Electronic map planning method, electronic map planning device, medium, and electronic apparatus |
| CN116347346B (en) * | 2023-05-29 | 2023-09-22 | 北京京东乾石科技有限公司 | Fence drawing method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101116119A (en) * | 2004-11-05 | 2008-01-30 | 韦尔里斯沃克斯国际有限公司 | Configuration and utilization of geographical zones to monitor and control movable entities |
| CN103200238A (en) * | 2013-03-13 | 2013-07-10 | 周良文 | Geography fencing intelligent network information system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9134427B2 (en) * | 2010-01-07 | 2015-09-15 | Qualcomm Incorporated | Determination of time zone and DST participation |
-
2015
- 2015-08-31 CN CN201510547426.3A patent/CN106488400B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101116119A (en) * | 2004-11-05 | 2008-01-30 | 韦尔里斯沃克斯国际有限公司 | Configuration and utilization of geographical zones to monitor and control movable entities |
| CN103200238A (en) * | 2013-03-13 | 2013-07-10 | 周良文 | Geography fencing intelligent network information system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106488400A (en) | 2017-03-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106488400B (en) | Generate the method and device of geography fence | |
| CN103533501B (en) | A kind of geography fence generation method | |
| US20160232179A1 (en) | Recommending points of interests in a region | |
| CN109478184B (en) | Identifying, processing, and displaying clusters of data points | |
| Wu et al. | An extended minimum spanning tree method for characterizing local urban patterns | |
| Batty et al. | The automatic definition and generation of axial lines and axial maps | |
| CN109118265A (en) | Commercial circle determines method, apparatus and server | |
| CN110175216A (en) | Coordinate error correction method, device and computer equipment | |
| Wei et al. | On the spatial distribution of buildings for map generalization | |
| Li et al. | Polygon-based approach for extracting multilane roads from OpenStreetMap urban road networks | |
| CN106488401B (en) | Generate the method and device of seamless adjacent geography fence | |
| CN108320323A (en) | A kind of 3 d modeling of building method and device | |
| CN109145171A (en) | A kind of multiple dimensioned map data updating method | |
| CN105468632B (en) | A kind of Geocoding and device | |
| CN106708837B (en) | Interest point searching method and device | |
| Deng et al. | Recognizing building groups for generalization: a comparative study | |
| CN107330734A (en) | Business address system of selection based on Co location patterns and body | |
| CN112861972A (en) | Site selection method and device for exhibition area, computer equipment and medium | |
| US9910878B2 (en) | Methods for processing within-distance queries | |
| CN110727740B (en) | Correlation analysis method and device, computer equipment and readable medium | |
| CN111475746B (en) | Point-of-interest mining method, device, computer equipment and storage medium | |
| CN108268504A (en) | A kind of method and apparatus for the region of search for dividing point of interest | |
| Zhang et al. | Distance Weight-Graph Attention Model-Based High-Resolution Remote Sensing Urban Functional Zone Identification. | |
| CN113709006B (en) | Flow determination method and device, storage medium and electronic device | |
| CN117370846B (en) | Hydraulic fracturing three-dimensional fracture network construction method and system based on microseism event |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |